License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2011.3
URN: urn:nbn:de:0030-drops-32173
URL: http://drops.dagstuhl.de/opus/volltexte/2011/3217/

Vardi, Moshe Y.

Branching vs. Linear Time: Semantical Perspective

pdf-format:
Dokument 1.pdf (222 KB)


Abstract

The discussion of the relative merits of linear- versus branching-time frameworks goes back to the early 1980s. We revisit here this issue from a fresh perspective and postulate three principles that we view as fundamental to any discussion of process equivalence. We show that our principles yield a unique notion of process equivalence, which is trace based, rather than tree based.

BibTeX - Entry

@InProceedings{vardi:LIPIcs:2011:3217,
  author =	{Moshe Y. Vardi},
  title =	{{Branching vs. Linear Time: Semantical Perspective}},
  booktitle =	{Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL},
  pages =	{3--3},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-32-3},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{12},
  editor =	{Marc Bezem},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3217},
  URN =		{urn:nbn:de:0030-drops-32173},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.CSL.2011.3},
  annote =	{Keywords: linear time, branching time, process equivalence, contextual equivalence}
}

Keywords: linear time, branching time, process equivalence, contextual equivalence
Seminar: Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL
Issue date: 2011
Date of publication: 31.08.2011


DROPS-Home | Fulltext Search | Imprint Published by LZI