LIPIcs.CSL.2011.3.pdf
- Filesize: 221 kB
- 1 pages
Document
Branching vs. Linear Time: Semantical Perspective
Author
-
Part of:
Volume:
Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL (CSL 2011)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Computer Science Logic (CSL) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-08-31
Cite As Get BibTex
Moshe Y. Vardi. Branching vs. Linear Time: Semantical Perspective. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, p. 3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/LIPIcs.CSL.2011.3
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.
Subject Classification
Keywords
- linear time
- branching time
- process equivalence
- contextual equivalence
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads