Barbed bisimulation

DOI10.1007/3-540-55719-9_114zbMath1425.68298OpenAlexW2914597273MaRDI QIDQ5204357

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_114

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus, Constraints as processes, A model of actors and grey failures, A PO characterisation of reconfiguration, Comparing the expressiveness of the \(\pi \)-calculus and CCS, Process calculus based upon evaluation to committed form, From rewrite rules to bisimulation congruences, On the semantics of durational actions, Bisimulations in the join-calculus, Event structures for the reversible early internal \(\pi\)-calculus, Characteristic bisimulation for higher-order session processes, Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity, Topological models for higher order control flow, An investigation into functions as processes, A theory of bisimulation for a fragment of concurrent ML with local names, From π-calculus to higher-order π-calculus — and back, Reactive systems, (semi-)saturated semantics and coalgebras on presheaves, From a concurrent λ-calculus to the π-calculus, On reduction-based process semantics, A synchronous \(\pi\)-calculus, Basic observables for a calculus for global computing, Linear forwarders, Types and full abstraction for polyadic \(\pi\)-calculus, Name-passing calculi: from fusions to preorders and types, A coalgebraic approach to the semantics of the ambient calculus, Contextual equivalences in configuration structures and reversibility, The SL synchronous language, revisited, Fair testing, Observational and behavioural equivalences for soft concurrent constraint programming, Space-aware ambients and processes, A process algebraic view of Linda coordination primitives, Unnamed Item, Fairness and communication-based semantics for session-typed languages, Virtually timed ambients: a calculus of nested virtualization, Bisimulation congruence of \(\chi\)-calculus, Theory of interaction, Precise subtyping for synchronous multiparty sessions, On the expressiveness and decidability of higher-order process calculi, Processes in space, Contextual equivalence for signal flow graphs, A semantic theory of the Internet of things, Unnamed Item, Unnamed Item, Replacement freeness: a criterion for separating process calculi, Unnamed Item, Unnamed Item, Unnamed Item, Observing Success in the Pi-Calculus, Variations on mobile processes, Distributability of mobile ambients, A timed calculus for wireless systems, Observed Communication Semantics for Classical Processes, A calculus of trustworthy ad hoc networks, Towards a Unified Approach to Encodability and Separation Results for Process Calculi, A ground-complete axiomatization of stateless bisimilarity over Linda, Extensional Petri net, Formalising Java RMI with explicit code mobility, Tutorial on separation results in process calculi via leader election problems, A bisimulation for dynamic sealing, A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols, Behavioural equivalences for dynamic web data, Full abstraction for polymorphic \(\pi \)-calculus, CSP is a retract of CCS, On the expressiveness of interaction, Making the Unobservable, Unobservable, On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS, A Resource Analysis of the π-calculus, A calculus for reasoning about software composition, Name-passing in an ambient-like calculus and its proof using spatial logic, A fully abstract may testing semantics for concurrent objects, A hierarchy of equivalences for asynchronous calculi, On the relative expressiveness of higher-order session processes, A calculus for collective-adaptive systems and its behavioural theory, Unnamed Item, Comparing communication primitives via their relative expressive power, Probabilistic mobile ambients, Unnamed Item, A process algebraic approach to reaction systems, Mobility control via passports, An observational theory for mobile ad hoc networks (full version), Mixed sessions, Counting nondeterministic computations, A thesis for interaction, An interpretation of typed objects into typed \(\pi\)-calculus, On performance congruences for process algebras, Process calculus based upon evaluation to committed form, On bisimulations for the asynchronous \(\pi\)-calculus, Bisimulations for a calculus of broadcasting systems, Categorical specification and implementation of replicated data types, A calculus for cryptographic protocols: The spi calculus, Basic observables for processes, Comparing three semantics for Linda-like languages, Deriving Bisimulation Congruences: A 2-categorical Approach, Bisimulation Relations for Dynamical and Control Systems, Processes against tests: on defining contextual equivalences, The seal calculus, Bisimulation relations for dynamical, control, and hybrid systems, Unnamed Item, On an open problem of Amadio and Curien: The finite antichain condition, Asynchronous process calculi: The first- and higher-order paradigms, On the expressiveness of Linda coordination primitives., What is a ``good encoding of guarded choice?, Bisimilarity of open terms., Decoding choice encodings, Vertical implementation, Synchrony vs Asynchrony in Communication Primitives, Extensionality of Spatial Observations in Distributed Systems, An Observational Theory for Mobile Ad Hoc Networks, Bisimulation and Co-induction: Some Problems, Probabilistic Barbed Congruence

Cites Work