Results 1  10
of
14
Process algebra for synchronous communication
 Inform. and Control
, 1984
"... Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. Four cases are considered: free merge or interleaving, merging with communication, merging with mutual exclusion of tight regions, and synchronous process cooperation. The rewrite ..."
Abstract

Cited by 364 (51 self)
 Add to MetaCart
Within the context of an algebraic theory of processes, an equational specification of process cooperation is provided. Four cases are considered: free merge or interleaving, merging with communication, merging with mutual exclusion of tight regions, and synchronous process cooperation. The rewrite system behind the communication algebra is shown to be confluent and terminating (modulo its permutative reductions). Further, some relationships are shown to hold between the four concepts of merging. © 1984 Academic Press, Inc.
From Timed Automata to Logic  and Back
 MFCS’95, LNCS 969
, 1995
"... One of the most successful techniques for automatic verification is that of model checking. For finite automata there exist since long extremely efficient modelchecking algorithms, and in the last few years these algorithms have been made applicable to the verification of realtime automata usi ..."
Abstract

Cited by 52 (7 self)
 Add to MetaCart
One of the most successful techniques for automatic verification is that of model checking. For finite automata there exist since long extremely efficient modelchecking algorithms, and in the last few years these algorithms have been made applicable to the verification of realtime automata using the regiontechniques of Alur and Dill. In this
Ready Simulation, Bisimulation, and the Semantics of CCSLike Languages
, 1993
"... The questions of program comparison  asking when two programs are equal, or when one is a suitable substitute for another  are central in the semantics and verification of programs. It is not obvious what the definitions of comparison should be for parallel programs, even in the relatively sim ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
The questions of program comparison  asking when two programs are equal, or when one is a suitable substitute for another  are central in the semantics and verification of programs. It is not obvious what the definitions of comparison should be for parallel programs, even in the relatively simple case of core languages for concurrency, such as the kernel language of Milner's CCS. We introduce some criteria for judging notions of program comparison. Our basic notion is that of a congruence: two programs are equivalent with respect to a language L and a set of observations O iff they cannot be distinguished by any observation in O in any context of L. Bisimulation, the notion of program equivalence ordinarily used with CCS, is finer than CCS congruence: there are two programs which are not bisimilar, but cannot be told apart by CCS contexts. We explore the possibility of making bisimulation into a congruence. We CCS is defined by a set of structured operational rules. We introduc...
Descriptive and relative completeness for logics for higherorder functions
 In ICALP’06, volume 4052 of LNCS
, 2006
"... Abstract. This paper establishes a strong completeness property of compositional program logics for pure and imperative higherorder functions introduced in [2, 15–18]. This property, called descriptive completeness, says that for each program there is an assertion fully describing the former’s beha ..."
Abstract

Cited by 17 (9 self)
 Add to MetaCart
Abstract. This paper establishes a strong completeness property of compositional program logics for pure and imperative higherorder functions introduced in [2, 15–18]. This property, called descriptive completeness, says that for each program there is an assertion fully describing the former’s behaviour up to the standard observational semantics. This formula is inductively calculable from the program text alone. As a consequence we obtain the first relative completeness result for compositional logics of pure and imperative callbyvalue higherorder functions in the full type hierarchy. 1
Compositionality via cutelimination: HennessyMilner logic for an arbitrary GSOS
 In Logic in Computer Science
, 1995
"... We present a sequent calculus for proving that processes in a process algebra satisfy assertions in HennessyMilner logic. The main novelty lies in the use of the operational semantics to derive introduction rules (on the left and right of sequents) for the different operators of the process calculu ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
We present a sequent calculus for proving that processes in a process algebra satisfy assertions in HennessyMilner logic. The main novelty lies in the use of the operational semantics to derive introduction rules (on the left and right of sequents) for the different operators of the process calculus. This gives a generic proof system applicable to any process algebra with an operational semantics specified in the GSOS format. We identify the desirable property of compositionality with cutelimination, and we prove that this holds for a class of sequents. Further, we show that the proof system enjoys good completeness and !completeness properties relative to its intended model. 1 Introduction The provision of proof systems for program logics is an important research goal, as such systems enable one to give formal proofs guaranteeing that programs satisfy required properties. A desirable feature of such proof systems is that they should allow a compositional style of proof developme...
Derivation of Characteristic Formulae
, 2001
"... This paper shows how modal mucalculus formulae characterizing finitestate processes up to strong or weak bisimulation can be derived directly from the wellknown greatest fixpoint characterizations of the bisimulation relations. Our derivation simplifies earlier proofs for the strong bisimulation ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
This paper shows how modal mucalculus formulae characterizing finitestate processes up to strong or weak bisimulation can be derived directly from the wellknown greatest fixpoint characterizations of the bisimulation relations. Our derivation simplifies earlier proofs for the strong bisimulation case and, by virtue of derivation, immediately generalizes to various other bisimulationlike relations, in particular weak bisimulation.
Sequent Calculi for Process Verification: HennessyMilner Logic for an Arbitrary GSOS
, 2003
"... We argue that, by supporting a mixture of “compositional” and “structural” styles of proof, sequentbased proof systems provide a useful framework for the formal verification of processes. As a worked example, we present a sequent calculus for establishing that processes from a process algebra satis ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We argue that, by supporting a mixture of “compositional” and “structural” styles of proof, sequentbased proof systems provide a useful framework for the formal verification of processes. As a worked example, we present a sequent calculus for establishing that processes from a process algebra satisfy assertions in HennessyMilner logic. The main novelty lies in the use of the operational semantics to derive introduction rules, on the left and right of sequents, for the operators of the process calculus. This gives a generic proof system applicable to any process algebra with an operational semantics specified in the GSOS format. Using a general algebraic notion of GSOS model, we prove a completeness theorem for the cutfree fragment of the proof system, thereby establishing the admissibility of the cut rule. Under mild (and necessary) conditions on the process algebra, an ωcompleteness result, relative to the “intended” model of closed process terms, follows.
Characteristic µcalculus formula for an underspecified transition system
 In EXPRESS’04, volume 128 of Electronic
"... Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting.
Characteristic Formulae for FixedPoint Semantics: A General Framework
 UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2010
"... The literature on concurrency theory offers a wealth of examples of characteristicformula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions and their proof ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The literature on concurrency theory offers a wealth of examples of characteristicformula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions and their proofs of correctness have been developed independently, but have a common underlying structure. This study provides a general view of characteristic formulae that are expressed in terms of logics with a facility for the recursive definition of formulae. It is shown how several examples of characteristicformula constructions from the literature can be recovered as instances of the proposed general framework, and how the framework can be used to yield novel constructions. The paper also offers general results pertaining to the definition of cocharacteristic formulae and of characteristic formulae expressed in terms of infinitary modal logics.
Inductive Inference of Algebraic Processes based on HennessyMilner Logic
"... This paper considers algebraic basic processes, a subset of communicating processes in CCS by Milner, and presents a synthesis algorithm to infer a process that satisfies the properties of the process, represented as formulae in HennessyMilner Logic. The validity of the proposed algorithm can be st ..."
Abstract
 Add to MetaCart
This paper considers algebraic basic processes, a subset of communicating processes in CCS by Milner, and presents a synthesis algorithm to infer a process that satisfies the properties of the process, represented as formulae in HennessyMilner Logic. The validity of the proposed algorithm can be stated that it synthesizes a process in the limit, which cannot be distinguished from the target one with respect to the strong equivalence. key words: inductive inference, algebraic process, CCS, HennessyMilner logic, bisimulation, process calculus, process algebra 1 1 Introduction The theoretical study of the inductive inference was started by the identification of sequential machines by Moore in l950's. It then developed into the theories of identification for systems and language grammars [1, 5, 8, 12, 15] The studies of process calculi started from the latter half of 1970's to give mathematical semantics for concurrent processes. Typical systems are CSP by Hoare [4] and CCS by Milner [10]. In Feb. 1990, ISO adopted LOTOS [2] as the international standard for OSI specification description language. Those algebraic formalization techniques are utilized as the descriptive languages for communicating processes and concurrent programs. They are also applied to the verification problem, by virtue of mathematical formality. The processes, however, have the features of such as nondeterminacy and concurrency, so their operational semantics are completely different from those of the traditional automata and formal languages. The inductive inference of processes forms a basis for the automatic synthesis of the highly reliable communicating protocols and concurrent programs from the examples. However, little has been investigated for inductive inference of algebraic processes, due...