Minimizing the number of transitions with respect to observation equivalence

DOI10.1007/BF01933173zbMath0738.68061MaRDI QIDQ1182610

Jaana Eloranta

Publication date: 28 June 1992

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

uniqueness; minimization; labeled transition systems; observation equivalence

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Compositionality in state space verification methods, Conflict-preserving abstraction of discrete event systems using annotated automata, Minimizing the number of transitions with respect to observation equivalence, Essential transitions to bisimulation equivalences, The quest for minimal quotients for probabilistic and Markov automata, Compositional failure-based semantic models for basic LOTOS, The dynamics of defect ensembles in one-dimensional cellular automata, Limited approximate bisimulations and the corresponding rough approximations

Cites Work

• Bisimulation and divergence
• An implementation of an efficient algorithm for bisimulation equivalence
• Extensional equivalences for transition systems
• Minimizing the number of transitions with respect to observation equivalence
• A Theory of Communicating Sequential Processes
• Three Partition Refinement Algorithms
• Formal verification of parallel programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item