Turning GSOS into equations for linear time-branching time semantics

M. Gazda, W.J. Fokkink

Research output: Contribution to JournalArticleAcademicpeer-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 languageEnglish
Pages (from-to)34-44
JournalComputer Journal
Volume56
Issue number1
DOIs
Publication statusPublished - 2013

Fingerprint

Semantics
Algebra

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. {\circledC} 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",

}

Turning GSOS into equations for linear time-branching time semantics. / Gazda, M.; Fokkink, W.J.

In: Computer Journal, Vol. 56, No. 1, 2013, p. 34-44.

Research output: Contribution to JournalArticleAcademicpeer-review

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 -