A complexity analysis of bisimilarity for value-passing processes

DOI10.1016/S0304-3975(98)00177-7zbMath0944.68135MaRDI QIDQ1575255

Luca Trevisan, Michele Boreale

Publication date: 21 August 2000

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

zbMATH Keywords

computational complexitybisimulationprocess algebrasvalue-passing

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• CCS expressions, finite state processes, and three problems of equivalence
• A calculus of communicating systems
• A calculus of mobile processes. II
• Deciding bisimulation equivalences for a class of non-finite-state programs
• Proof systems for message-passing process algebras
• Algebraic theories for name-passing calculi
• A theory of bisimulation for the \(\pi\)-calculus
• Three Partition Refinement Algorithms
• Alternation
• On the Computational Complexity of Algorithms
• The complexity of theorem-proving procedures

This page was built for publication: A complexity analysis of bisimilarity for value-passing processes