Generating priority rewrite systems for OSOS process languages
type: Item
instance of: scholarly article
title: Generating priority rewrite systems for OSOS process languages
zbMATH Open document ID: 1165.68037
author: Irek Ulidowski
author: Shoji Yuen
published in: Information and Computation
publication date: 2009-04-14T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5543802
MaRDI profile type: Publication
full work available at URL: j.ic.2008.10.002
OpenAlex ID: W1972104025
cites work: Turning SOS rules into equations
cites work: Structural operational semantics.
cites work: Termination of term rewriting using dependency pairs
cites work: Q4727412
cites work: Term-rewriting systems with rule priorities
cites work: Axiomatizing GSOS with termination
cites work: Process algebra with timing: Real time and discrete time
cites work: Process Algebra
cites work: Bisimulation can't be traced
cites work: Q4490741
cites work: A Theory of Communicating Sequential Processes
cites work: Q4874391
cites work: Structured operational semantics and bisimulation as a congruence
cites work: A process algebra for timed systems
cites work: Q3777424
cites work: Q4023900
cites work: A formal definition of time in LOTOS
cites work: Rewriting techniques and applications. 9th international conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998. Proceedings
cites work: A complete inference system for a class of regular behaviours
cites work: Q3992568
cites work: Testing equivalences for processes
cites work: The algebra of timed processes, ATP: Theory and application
cites work: Q3907077
cites work: A structural approach to operational semantics
cites work: Operational semantics of rewriting with priorities
cites work: Semantics and strong sequentiality of priority term rewriting systems
cites work: Finite axiom systems for testing preorder and De Simone process languages
cites work: CONCUR 2003 - Concurrency Theory
cites work: Ordered SOS process languages for branching and eager bisimulations
cites work: Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
DOI: 10.1016/J.IC.2008.10.002
Recommended article: CONCUR 2003 - Concurrency Theory
Recommended article: Q3805891
Recommended article: Operational semantics of rewriting with priorities
Recommended article: Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems
Recommended article: Priority rewriting: Semantics, confluence, and conditionals
Recommended article: An expressiveness study of priority in process calculi
Recommended article: CONCUR 2004 - Concurrency Theory
Recommended article: Term-rewriting systems with rule priorities
Recommended article: Term rewriting systems with sort priorities
description: scientific article; zbMATH DE number 5543802