Symbolic bisimulations

DOI10.1016/0304-3975(94)00172-FzbMath0874.68187MaRDI QIDQ674194

Juan-Miguel Gracia

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

bisimulation equivalence; value-passing process languages

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q55: Semantics in the theory of computing

Related Items

A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems, On performance congruences for process algebras, Bisimulations for a calculus of broadcasting systems, A \(\pi\)-calculus with explicit substitutions, On the decidability of process equivalences for the \(\pi\)-calculus, A complexity analysis of bisimilarity for value-passing processes, Proof systems for message-passing process algebras, Variations on mobile processes, Symbolic transition graph and its early bisimulation checking algorithms for the \(\pi\)-calculus, Computing bisimulations for finite-control \(\pi\)-calculus, Inference systems for observation equivalences in the \(\pi\)-calculus, Unnamed Item

Cites Work

• Unnamed Item
• Modal logics for mobile processes
• Automated analysis of mutual exclusion algorithms using CCS
• Local model checking for infinite state spaces
• Deciding bisimulation equivalences for a class of non-finite-state programs
• A theory of timed automata