The algorithmics of bisimilarity

DOI10.1017/CBO9780511792588.004zbMath1285.68101OpenAlexW1556261722MaRDI QIDQ5411870

Anna Ingólfsdóttir, Luca Aceto, Jiří Srba

Publication date: 25 April 2014

Published in: Advanced Topics in Bisimulation and Coinduction (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/cbo9780511792588.004

Mathematics Subject Classification ID

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

Related Items (7)

Resource Bisimilarity in Petri Nets is Decidable ⋮ Simulation relations and applications in formal methods ⋮ On-the-fly bisimilarity checking for fresh-register automata ⋮ A description based on languages of the final non-deterministic automaton ⋮ An algebraic theory for web service contracts ⋮ Consistently-detecting monitors ⋮ Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application

Uses Software

• R
• SPSS

This page was built for publication: The algorithmics of bisimilarity