Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation

DOI10.1016/j.jlap.2004.03.002zbMath1072.68074OpenAlexW2046810743MaRDI QIDQ1878718

Irek Ulidowski, Shoji Yuen

Publication date: 8 September 2004

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2004.03.002

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

SOS formats and meta-theory: 20 years after ⋮ Rule formats for determinism and idempotence ⋮ A precongruence format for should testing preorder ⋮ Generating priority rewrite systems for OSOS process languages ⋮ Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting

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 timed model for communicating sequential processes
• Structured operational semantics and bisimulation as a congruence
• A formal definition of time in LOTOS
• Turning SOS rules into equations
• The algebra of timed processes, ATP: Theory and application
• Testing equivalences for processes
• Finite axiom systems for testing preorder and De Simone process languages
• Process algebra with timing
• Ordered SOS process languages for branching and eager bisimulations
• An operational semantics for timed CSP
• A process algebra for timed systems
• Discrete time process algebra
• Axiomatizing prefix iteration with silent steps
• Rooted branching bisimulation as a congruence
• Real time process algebra
• Process Algebra
• Bisimulation can't be traced
• Branching time and abstraction in bisimulation semantics
• The meaning of negative premises in transition system specifications
• Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination
• CONCUR 2003 - Concurrency Theory