Axiomatizing GSOS with termination

DOI10.1016/j.jlap.2004.03.001zbMath1072.68058OpenAlexW2027519864MaRDI QIDQ1878716

E. P. de Vink, Jos C. M. Baeten

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.001

zbMATH Keywords

structural operational semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (9)

Proving the validity of equations in GSOS languages using rule-matching bisimilarity ⋮ The Equational Theory of Weak Complete Simulation Semantics over BCCSP ⋮ SOS formats and meta-theory: 20 years after ⋮ SOS rule formats for idempotent terms and idempotent unary operators ⋮ Axiomatizing weak simulation semantics over BCCSP ⋮ Notions of bisimulation and congruence formats for SOS with data ⋮ SOS rule formats for zero and unit elements ⋮ Generating priority rewrite systems for OSOS process languages ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global renaming operators in concrete process algebra
• A calculus of communicating systems
• Turning SOS rules into equations
• The algebra of communicating processes with empty process
• Finite axiom systems for testing preorder and De Simone process languages
• Universal coalgebra: A theory of systems
• CPO models for compact GSOS languages
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• Process Algebra
• Termination, deadlock, and divergence
• Bisimulation can't be traced
• Formal specification and analysis of production systems
• Embedding untimed into timed process algebra: the case for explicit termination

This page was built for publication: Axiomatizing GSOS with termination