Turning GSOS into equations for linear time-branching time semantics

M. Gazda; W.J. Fokkink

doi:10.1093/comjnl/bxs120

Turning GSOS into equations for linear time-branching time semantics

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

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. © 2012 The Author. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.

Original language	English
Pages (from-to)	34-44
Journal	Computer Journal
Volume	56
Issue number	1
DOIs	https://doi.org/10.1093/comjnl/bxs120
Publication status	Published - 2013

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1093/comjnl/bxs120

Handle.net

Persistent link

Cite this

@article{5dae242849b34a349b08bc5703cd14b1,

title = "Turning GSOS 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. {\textcopyright} 2012 The Author. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.",

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

year = "2013",

doi = "10.1093/comjnl/bxs120",

language = "English",

volume = "56",

pages = "34--44",

journal = "Computer Journal",

issn = "0010-4620",

publisher = "Oxford University Press",

number = "1",

}

TY - JOUR

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

AU - Gazda, M.

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. © 2012 The Author. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.

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. © 2012 The Author. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.

U2 - 10.1093/comjnl/bxs120

DO - 10.1093/comjnl/bxs120

M3 - Article

VL - 56

SP - 34

EP - 44

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 1

ER -

Turning GSOS into equations for linear time-branching time semantics

Abstract

UN SDGs

Access to Document

Handle.net

Fingerprint

Cite this