A General Theory of Barbs, Contexts, and Labels

DOI10.1145/2631916zbMath1354.68189OpenAlexW2118901376MaRDI 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 systemsbarbed bisimilaritycontexts-as-labels paradigm

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

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

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

This page was built for publication: A General Theory of Barbs, Contexts, and Labels