Results 1  10
of
13
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 91 (2 self)
 Add to MetaCart
(Show Context)
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.
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 83 (12 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 ...
A Compositional Proof System for the Modal µCalculus
, 1994
"... We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal µcalculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal µcalculus and com ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal µcalculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal µcalculus and combines it with techniques from work on local model checking. The proof system is sound for all processes and complete for a class of finitestate processes.
Compositionality of HennessyMilner logic through structural operational semantics
 Huang and M. E. Glicksman, Acta Met
, 2003
"... Abstract. This paper presents a method for the decomposition of HML formulae. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms satisfy certain formulae, obtained by decomposing the original formula. The method uses the structural operation ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents a method for the decomposition of HML formulae. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms satisfy certain formulae, obtained by decomposing the original formula. The method uses the structural operational semantics of the process algebra. The main contribution of this paper is that an earlier decomposition method from Larsen [14] for the De Simone format is extended to the more general ntyft/ntyxt format without lookahead. 1
Verification of LOTOS Specifications using Term Rewriting Techniques
, 1994
"... Recently the use of formal methods in describing and analysing the behaviour of (computer) systems has become more common. This has resulted in the proliferation of a wide variety of different specification formalisms, together with analytical techniques and methodologies for specification developme ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Recently the use of formal methods in describing and analysing the behaviour of (computer) systems has become more common. This has resulted in the proliferation of a wide variety of different specification formalisms, together with analytical techniques and methodologies for specification development. The particular specification formalism adopted for this study is LOTOS, an ISO standard formal description technique. Although there are many works dealing with how to write LOTOS specifications and how to develop a LOTOS specification from the initial abstract requirements specification to concrete implementation, relatively few works are concerned with the problems of expressing and proving the correctness of LOTOS specifications, i.e. verification. The main objective of this thesis is to address this shortfall by investigating the meaning of verification as it relates to concurrent systems in general, and in particular to those systems described using LOTOS. Further goals are to autom...
Complete proof systems for weighted modal logic, Theor
 Comput. Sci
"... The weighted transition systems (WTS) considered in this paper are transition systems having both states and transitions labeled with real numbers: the state labels denote quantitative resources, while the transition labels denote costs of transitions in terms of resources. Weighted Modal Logic (WML ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
The weighted transition systems (WTS) considered in this paper are transition systems having both states and transitions labeled with real numbers: the state labels denote quantitative resources, while the transition labels denote costs of transitions in terms of resources. Weighted Modal Logic (WML) is a multimodal logic that expresses qualitative and quantitative properties of WTSs. While WML has been studied in various contexts and for various application domains, no proof system has been developed for it. In this paper we solve this open problem and propose both weakcomplete and strongcomplete axiomatizations for WML against WTSs. We prove a series of metatheorems including the finite model property and the existence of canonical models. We show how the proof system can be used in the context of a processalgebra semantics for WML to convert a modelchecking problem into a theoremproving problem. This work emphasizes a series of similarities between WML and the probabilistic/stochastic modal logics for Markov processes and Harsanyi type spaces, such as the use of particular infinitary rules to guarantee the strongcompleteness.
Compositionality for Improving Model Checking
, 2000
"... Model checking is an automatic technique for verifying nite state systems: in this approach, properties are expressed in a temporal logic and systems are modelled as transition systems. A main problem of model checking is state explosion: very complex systems are often represented by transition syst ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Model checking is an automatic technique for verifying nite state systems: in this approach, properties are expressed in a temporal logic and systems are modelled as transition systems. A main problem of model checking is state explosion: very complex systems are often represented by transition systems with a prohibitive number of states. The primary cause of this problem is the parallel composition of interacting processes. Many techniques have been proposed to attack this problem, among them compositional techniques. These techniques reduce state explosion exploiting the natural decomposition of complex systems into processes. In this paper we present a formulabased compositional rule that allows us to deduce a property of a parallel composition of processes by checking it only on a component process. Keywords: model checking, compositionality, temporal logic, state explosion. 1.