Reasoning about nondeterministic and concurrent actions: A process algebra approach
- 31 January 1999
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 107 (1), 63-98
- https://doi.org/10.1016/s0004-3702(98)00104-0
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Representing action and change by logic programsThe Journal of Logic Programming, 1993
- The concurrency workbenchACM Transactions on Programming Languages and Systems, 1993
- Graphical versus logical specificationsTheoretical Computer Science, 1992
- Tableau-based model checking in the propositional mu-calculusActa Informatica, 1990
- Extensional equivalences for transition systemsActa Informatica, 1987
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- A modal characterization of observational congruence on finite terms of CCSInformation and Control, 1986
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Process algebra for synchronous communicationInformation and Control, 1984
- Results on the propositional μ-calculusTheoretical Computer Science, 1983