A General Theory of Barbs, Contexts, and Labels

DOI10.1145/2631916zbMath1354.68189MaRDI QIDQ2946747

Giacoma Valentina Monreale, Filippo Bonchi, Fabio Gadducci

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2631916

zbMATH Keywords

interactive systems; barbed bisimilarity; contexts-as-labels paradigm

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

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

Related Items

Equations, Contractions, and Unique Solutions, When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus, Categorical specification and implementation of replicated data types, Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity, Observational and behavioural equivalences for soft concurrent constraint programming, Asynchronous Traces and Open Petri Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
• Synthesising CCS bisimulation using graph rewriting
• On bisimulations for the asynchronous \(\pi\)-calculus
• Mobile ambients
• CCS with priority guards
• Pure bigraphs: structure and dynamics
• Barbed Semantics for Open Reactive Systems
• Deriving Bisimulation Congruences for Conditional Reactive Systems
• Deriving Labels and Bisimilarity for Concurrent Constraint Programming
• Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
• Behavioral theory for mobile ambients
• Deriving Structural Labelled Transitions for Mobile Ambients
• Reactive Systems, Barbed Semantics, and the Mobile Ambients
• Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
• Symbolic Semantics Revisited
• Algebra and Coalgebra in Computer Science
• CONCUR 2005 – Concurrency Theory
• From rewrite rules to bisimulation congruences