Bisimulation and divergence
From MaRDI portal
Publication:750163
DOI10.1016/0890-5401(90)90048-MzbMATH Open0713.68036OpenAlexW1990440312MaRDI QIDQ750163FDOQ750163
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
Recommendations
Cites Work
Cited In (55)
- Modal and temporal logics for processes
- Essential transitions to bisimulation equivalences
- A semantic theory for value-passing processes based on the late approach
- Title not available (Why is that?)
- Communicating Sequential Processes. The First 25 Years
- A fully abstract denotational model for observational precongruence
- On the expressiveness of interaction
- A complete axiomatisation for observational congruence of finite-state behaviours
- The equational theory of prebisimilarity over basic CCS with divergence
- INQUISITIVE BISIMULATION
- Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations.
- A randomized encoding of the \(\pi\)-calculus with mixed choice
- Title not available (Why is that?)
- Finite axiom systems for testing preorder and De Simone process languages
- Title not available (Why is that?)
- A characterization of finitary bisimulation
- Title not available (Why is that?)
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- An intensional characterization of the largest bisimulation
- On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS
- A note on the characterization of weak bisimulation congruence in CCS
- Axiomatizing Weak Ready Simulation Semantics over BCCSP
- Divide and congruence III: Stability & divergence
- Bisimulation on speed: Worst-case efficiency
- Title not available (Why is that?)
- Testing equivalence as a bisimulation equivalence
- Deciding orthogonal bisimulation
- Power simulation and its relation to traces and failures refinement
- Decoding choice encodings
- Ordered SOS process languages for branching and eager bisimulations
- Confluence Thanks to Extensional Determinism
- Distributed bisimulations
- Generalized Bisimulation Metrics
- A general conservative extension theorem in process algebras with inequalities
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Counting nondeterministic computations
- When is partial trace equivalence adequate?
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- A compositional protocol verification using relativized bisimulation
- Reactive bisimulation semantics for a process algebra with timeouts
- CPO models for a class of GSOS languages
- Bisimulation Congruences in the Calculus of Looping Sequences
- Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
- Minimizing the number of transitions with respect to observation equivalence
- Ensuring liveness properties of distributed systems: open problems
- Bisimulation can't be traced
- Analyzing divergence in bisimulation semantics
- Non-deterministic structures of computation
- Axiomatizing weak simulation semantics over BCCSP
- Stepwise development of process-algebraic specifications in decorated trace semantics
- Bisimulation indexes and their applications
- Axiomatising divergence
- A fully abstract denotational model for observational precongruence
- Theory of interaction
- Next-preserving branching bisimulation
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)
