Results 1  10
of
22
Modal and Temporal Logics for Processes
, 1996
"... this paper have been presented at the 4th European Summer School in Logic, Language and Information, University of Essex, 1992; at the Tempus Summer School for Algebraic and Categorical Methods in Computer Science, Masaryk University, Brno, 1993; and the Summer School in Logic Methods in Concurrency ..."
Abstract

Cited by 69 (2 self)
 Add to MetaCart
this paper have been presented at the 4th European Summer School in Logic, Language and Information, University of Essex, 1992; at the Tempus Summer School for Algebraic and Categorical Methods in Computer Science, Masaryk University, Brno, 1993; and the Summer School in Logic Methods in Concurrency, Aarhus University, 1993. I would like to thank the organisers and the participants of these summer schools, and of the Banff higher order workshop. I would also like to thank Julian Bradfield for use of his Tex tree constructor for building derivation trees and Carron Kirkwood, Faron Moller, Perdita Stevens and David Walker for comments on earlier drafts.
Selective mucalculus: New Modal Operators for Proving Properties on Reduced Transition Systems
 In Proceedings of FORTE X/PSTV XVII '97. Chapman
, 1997
"... In model checking for temporal logic, the correctness of a (concurrent) system with respect to a desired behavior is verified by checking whether a structure that models the system satisfies a formula describing the behaviour. Most existing verification techniques, and in particular those defined fo ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
In model checking for temporal logic, the correctness of a (concurrent) system with respect to a desired behavior is verified by checking whether a structure that models the system satisfies a formula describing the behaviour. Most existing verification techniques, and in particular those defined for concurrent calculi like as CCS, are based on a representation of the concurrent system by means of a labelled transition system. In this approach to verification, state explosion is one of the most serious problems. In this paper we present a new temporal logic, the selective mucalculus, with the property that only the actions occurring in a formula are relevant to check the formula itself. We prove that the selective mucalculus is as powerful as the mucalculus. We define the notion of aebisimulation between transition systems: given a set of actions ae, a transition system aebisimulates another one if they have the same behaviour with respect to the actions in ae. We prove that, if t...
ObjectOriented Specification of Distributed Systems in the µCalculus and Maude
 ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
, 1997
"... We refine an abstract propertyoriented specification in the µcalculus to a specification in Maude. As an intermediate step, we use a structured specification in the µcalculus blended with propositions on states appropriate for objectoriented specification. We use the loose approach in refinement ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We refine an abstract propertyoriented specification in the µcalculus to a specification in Maude. As an intermediate step, we use a structured specification in the µcalculus blended with propositions on states appropriate for objectoriented specification. We use the loose approach in refinement and refine data types as well as behavior. Throughout, our example is the bounded buffer.
Selective mucalculus and FormulaBased Equivalence of Transition Systems
, 1999
"... this paper we present a new temporal logic, the selective mucalculus, and an equivalence between transition systems based on the formulae of this logic. This property preserving equivalence can be used to reduce the size of transition systems. The equivalence (called ae ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
this paper we present a new temporal logic, the selective mucalculus, and an equivalence between transition systems based on the formulae of this logic. This property preserving equivalence can be used to reduce the size of transition systems. The equivalence (called ae
State Space Reduction by Nonstandard Semantics for Deadlock Analysis
 Science of Computer Programming
, 1998
"... In recent years many techniques have been developed for automatically verifying concurrent systems and most of them are based on the representation of the concurrent system by means of a transition system. State explosion is one of the most serious problems of this approach: often the prohibitive nu ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In recent years many techniques have been developed for automatically verifying concurrent systems and most of them are based on the representation of the concurrent system by means of a transition system. State explosion is one of the most serious problems of this approach: often the prohibitive number of states renders the verification inefficient and, in some cases, impossible. We propose a method for reducing the state space of the transition system corresponding to a CCS process that suites deadlock analysis. The reduced transition system is generated by means of a nonstandard operational semantics containing a set of rules which are, in some sense, an abstraction, preserving deadlock freeness, of the inference rules of the standard semantics. Our method does not build the standard transition system, but directly generates an abstract system with a fewer number of states, so saving memory space. We characterize a class of processes whose abstract transition system is not exponential in the number of parallel components. Keywords: process algebras, transition systems, state explosion, structural operational semantics, deadlock. 1 This work has been partially funded by Progetto Coordinato CNR ANATRA 1 1
Loreto: A Tool For Reducing State Explosion In Verification Of Lotos Programs
"... LOTOS is a formal specification language for concurrent and distributed systems. Basic LOTOS is the version of LOTOS without valuepassing. A widely used approach to verification of temporal properties is model checking. Often, in this approach the formal specification is translated into a labele ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
LOTOS is a formal specification language for concurrent and distributed systems. Basic LOTOS is the version of LOTOS without valuepassing. A widely used approach to verification of temporal properties is model checking. Often, in this approach the formal specification is translated into a labeled transition systems on which formulae expressing properties are checked. A problem of this verification technique is state explosion: concurrent systems are often represented by automata with a prohibitive number of states. In this paper we show how, given a set ae of actions, it is possible to automatically obtain for a Basic LOTOS program a reduced transition system to which only the arcs labeled by actions in ae belong. The set ae of actions plays a fundamental role in conjunction with a temporal logic defined by the authors in a previous paper: selective mucalculus. The reduced system with respect to ae preserves the truth value of all selective mucalculus formulae with actions...
Specification and Verification of Communicating Systems with Value Passing
, 1998
"... The present Thesis addresses the problem of specification and verification of communicating systems with value passing. We assume that such systems are described in the wellknown Calculus of Communicating Systems, or rather, in its value passing version. As a specification language we propose an ex ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The present Thesis addresses the problem of specification and verification of communicating systems with value passing. We assume that such systems are described in the wellknown Calculus of Communicating Systems, or rather, in its value passing version. As a specification language we propose an extension of the Modal ¯Calculus, a polymodal firstorder logic with recursion. For this logic we develop a proof system for verifying judgements of the form b ` E : \Phi where E is a sequential CCS term and b is a Boolean assumption about the value variables occurring free in E and \Phi. Proofs conducted in this proof system follow the structure of the process term and the formula. This syntactic approach makes proofs easier to comprehend and machine assist. To avoid the introduction of global proof rules we adopt a technique of tagging fixpoint formulae with all relevant information needed for the discharge of reoccurring sequents. We provide such tagged formulae with a suitable semantics...
A Non StandardSemantics for Generating Reduced Transition Systems
, 1996
"... In recent years many techniques have been developed for automatically verifying concurrent systems and most of them are based on a representation of the concurrent system by means of a transition system. State explosion is one of the most serious problems of this approach: in fact often the prohibit ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In recent years many techniques have been developed for automatically verifying concurrent systems and most of them are based on a representation of the concurrent system by means of a transition system. State explosion is one of the most serious problems of this approach: in fact often the prohibitive number of states renders the verification inefficient and, in some cases, impossible. We propose an approach to the reduction of the state space of the transition system corresponding to a CCS process, which takes into account the deadlock freeness property. The reduced transition system is generated by means of a nonstandard operational semantics containing a set of rules which are, in some sense, an abstraction, preserving deadlock freeness, of the inference rules of the standard semantics.
Model Checking of nonfinite state processes by Finite Approximations
 IN PROC. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS (TACAS'95), LECTURE NOTES IN COMPUTER SCIENCE 1019
, 1994
"... In this paper we present a verification methodology, using an actionbased logic, able to check properties for full CCS terms, allowing also verification on infinite state systems. Obviously, for some properties we are only able to give a semidecision procedure. The idea is to use (a sequence of) fi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we present a verification methodology, using an actionbased logic, able to check properties for full CCS terms, allowing also verification on infinite state systems. Obviously, for some properties we are only able to give a semidecision procedure. The idea is to use (a sequence of) finite state transition systems which approximate the, possibly infinite state, transition system corresponding to a term. To this end we define a particular notion of approximation, which is stronger than simulation, suitable to define and prove liveness and safety properties of the process terms.