On the Unification of Process Semantics: Logical Semantics
نویسندگان
چکیده
منابع مشابه
On the Unification of Process Semantics: Logical Semantics
We continue with the task of obtaining a unifying view of process semantics by considering in this case the logical characterization of the semantics. We start by considering the classic linear timebranching time spectrum developed by R.J. van Glabbeek. He provided a logical characterization of most of the semantics in his spectrum but, without following a unique pattern. In this paper, we pres...
متن کاملOn the Unification of Process Semantics: Observational Semantics
The complexity of parallel systems has produced a large collection of semantics for processes. Van Glabbeek’s linear time-branching time spectrum provides a classification of most of these semantics; however, no suitable unified definitions were available. We have discovered how to unify them, both in an observational framework and in an equational framework. In this first part of our study we ...
متن کاملOn the Unification of Process Semantics: Equational Semantics
The complexity of parallel systems has produced a large collection of semantics for processes, a classification of which is provided by Van Glabbeek’s linear time-branching time spectrum; however, no suitable unified definitions were available. We have discovered the way to unify them, both in an observational framework and by means of a quite small set of parameterized (in)equations that provi...
متن کاملA π – calculus Semantics of Logical Variables and Unification
A π–calculus semantics of terms and logical variables, environment creation visavis term copying and variable refreshing, and sequential unification is presented. The π–calculus’s object–oriented approach to modelling evolving communication structures is used to model the evolving communication environment found in concurrent logic program computations. The novelty of this semantics is that it ...
متن کاملLogical Semantics for Stability
Type assignment systems for λ-calculus based on intersection types are a general framework for building models of λ-calculus (known as filter-models) which are useful tools for reasoning in a finitary way about the denotational intepretation of terms. Indeed the denotation of a term is the set of types derivable for it and a type is a “finite piece” of information on such a denotation. This app...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.62.4