Turning GSOS rules into equations for linear time-branching time semantics

M.W. Gazda; W.J. Fokkink

doi:10.1093/comjnl/bxs120

Turning GSOS rules into equations for linear time-branching time semantics

M.W. Gazda
, W.J. Fokkink

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

1 Citaat (Scopus)

1 Downloads (Pure)

Samenvatting

An existing axiomatization strategy for process algebras modulo bisimulation semantics can be extended so that it can be applied to other behavioural semantics as well. We study term rewriting properties of the resulting axiomatizations.

Originele taal-2	Engels
Pagina's (van-tot)	34-44
Tijdschrift	The Computer Journal
Volume	56
Nummer van het tijdschrift	1
DOI's	https://doi.org/10.1093/comjnl/bxs120
Status	Gepubliceerd - 2013

Toegang tot document

10.1093/comjnl/bxs120

Citeer dit

@article{d5dd2bdfbdc44d84b6bab5d636bc4916,

title = "Turning GSOS rules into equations for linear time-branching time semantics",

abstract = "An existing axiomatization strategy for process algebras modulo bisimulation semantics can be extended so that it can be applied to other behavioural semantics as well. We study term rewriting properties of the resulting axiomatizations.",

author = "M.W. Gazda and W.J. Fokkink",

year = "2013",

doi = "10.1093/comjnl/bxs120",

language = "English",

volume = "56",

pages = "34--44",

journal = "The Computer Journal",

issn = "0010-4620",

publisher = "Oxford University Press",

number = "1",

}

TY - JOUR

T1 - Turning GSOS rules into equations for linear time-branching time semantics

AU - Gazda, M.W.

AU - Fokkink, W.J.

PY - 2013

Y1 - 2013

N2 - An existing axiomatization strategy for process algebras modulo bisimulation semantics can be extended so that it can be applied to other behavioural semantics as well. We study term rewriting properties of the resulting axiomatizations.

AB - An existing axiomatization strategy for process algebras modulo bisimulation semantics can be extended so that it can be applied to other behavioural semantics as well. We study term rewriting properties of the resulting axiomatizations.

U2 - 10.1093/comjnl/bxs120

DO - 10.1093/comjnl/bxs120

M3 - Article

SN - 0010-4620

VL - 56

SP - 34

EP - 44

JO - The Computer Journal

JF - The Computer Journal

IS - 1

ER -

Turning GSOS rules into equations for linear time-branching time semantics

Samenvatting

Toegang tot document

Vingerafdruk

Citeer dit