Ordered SOS process languages for branching and eager bisimulations

DOI10.1016/S0890-5401(02)93161-5MaRDI QIDQ1854563zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• scientific article; zbMATH DE number 1759617
• Semantics and expressiveness of ordered SOS
• The Meaning of Ordered SOS
• Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
• Turning SOS rules into equations

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3744561 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 1113857 (Why is no real title available?)
• scientific article; zbMATH DE number 1759617 (Why is no real title available?)
• scientific article; zbMATH DE number 4001464 (Why is no real title available?)
• scientific article; zbMATH DE number 4119610 (Why is no real title available?)
• scientific article; zbMATH DE number 794263 (Why is no real title available?)
• scientific article; zbMATH DE number 869193 (Why is no real title available?)
• A calculus of communicating systems
• A process algebra for timed systems
• Axiomatizing prefix iteration with silent steps
• Bisimulation and divergence
• Bisimulation can't be traced
• Branching time and abstraction in bisimulation semantics
• CPO models for compact GSOS languages
• Embedding as a tool for language comparison
• Finite axiom systems for testing preorder and De Simone process languages
• Higher-level synchronising devices in Meije-SCCS
• LCF considered as a programming language
• Observation equivalence as a testing equivalence
• Process Algebra
• Process algebra for synchronous communication
• Refusal testing
• Rooted branching bisimulation as a congruence
• Structural operational semantics for weak bisimulations
• Structured operational semantics and bisimulation as a congruence
• Term-rewriting systems with rule priorities
• The algebra of timed processes, ATP: Theory and application
• Transition system specifications with negative premises
• Turning SOS rules into equations

Cited in

(17)

• scientific article; zbMATH DE number 1759617 (Why is no real title available?)
• A precongruence format for should testing preorder
• On cool congruence formats for weak bisimulations
• SOS formats and meta-theory: 20 years after
• 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)