Bisimulation by unification

DOI10.1007/3-540-45719-4_18MaRDI QIDQ2996148zbMATH OpenOpenAlexFDO

Authors Paolo Baldan, Andrea Bracciali, Roberto Bruni

Publication date 6 May 2011

Published in Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45719-4_18

Mathematics Subject Classification ID

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

Recommendations

• A semantic framework for open processes
• Bisimilarity of open terms.
• Open bisimulation, revisited
• A theory of bisimulation for the -calculus
• Bisimulation for higher-order process calculi

Cited in

(20)

• A framework for specifying and verifying the behaviour of open systems
• Observational congruences for dynamically reconfigurable tile systems
• Bisimilarity of open terms.
• SMT-based generation of symbolic automata
• Deciding orthogonal bisimulation
• A semantic framework for open processes
• Compositional equivalences based on open pNets
• G-reactive systems as coalgebras
• A coalgebraic theory of reactive systems
• Open Bisimulation for Aspects
• Bisimulation can't be traced
• scientific article; zbMATH DE number 7015161 (Why is no real title available?)
• Conditional bisimilarity for reactive systems
• A characterisation of open bisimilarity using an intuitionistic modal logic
• On symbolic semantics for name-decorated contexts
• Global Computing
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• A bisimulation for dynamic sealing
• Conditional bisimilarity for reactive systems
• Reactive systems, (semi-)saturated semantics and coalgebras on presheaves

This page was built for publication: Bisimulation by unification

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