Checking equivalences between concurrent systems of finite agents (Extended abstract)

DOI10.1007/3-540-55719-9_115zbMath1425.68302OpenAlexW1561620381MaRDI QIDQ5204358

Alexander Rabinovich

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_115

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

The complexity of PDL with interleaving ⋮ Deciding true concurrency equivalences on safe, finite nets ⋮ Complexity of equivalence problems for concurrent systems of finite agents ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Deciding true concurrency equivalences on finite safe nets (preliminary report)

Cites Work

• CCS expressions, finite state processes, and three problems of equivalence
• A Theory of Communicating Sequential Processes
• Three Partition Refinement Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Checking equivalences between concurrent systems of finite agents (Extended abstract)