Generating priority rewrite systems for OSOS process languages

DOI10.1016/j.ic.2008.10.002zbMath1165.68037OpenAlexW1972104025MaRDI QIDQ1012121

Irek Ulidowski, Shoji Yuen

Publication date: 14 April 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.10.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) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete inference system for a class of regular behaviours
• Structured operational semantics and bisimulation as a congruence
• Term-rewriting systems with rule priorities
• Semantics and strong sequentiality of priority term rewriting systems
• Operational semantics of rewriting with priorities
• 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
• Rewriting techniques and applications. 9th international conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998. Proceedings
• Finite axiom systems for testing preorder and De Simone process languages
• Ordered SOS process languages for branching and eager bisimulations
• Axiomatizing GSOS with termination
• Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
• A structural approach to operational semantics
• A process algebra for timed systems
• Termination of term rewriting using dependency pairs
• A Theory of Communicating Sequential Processes
• Process Algebra
• Bisimulation can't be traced
• CONCUR 2003 - Concurrency Theory