Generating priority rewrite systems for OSOS process languages

DOI10.1016/J.IC.2008.10.002MaRDI QIDQ1012121zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Priority rewrite systems for OSOS process languages.
• scientific article; zbMATH DE number 4074466
• Operational semantics of rewriting with priorities
• Refining the process rewrite systems hierarchy via ground tree rewrite systems
• Refining the process rewrite systems hierarchy via ground tree rewrite systems
• Priority rewriting: Semantics, confluence, and conditionals
• An expressiveness study of priority in process calculi
• CONCUR 2004 - Concurrency Theory
• Term-rewriting systems with rule priorities
• Term rewriting systems with sort priorities

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 108434 (Why is no real title available?)
• scientific article; zbMATH DE number 1479627 (Why is no real title available?)
• scientific article; zbMATH DE number 4001464 (Why is no real title available?)
• scientific article; zbMATH DE number 869193 (Why is no real title available?)
• A Theory of Communicating Sequential Processes
• A complete inference system for a class of regular behaviours
• A formal definition of time in LOTOS
• A process algebra for timed systems
• A structural approach to operational semantics
• Axiomatizing GSOS with termination
• Bisimulation can't be traced
• Finite axiom systems for testing preorder and De Simone process languages
• Operational semantics of rewriting with priorities
• Ordered SOS process languages for branching and eager bisimulations
• Priority rewrite systems for OSOS process languages.
• Process Algebra
• Process algebra with timing: Real time and discrete time
• Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
• Rewriting techniques and applications. 9th international conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998. Proceedings
• Semantics and strong sequentiality of priority term rewriting systems
• Structural operational semantics.
• Structured operational semantics and bisimulation as a congruence
• Term-rewriting systems with rule priorities
• Termination of term rewriting using dependency pairs
• Testing equivalences for processes
• The algebra of timed processes, ATP: Theory and application
• Turning SOS rules into equations

Cited in

(1)

• Priority rewrite systems for OSOS process languages.

This page was built for publication: Generating priority rewrite systems for OSOS process languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1012121)