On the completeness of the equations for the Kleene star in bisimulation
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 180-194
- https://doi.org/10.1007/bfb0014315
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A complete equational axiomatization for prefix iterationInformation Processing Letters, 1994
- Basic Process Algebra with Iteration: Completeness of its Equational AxiomsThe Computer Journal, 1994
- Process Algebra with Iteration and NestingThe Computer Journal, 1994
- Decidability of bisimulation equivalence for process generating context-free languagesJournal of the ACM, 1993
- A congruence theorem for structured operational semantics with predicatesPublished by Springer Nature ,1993
- Graphes canoniques de graphes algébriquesRAIRO - Theoretical Informatics and Applications, 1990
- A complete axiomatisation for observational congruence of finite-state behavioursInformation and Computation, 1989
- A complete inference system for a class of regular behavioursJournal of Computer and System Sciences, 1984
- Two Complete Axiom Systems for the Algebra of Regular EventsJournal of the ACM, 1966
- Representation of Events in Nerve Nets and Finite AutomataPublished by Walter de Gruyter GmbH ,1956