Priority and maximal progress are completely axiomatisable (extended abstract)
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 237-252
- https://doi.org/10.1007/bfb0055626
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Stochastic process algebras – between LOTOS and Markov chainsComputer Networks and ISDN Systems, 1998
- Branching time and abstraction in bisimulation semanticsJournal of the ACM, 1996
- A complete axiomatization of timed bisimulation for a class of timed regular behavioursTheoretical Computer Science, 1995
- Formal Characterisation of Immediate Actions in SPA with Nondeterministic BranchingThe Computer Journal, 1995
- An overview and synthesis on timed process algebrasPublished by Springer Nature ,1992
- Real time process algebraFormal Aspects of Computing, 1991
- Bisimulation and divergenceInformation and Computation, 1990
- A complete axiomatisation for observational congruence of finite-state behavioursInformation and Computation, 1989
- On the consistency of Koomen's Fair Abstraction RuleTheoretical Computer Science, 1987
- Algebraic specification and verification of communication protocolsScience of Computer Programming, 1985