Back and forth bisimulations
- 1 January 1990
- book chapter
- Published by Springer Nature
- p. 152-165
- https://doi.org/10.1007/bfb0039058
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- An algebraic characterization of transition system equivalencesInformation and Computation, 1989
- Characterizing finite Kripke structures in propositional temporal logicTheoretical Computer Science, 1988
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Bisimulations and abstraction homomorphismsJournal of Computer and System Sciences, 1987
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- The power of the future perfect in program logicsInformation and Control, 1985
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- A Calculus of Communicating SystemsLecture Notes in Computer Science, 1980