Branching time and abstraction in bisimulation semantics
- 1 May 1996
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 43 (3), 555-600
- https://doi.org/10.1145/233551.233556
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Branching bisimilarity is an equivalence indeed!Information Processing Letters, 1996
- Structural operational semantics for weak bisimulationsTheoretical Computer Science, 1995
- Translations between modal logics of reactive systemsTheoretical Computer Science, 1995
- τ-Bisimulations and full abstraction for refinement of actionsInformation Processing Letters, 1991
- Characterizing finite Kripke structures in propositional temporal logicTheoretical Computer Science, 1988
- On interprocess communicationDistributed Computing, 1986
- Modeling concurrency with partial ordersInternational Journal of Parallel Programming, 1986
- Linear time and branching time semantics for recursion with mergeTheoretical Computer Science, 1984
- Testing equivalences for processesTheoretical Computer Science, 1984
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983