Operational semantics of rewriting with priorities

J.C. Pol, van de

doi:10.1016/S0304-3975(97)00283-1

Operational semantics of rewriting with priorities

J.C. Pol, van de

Algorithms

Research output: Contribution to journal › Article › Academic › peer-review

11 Citations (Scopus)

Abstract

We study the semantics of term rewriting systems with rule priorities (PRS), as introduced in Baeten et al. (1989). Three open problems posed in that paper are solved, by giving counter examples. Moreover, a class of executable PRSs is identified. A translation of PRSs into transition system specifications (TSS) is given. This translation introduces negative premises. We prove that the translation preserves the operational semantics.

Original language	English
Pages (from-to)	289-312
Journal	Theoretical Computer Science
Volume	200
Issue number	1-2
DOIs	https://doi.org/10.1016/S0304-3975(97)00283-1
Publication status	Published - 1998

Access to Document

10.1016/S0304-3975(97)00283-1

Cite this

@article{91d2d2c5ceb74ce3981a99ee7df903b5,

title = "Operational semantics of rewriting with priorities",

abstract = "We study the semantics of term rewriting systems with rule priorities (PRS), as introduced in Baeten et al. (1989). Three open problems posed in that paper are solved, by giving counter examples. Moreover, a class of executable PRSs is identified. A translation of PRSs into transition system specifications (TSS) is given. This translation introduces negative premises. We prove that the translation preserves the operational semantics.",

author = "{Pol, van de}, J.C.",

year = "1998",

doi = "10.1016/S0304-3975(97)00283-1",

language = "English",

volume = "200",

pages = "289--312",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1-2",

}

TY - JOUR

T1 - Operational semantics of rewriting with priorities

AU - Pol, van de, J.C.

PY - 1998

Y1 - 1998

N2 - We study the semantics of term rewriting systems with rule priorities (PRS), as introduced in Baeten et al. (1989). Three open problems posed in that paper are solved, by giving counter examples. Moreover, a class of executable PRSs is identified. A translation of PRSs into transition system specifications (TSS) is given. This translation introduces negative premises. We prove that the translation preserves the operational semantics.

AB - We study the semantics of term rewriting systems with rule priorities (PRS), as introduced in Baeten et al. (1989). Three open problems posed in that paper are solved, by giving counter examples. Moreover, a class of executable PRSs is identified. A translation of PRSs into transition system specifications (TSS) is given. This translation introduces negative premises. We prove that the translation preserves the operational semantics.

U2 - 10.1016/S0304-3975(97)00283-1

DO - 10.1016/S0304-3975(97)00283-1

M3 - Article

SN - 0304-3975

VL - 200

SP - 289

EP - 312

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-2

ER -

Operational semantics of rewriting with priorities

Abstract

Access to Document

Fingerprint

Cite this