Bisimulation by unification

DOI10.1007/3-540-45719-4_18zbMATH Open1275.68100OpenAlexW2139232532MaRDI QIDQ2996148FDOQ2996148

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

Recommendations

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

Mathematics Subject Classification ID

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

Cited In (19)

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

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)