Generating priority rewrite systems for OSOS process languages
DOI10.1016/J.IC.2008.10.002zbMATH Open1165.68037OpenAlexW1972104025MaRDI QIDQ1012121FDOQ1012121
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
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
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)
Cites Work
- Structured operational semantics and bisimulation as a congruence
- A structural approach to operational semantics
- Structural operational semantics.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation can't be traced
- Termination of term rewriting using dependency pairs
- Testing equivalences for processes
- The algebra of timed processes, ATP: Theory and application
- A process algebra for timed systems
- A Theory of Communicating Sequential Processes
- Process Algebra
- A complete inference system for a class of regular behaviours
- Title not available (Why is that?)
- Title not available (Why is that?)
- Turning SOS rules into equations
- Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
- Ordered SOS process languages for branching and eager bisimulations
- Axiomatizing GSOS with termination
- Process algebra with timing: Real time and discrete time
- Title not available (Why is that?)
- Term-rewriting systems with rule priorities
- Finite axiom systems for testing preorder and De Simone process languages
- Priority rewrite systems for OSOS process languages.
- 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
- Operational semantics of rewriting with priorities
- A formal definition of time in LOTOS
- Title not available (Why is that?)
Cited In (1)
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)
