Ordered SOS process languages for branching and eager bisimulations
DOI10.1016/S0890-5401(02)93161-5zbMATH Open1012.68116OpenAlexW2090881074MaRDI QIDQ1854563FDOQ1854563
Authors: Irek Ulidowski, Iain Phillips 
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0890-5401(02)93161-5
Recommendations
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Higher-level synchronising devices in Meije-SCCS
- Structured operational semantics and bisimulation as a congruence
- LCF considered as a programming language
- Process algebra for synchronous communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation can't be traced
- Structural operational semantics for weak bisimulations
- A calculus of communicating systems
- The algebra of timed processes, ATP: Theory and application
- A process algebra for timed systems
- Title not available (Why is that?)
- Branching time and abstraction in bisimulation semantics
- Observation equivalence as a testing equivalence
- Bisimulation and divergence
- Process Algebra
- Title not available (Why is that?)
- Embedding as a tool for language comparison
- Rooted branching bisimulation as a congruence
- Title not available (Why is that?)
- Transition system specifications with negative premises
- Turning SOS rules into equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Refusal testing
- Title not available (Why is that?)
- Term-rewriting systems with rule priorities
- Finite axiom systems for testing preorder and De Simone process languages
- Axiomatizing prefix iteration with silent steps
- CPO models for compact GSOS languages
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (17)
- Title not available (Why is that?)
- A precongruence format for should testing preorder
- SOS formats and meta-theory: 20 years after
- On cool congruence formats for weak bisimulations
- Finite axiom systems for testing preorder and De Simone process languages
- CONCUR 2005 – Concurrency Theory
- Semantics and expressiveness of ordered SOS
- Generating priority rewrite systems for OSOS process languages
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Rule formats for compositional non-interference properties
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
- A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
- Divide and congruence. III: Stability \& divergence
- A congruence rule format with universal quantification
- Ensuring liveness properties of distributed systems: open problems
- Modular structural operational semantics with strategies
This page was built for publication: Ordered SOS process languages for branching and eager bisimulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854563)
