Trace Semantics is Fully Abstract

mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science literature of the relative merits of linear- versus branching-time frameworks goes back to the early 1980s. One of the beliefs dominating this discussion has been that the linear-time framework is not expressive enough semantically, making linear-time logics lacking in expressiveness. In this work we examine the branching-linear issue from the perspective of process equivalence, which is one of the most fundamental concepts in concurrency theory, as defining a notion of equivalence essentially amounts to defining semantics for processes. We accept three principles that have been recently proposed for concurrent-process equivalence. The first principle takes contextual equivalence as the primary notion of equivalence. The second principle requires the description of a process to specify all relevant behavioral a...

• Type: Conference
• Year: 2009
• Where: LICS
• Authors: Sumit Nain, Moshe Y. Vardi
• Keywords: Computer Science, Concurrent-process Equivalence, Contextual Equivalence, LICS 2009, Process Equivalence