Bisimulation and divergence

DOI10.1016/0890-5401(90)90048-MMaRDI QIDQ750163zbMATHOpenAlexFDO

Authors Daniel J. Walker

Publication date 1990

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0890-5401(90)90048-m

zbMATH Keywords

divergenceCCStransition systembisimulation equivalence

Mathematics Subject Classification ID

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

Recommendations

• The equational theory of prebisimilarity over basic CCS with divergence
• Communicating Sequential Processes. The First 25 Years
• scientific article; zbMATH DE number 3898224
• Distributed bisimulations
• Bisimulation through probabilistic testing

Cites work

• scientific article; zbMATH DE number 4060694 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3744561 (Why is no real title available?)
• scientific article; zbMATH DE number 3754002 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• A calculus of communicating systems
• Modal logics for communicating systems
• Observation equivalence as a testing equivalence

Cited in

(57)

• Distributed bisimulations
• Analyzing divergence in bisimulation semantics
• scientific article; zbMATH DE number 7015161 (Why is no real title available?)
• A semantic theory for value-passing processes based on the late approach
• A fully abstract denotational model for observational precongruence
• Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations.
• Minimizing the number of transitions with respect to observation equivalence
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Theory of interaction
• An intensional characterization of the largest bisimulation
• On the expressiveness of interaction
• When is partial trace equivalence adequate?
• On convergence-sensitive bisimulation and the embedding of CCS in timed CCS
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• A characterization of finitary bisimulation
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Axiomatizing weak ready simulation semantics over BCCSP
• Power simulation and its relation to traces and failures refinement
• Reactive bisimulation semantics for a process algebra with timeouts
• Non-deterministic structures of computation
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
• Generalized Bisimulation Metrics
• A compositional protocol verification using relativized bisimulation
• Counting nondeterministic computations
• Logics for bisimulation and divergence
• CPO models for a class of GSOS languages
• Divide and congruence. III: Stability \& divergence
• Stepwise development of process-algebraic specifications in decorated trace semantics
• The equational theory of prebisimilarity over basic CCS with divergence
• A note on the characterization of weak bisimulation congruence in CCS
• Bisimulation indexes and their applications
• Ensuring liveness properties of distributed systems: open problems
• Next-preserving branching bisimulation
• A general conservative extension theorem in process algebras with inequalities
• scientific article; zbMATH DE number 1759617 (Why is no real title available?)
• scientific article; zbMATH DE number 7559462 (Why is no real title available?)
• A complete axiomatisation for observational congruence of finite-state behaviours
• scientific article; zbMATH DE number 2086654 (Why is no real title available?)
• Testing equivalence as a bisimulation equivalence
• Axiomatising divergence
• Decoding choice encodings
• Ordered SOS process languages for branching and eager bisimulations
• Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
• Deciding orthogonal bisimulation
• Finite axiom systems for testing preorder and De Simone process languages
• Axiomatizing weak simulation semantics over BCCSP
• Bisimulation Congruences in the Calculus of Looping Sequences
• INQUISITIVE BISIMULATION
• The largest respectful function
• Bisimulation can't be traced
• scientific article; zbMATH DE number 1500662 (Why is no real title available?)
• Essential transitions to bisimulation equivalences
• Communicating Sequential Processes. The First 25 Years
• Bisimulation on speed: Worst-case efficiency
• Confluence thanks to extensional determinism
• A fully abstract denotational model for observational precongruence
• Modal and temporal logics for processes

This page was built for publication: Bisimulation and divergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750163)