Results 1  10
of
15
Model Checking Mobile Processes
, 1993
"... We introduce a temporal logic for the polyadic ßcalculus based on fixed point extensions of HennessyMilner logic. Features are added to account for parametrisation, generation, and passing of names, including the use, following Milner, of dependent sum and product to account for (unlocalised) inpu ..."
Abstract

Cited by 63 (11 self)
 Add to MetaCart
We introduce a temporal logic for the polyadic ßcalculus based on fixed point extensions of HennessyMilner logic. Features are added to account for parametrisation, generation, and passing of names, including the use, following Milner, of dependent sum and product to account for (unlocalised) input and output, and explicit parametrisation on names using lambdaabstraction and application. The latter provides a single name binding mechanism supporting all parametrisation needed. A proof system and decision procedure is developed based on Stirling and Walker's approach to model checking the modal ¯calculus using constants. One difficulty, for both conceptual and efficiencybased reasons, is to avoid the explicit use of the !rule for parametrised processes. A key idea, following Hennessy and Lin's approach to deciding bisimulation for certain types of valuepassing processes, is the relativisation of correctness assertions to conditions on names. Based on this idea a proof system and ...
Proof Systems for MessagePassing Process Algebras
 Formal Aspects of Computing
, 1993
"... We give sound and complete proof systems for a variety of bisimulation based equivalences over a messagepassing process algebra. The process algebra is a generalisation of pure CCS where the actions consist of receiving and sending messages or data on communication channels; the standard prefixing ..."
Abstract

Cited by 28 (9 self)
 Add to MetaCart
We give sound and complete proof systems for a variety of bisimulation based equivalences over a messagepassing process algebra. The process algebra is a generalisation of pure CCS where the actions consist of receiving and sending messages or data on communication channels; the standard prefixing operator a:p is replaced by the two operators c?x:p and c!e:p and in addition messages can be tested by a conditional construct. The various proof systems are parameterised on auxiliary proof systems for deciding on equalities or more general boolean identities over the expression language for data. The completeness of these proof systems are thus relative to the completeness of the auxiliary proof systems.
Reasoning about HigherOrder Processes
, 1994
"... We address the specification and verification problem for process calculi such as Chocs, CML and Facile where processes or functions are transmissible values. Our work takes place in the context of a static treatment of restriction and of a bisimulationbased semantics. As a paradigmatic and simple ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
We address the specification and verification problem for process calculi such as Chocs, CML and Facile where processes or functions are transmissible values. Our work takes place in the context of a static treatment of restriction and of a bisimulationbased semantics. As a paradigmatic and simple case we concentrate on (Plain) Chocs. We show that Chocs bisimulation can be characterized by an extension of HennessyMilner logic including a constructive implication, or function space constructor. This result is a nontrivial extension of the classical characterization result for labelled transition systems. In the second part of the paper we address the problem of developing a proof system for the verification of process specifications. Building on previous work for CCS we present an infinitary sound and complete proof system for the fragment of the calculus not handling restriction. Keywords: Higherorder process calculi; Bisimulation; Modal logics; Program specification; Program verif...
An adequate logic for Full LOTOS
 FORMAL METHODS EUROPE'01, LNCS 2021
, 2001
"... We present a novel result for a logic for symbolic transition systems based on LOTOS processes. The logic is adequate with respect to bisimulation de ned on symbolic transition systems. ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
We present a novel result for a logic for symbolic transition systems based on LOTOS processes. The logic is adequate with respect to bisimulation de ned on symbolic transition systems.
A Symbolic Approach to ValuePassing Processes
 Handbook of Process Algebra, chapter 7. Elsevier Science
, 2001
"... In this chapter we give a survey of the semantic theory for valuepassing processes, focusing on bisimulation equivalences. The emphasis is on the symbolic method. Both operational and proof theoretic approaches are described and their expressiveness compared. ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
In this chapter we give a survey of the semantic theory for valuepassing processes, focusing on bisimulation equivalences. The emphasis is on the symbolic method. Both operational and proof theoretic approaches are described and their expressiveness compared.
A Semantic Theory for ValuePassing Processes Late Approach  Part I: A Denotational Model and Its Complete Axiomatization
, 1995
"... A general class of languages and denotational models for valuepassing calculi based on the late semantic approach is defined. A concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. A denotational model for the concrete ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
A general class of languages and denotational models for valuepassing calculi based on the late semantic approach is defined. A concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. A denotational model for the concrete language is given, an instantiation of the general class. An equationally based proof system is defined and shown to be sound and complete with respect to the model.
Symbolic Bisimulation for Full LOTOS
"... . A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined, following the approach taken for message passing CCS in [HL95a], altered to take account of the particular features of LOTOS (multiway synchronisation, value negotiation, selection predicates). Symbolic bisim ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
. A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined, following the approach taken for message passing CCS in [HL95a], altered to take account of the particular features of LOTOS (multiway synchronisation, value negotiation, selection predicates). Symbolic bisimulation over symbolic transition systems is defined, and symbolic bisimulation on ground behaviour expressions is shown to preserve the usual concrete (strong) bisimulation on the standard semantics. Finally, a modal logic based on symbolic transition systems is defined. All are illustrated with reference to examples. 1 Introduction Full LOTOS 4 is a message passing process algebra which combines some features of both CSP [Hoa85] and CCS [Mil89]. In order to accommodate multiway synchronisation, i.e. associative synchronisation between two or more processes, the standard semantics of LOTOS gives meaning only to processes with ground data; the semantics is in terms of structured labelled ...
Fast Generic ModelChecking for DataBased Systems
 FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS  FORTE 2005, VOLUME 3731 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2005
"... This paper shows how predicate equation systems (PESs) may be used to solve modelchecking problems for systems, such as those involving realtime or value passing, that manipulate data. PESs are first defined and the encoding of modelchecking problems described; then generic global and local appr ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper shows how predicate equation systems (PESs) may be used to solve modelchecking problems for systems, such as those involving realtime or value passing, that manipulate data. PESs are first defined and the encoding of modelchecking problems described; then generic global and local approaches for solving PESs are given. Realtime model checking is then considered in detail, and a new, efficient onthefly technique for realtime model checking based on proof search in PESs is developed and experimentally shown to significantly outperform existing approaches when system specifications or formula specifications contain errors and to be competitive when both are correct.
Model Checking Valuepassing Processes
 In Proc. Of 8th AsiaPacific Software Engineering Conference
, 2001
"... An algorithm for model checking valuepassing processes is presented. Processes are modeled as symbolic transition graphs with assignments. To specify properties for such processes a graphical predicate mucalculus is introduced. It allows arbitrary nesting of the least and greatest fixpoints, and c ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
An algorithm for model checking valuepassing processes is presented. Processes are modeled as symbolic transition graphs with assignments. To specify properties for such processes a graphical predicate mucalculus is introduced. It allows arbitrary nesting of the least and greatest fixpoints, and contains the propositional mucalculus as a proper subset. The algorithm instantiates input variables onthefly and states are only generated when they are needed for the computation. To handle alternating fixpoints properly, a multistack is employed and the controlling strategy is such that a state is evaluated without depending on the default values for more deeply nested states. The algorithm is shown correct with respect to the semantics of the predicate mucalculus. Its complexity is also analysed.