Structural operational semantics for weak bisimulations
From MaRDI portal
Publication:673123
DOI10.1016/0304-3975(94)00152-9zbMath0873.68130OpenAlexW2041561080MaRDI QIDQ673123
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6147
Related Items
Modelling and analysing neural networks using a hybrid process algebra, Rule formats for compositional non-interference properties, Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation, Weak Bisimilarity Coalgebraically, A format for semantic equivalence comparison, Branching bisimilarity is an equivalence indeed!, Fair testing, SOS formats and meta-theory: 20 years after, Weak Bisimulation as a Congruence in MSOS, Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity, Bisimulations of Probabilistic Boolean Networks, Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity, Reusing artifact-centric business process models: a behavioral consistent specialization approach, Up-to Techniques for Branching Bisimilarity, Rooted branching bisimulation as a congruence, A general account of coinduction up-to, Probabilistic divide \& congruence: branching bisimilarity, On cool congruence formats for weak bisimulations, Ensuring liveness properties of distributed systems: open problems, Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes, A precongruence format for should testing preorder, Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence, The expressiveness of CSP with priority, A conservative look at operational semantics with variable binding, Towards a unified view of bisimulation: A comparative study, Finite axiom systems for testing preorder and De Simone process languages, Language preorder as a precongruence, On constructibility and unconstructibility of LTS operators from other LTS operators, Tile formats for located and mobile systems., Bisimilarity of open terms., Ordered SOS process languages for branching and eager bisimulations, Notes on Generative Probabilistic Bisimulation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Observation equivalence as a testing equivalence
- Transition system specifications with negative premises
- Calculi for synchrony and asynchrony
- A calculus of communicating systems
- Structured operational semantics and bisimulation as a congruence
- A complete axiomatisation for observational congruence of finite-state behaviours
- Turning SOS rules into equations
- A structural approach to operational semantics
- Concurrent testing of processes
- A Theory of Communicating Sequential Processes
- Algebraic laws for nondeterminism and concurrency
- Process Algebra
- Bisimulation can't be traced
- Branching time and abstraction in bisimulation semantics
