منابع مشابه
A Logical Process Calculus
This paper presents the Logical Process Calculus (LPC), a formalism that supports heterogeneous system specifications containing both operational and declarative subspecifications. Syntactically, kPC extends Milner's Calculus of Conmmnicating Systems with operators fl'om the alternation free linear time p calculus (kT#). Semantically, kPC is equipped with a behavioral preorder that generalizes ...
متن کاملA Process Calculus with Logical Operators
In order to combine operational and logical styles of specifications in one unified framework, the notion of logic labelled transition systems (Logic LTS, for short) has been presented and explored by Lüttgen and Vogler in [TCS 373(12):19-40; Inform. & Comput. 208:845-867]. In contrast with usual LTS, two logical constructors ∧ and ∨ over Logic LTSs are introduced to describe logical combinatio...
متن کاملA logical calculus for polynomial-time realizability
A logical calculus, not unlike Gentzen's sequent calculus for intuitionist logic, is described which is sound for polynomial-time realizability as deened by Crossley and Remmel. The sequent calculus admits cut elimination, thus giving a decision procedure for the propositional fragment. 0 Introduction In 4], a restricted notion of realizability is introduced, a special case of which is polynomi...
متن کاملA Logical Calculus of Meaning and Synonymy
In his development of formal semantics for natural language Montague [1970a]– Montague [1973], Richard Montague modeled the meaning (Frege’s sense) of a term A by its Carnap intension CI(A), the function which assigns to each state a, specifying a “possibleworld”, “time” and“context of use”, the denotationden(A)(a) of A in that state. Now this is surely not right: among other things, it makes “...
متن کاملA Dendroidal Process Calculus
The Dendroidal Process Calculus (DPC) is designed as a new theory for modeling concurrent and distributed computations and systems, equipped with a non-sequential and compositional semantics. In this theory, a parallel composition is parameterized by a graph at the vertices of which subprocesses are located. Communication is allowed only between subprocesses related by an edge in this graph. Mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80362-7