The algorithmics of bisimilarity

DOI10.1017/CBO9780511792588.004MaRDI QIDQ5411870zbMATH OpenOpenAlexFDO

Authors Luca Aceto, Anna Ingolfsdottir, 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)

Recommendations

• scientific article; zbMATH DE number 44290
• Decision procedures and graph reductions for bisimulation equivalences part 1
• Reactive Systems
• Process algebra and model checking
• Symbolic bisimulations

Cited in

(12)

• Interleaving isotactics -- an equivalence notion on behaviour abstractions
• BPA bisimilarity is EXPTIME-hard
• A description based on languages of the final non-deterministic automaton
• On Bisimilarity and Substitution in Presence of Replication
• An algebraic theory for web service contracts
• Resource Bisimilarity in Petri Nets is Decidable
• Consistently-detecting monitors
• scientific article; zbMATH DE number 5191936 (Why is no real title available?)
• Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
• Simulation relations and applications in formal methods
• On-the-fly bisimilarity checking for fresh-register automata
• Unified bisimulation applied to incremental abstraction of Petri nets

Describes a project that uses

Uses Software

• R
• SPSS

This page was built for publication: The algorithmics of bisimilarity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5411870)