Ordered SOS process languages for branching and eager bisimulations

DOI10.1016/S0890-5401(02)93161-5zbMath1012.68116OpenAlexW2090881074MaRDI QIDQ1854563

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

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Rule formats for compositional non-interference properties, Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation, A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway, SOS formats and meta-theory: 20 years after, Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity, On cool congruence formats for weak bisimulations, Ensuring liveness properties of distributed systems: open problems, A precongruence format for should testing preorder, Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence, Semantics and expressiveness of ordered SOS, Generating priority rewrite systems for OSOS process languages, Finite axiom systems for testing preorder and De Simone process languages, Divide and congruence III: Stability & divergence, Modular Structural Operational Semantics with Strategies, A Congruence Rule Format with Universal Quantification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refusal testing
• Observation equivalence as a testing equivalence
• Structural operational semantics for weak bisimulations
• Transition system specifications with negative premises
• Bisimulation and divergence
• Higher-level synchronising devices in Meije-SCCS
• A calculus of communicating systems
• Structured operational semantics and bisimulation as a congruence
• LCF considered as a programming language
• Term-rewriting systems with rule priorities
• Embedding as a tool for language comparison
• Turning SOS rules into equations
• The algebra of timed processes, ATP: Theory and application
• Finite axiom systems for testing preorder and De Simone process languages
• A process algebra for timed systems
• Axiomatizing prefix iteration with silent steps
• Rooted branching bisimulation as a congruence
• CPO models for compact GSOS languages
• Process algebra for synchronous communication
• Process Algebra
• Bisimulation can't be traced
• Branching time and abstraction in bisimulation semantics