Barbed bisimulation

DOI10.1007/3-540-55719-9_114zbMath1425.68298MaRDI 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

68Q55: Semantics in the theory of computing

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

Related Items

A bisimulation for dynamic sealing, From rewrite rules to bisimulation congruences, On the semantics of durational actions, Bisimulations in the join-calculus, A fully abstract may testing semantics for concurrent objects, A coalgebraic approach to the semantics of the ambient calculus, The SL synchronous language, revisited, Fair testing, Space-aware ambients and processes, Comparing communication primitives via their relative expressive power, Probabilistic mobile ambients, A process algebraic view of Linda coordination primitives, 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, A calculus for cryptographic protocols: The spi calculus, Basic observables for processes, On reduction-based process semantics, Bisimulation congruence of \(\chi\)-calculus, Comparing three semantics for Linda-like languages, Asynchronous process calculi: The first- and higher-order paradigms, A calculus for reasoning about software composition, A hierarchy of equivalences for asynchronous calculi, On the expressiveness of Linda coordination primitives., What is a ``good encoding of guarded choice?, Bisimilarity of open terms., Decoding choice encodings, Vertical implementation, A theory of bisimulation for a fragment of concurrent ML with local names, Variations on mobile processes, A synchronous \(\pi\)-calculus, Basic observables for a calculus for global computing, Linear forwarders, Types and full abstraction for polyadic \(\pi\)-calculus, Formalising Java RMI with explicit code mobility, Tutorial on separation results in process calculi via leader election problems, Behavioural equivalences for dynamic web data, Full abstraction for polymorphic \(\pi \)-calculus, Name-passing in an ambient-like calculus and its proof using spatial logic, The seal calculus, Bisimulation relations for dynamical, control, and hybrid systems, On an open problem of Amadio and Curien: The finite antichain condition, Towards a Unified Approach to Encodability and Separation Results for Process Calculi