Barbed bisimulation
From MaRDI portal
Recommendations
Cites work
- A calculus of mobile processes. II
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177812 (Why is no real title available?)
- Modal logics for mobile processes
- Structured operational semantics and bisimulation as a congruence
- The chemical abstract machine
- Transition system specifications with negative premises
Cited in
(only showing first 100 items - show all)- Comparing communication primitives via their relative expressive power
- Probabilistic mobile ambients
- Mobility control via passports
- An observational theory for mobile ad hoc networks (full version)
- A process algebraic view of Linda coordination primitives
- An interpretation of typed objects into typed -calculus
- On performance congruences for process algebras
- Process calculus based upon evaluation to committed form
- On bisimulations for the asynchronous -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 -calculus
- Comparing three semantics for Linda-like languages
- Asynchronous process calculi: The first- and higher-order paradigms
- Virtually timed ambients: a calculus of nested virtualization
- A semantic theory of the Internet of Things
- 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 process algebraic approach to reaction systems
- Mixed sessions
- Counting nondeterministic computations
- A thesis for interaction
- Categorical specification and implementation of replicated data types
- Processes against tests: on defining contextual equivalences
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
- Contextual equivalence for signal flow graphs
- Replacement freeness: a criterion for separating process calculi
- Distributability of mobile ambients
- On the relative expressiveness of higher-order session processes
- A calculus for collective-adaptive systems and its behavioural theory
- Characteristic bisimulation for higher-order session processes
- A synchronous -calculus
- Basic observables for a calculus for global computing
- Linear forwarders
- Types and full abstraction for polyadic -calculus
- Observational and behavioural equivalences for soft concurrent constraint programming
- Precise subtyping for synchronous multiparty sessions
- 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
- Fairness and communication-based semantics for session-typed languages
- Deriving bisimulation congruences: a 2-categorical approach
- Bisimulation relations for dynamical and control systems
- Synchrony vs asynchrony in communication primitives
- Extensionality of spatial observations in distributed systems
- Probabilistic barbed congruence
- Observed Communication Semantics for Classical Processes
- Introduction to bisimulation and coinduction
- On the distributability of mobile ambients
- Unique solutions of contractions, CCS, and their HOL formalisation
- Comparing process calculi using encodings
- Name-passing calculi: from fusions to preorders and types
- Contextual equivalences in configuration structures and reversibility
- Towards a Unified Approach to Encodability and Separation Results for Process Calculi
- Processes in space
- A calculus of trustworthy ad hoc networks
- A ground-complete axiomatization of stateless bisimilarity over Linda
- Encoding CSP into CCS
- Self-similarity breeds resilience
- From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
- From a concurrent λ-calculus to the π-calculus
- scientific article; zbMATH DE number 7559481 (Why is no real title available?)
- scientific article; zbMATH DE number 7204939 (Why is no real title available?)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
- A characterisation of open bisimilarity using an intuitionistic modal logic
- Making the unobservable, unobservable
- On convergence-sensitive bisimulation and the embedding of CCS in timed CCS
- Reversible barbed congruence on configuration structures
- Observing success in the pi-calculus
- An Observational Theory for Mobile Ad Hoc Networks
- Bisimulation and co-induction: some problems
- A fully abstract may testing semantics for concurrent objects
- A resource analysis of the \(\pi\)-calculus
- Axiomatizing maximal progress and discrete time
- Topological models for higher order control flow
- An investigation into functions as processes
- A bisimulation for dynamic sealing
- Event structures for the reversible early internal \(\pi\)-calculus
- From rewrite rules to bisimulation congruences
- On the semantics of durational actions
- Bisimulations in the join-calculus
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
- Process calculus based upon evaluation to committed form
- Constraints as processes
- A model of actors and grey failures
- A PO characterisation of reconfiguration
This page was built for publication: Barbed bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204357)
