Results 1 
9 of
9
Compositional Model Checking
, 1999
"... We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approac ..."
Abstract

Cited by 2407 (62 self)
 Add to MetaCart
We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approach is that local properties are often not preserved at the global level. We present a general framework for using additional interface processes to model the environment for a component. These interface processes are typically much simpler than the full environment of the component. By composing a component with its interface processes and then checking properties of this composition, we can guarantee that these properties will be preserved at the global level. We give two example compositional systems based on the logic CTL*.
On ModelChecking for Fragments of µCalculus
 In CAV'93, volume 697 of LNCS
, 1995
"... this paper we consider the problem of modelchecking for different fragments of propositional ¯calculus. This logic was studied by many authors [6, 9] for specifying the properties of concurrent programs. It has been shown to be as expressive of automata on infinite trees. Most of the known temporal ..."
Abstract

Cited by 53 (1 self)
 Add to MetaCart
this paper we consider the problem of modelchecking for different fragments of propositional ¯calculus. This logic was studied by many authors [6, 9] for specifying the properties of concurrent programs. It has been shown to be as expressive of automata on infinite trees. Most of the known temporal and dynamic logics can be translated into this logic. The modelchecking problem for this logic was first considered in [7]. In this paper, the authors presented an algorithm that is O((mn)
Heuristic Search
, 2011
"... Heuristic search is used to efficiently solve the singlenode shortest path problem in weighted graphs. In practice, however, one is not only interested in finding a short path, but an optimal path, according to a certain cost notion. We propose an algebraic formalism that captures many cost notions ..."
Abstract

Cited by 40 (22 self)
 Add to MetaCart
Heuristic search is used to efficiently solve the singlenode shortest path problem in weighted graphs. In practice, however, one is not only interested in finding a short path, but an optimal path, according to a certain cost notion. We propose an algebraic formalism that captures many cost notions, like typical Quality of Service attributes. We thus generalize A*, the popular heuristic search algorithm, for solving optimalpath problem. The paper provides an answer to a fundamental question for AI search, namely to which general notion of cost, heuristic search algorithms can be applied. We proof correctness of the algorithms and provide experimental results that validate the feasibility of the approach.
On the Structure of Inductive Reasoning: Circular and TreeShaped Proofs in the µCalculus
 IN PROCEEDINGS OF FOSSACS 2003
, 2003
"... In this paper we study induction in the context of the firstorder µcalculus with explicit approximations. We present and compare two Gentzenstyle proof systems each using a different type of induction. The first is ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
In this paper we study induction in the context of the firstorder µcalculus with explicit approximations. We present and compare two Gentzenstyle proof systems each using a different type of induction. The first is
Strict Lower Bounds for Model Checking BPA
 ENTCS
, 1998
"... We show strict lower bounds for the complexity of several model checking problems for BPA (Basic Process Algebra). Model checking BPA with HennessyMilner Logic is PSPACEhard, while model checking BPA with the (alternationfree) modal ¯ calculus is EXPTIMEhard. Model checking BPA with LTL is als ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We show strict lower bounds for the complexity of several model checking problems for BPA (Basic Process Algebra). Model checking BPA with HennessyMilner Logic is PSPACEhard, while model checking BPA with the (alternationfree) modal ¯ calculus is EXPTIMEhard. Model checking BPA with LTL is also EXPTIME hard. By combining these results with already established upper bounds, it follows that the model checking problems are PSPACEcomplete and EXPTIMEcomplete, respectively. 1 Introduction Basic Process Algebra (BPA) processes were defined by Bergstra and Klop in [1]. They are transition systems associated with Greibach normal form (GNF) contextfree grammars in which only leftmost derivations are permitted. BPAprocesses are also called contextfree processes. They are a subclass of pushdown processes, where the finite control of the pushdown automaton has only one state. It has been known for some time that model checking pushdown processes with the modal ¯calculus is EXPTIME...
Global modelchecking of infinitestate systems
 in: Proc. 16th International Conference on Computer Aided Verification, CAV’04, in: LNCS
, 2004
"... Abstract. We extend the automatatheoretic framework for reasoning about infinitestate sequential systems to handle also the global modelchecking problem. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed a ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. We extend the automatatheoretic framework for reasoning about infinitestate sequential systems to handle also the global modelchecking problem. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finitestate automata. Checking that the system satisfies a temporal property can then be done by a twoway automaton that navigates through the tree. The framework is known for local model checking. For branching time properties, the framework uses twoway alternating automata. For linear time properties, the framework uses twoway path automata. In order to solve the global modelchecking problem we show that for both types of automata, given a regular tree, we can construct a nondeterministic word automaton that accepts all the nodes in the tree from which an accepting run of the automaton can start. 1
A Note on Global Induction Mechanisms in a µCalculus with Explicit Approximations
, 1999
"... We investigate a Gentzenstyle proof system for the firstorder µcalculus based on cyclic proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our system uses explicit ordinal variables and approximations to support a simple semantic induction discharge conditio ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We investigate a Gentzenstyle proof system for the firstorder µcalculus based on cyclic proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our system uses explicit ordinal variables and approximations to support a simple semantic induction discharge condition which ensures the wellfoundedness of inductive reasoning. As the main result of this paper we propose a new syntactic discharge condition based on traces and establish its equivalence with the semantical condition. We give an automatatheoretic reformulation of this condition which is more suitable for practical proofs. For a detailed
Symbolic Model Checking of NonRegular Properties
 Proc. 16th Conf. on Computer Aided Verification, CAV’04, volume 3114 of LNCS
, 2004
"... This paper presents a symbolic model checking algorithm for Fixpoint Logic with Chop, an extension of the modal calculus capable of defining nonregular properties. Some empirical data about running times of a naive implementation of this algorithm are given as well. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper presents a symbolic model checking algorithm for Fixpoint Logic with Chop, an extension of the modal calculus capable of defining nonregular properties. Some empirical data about running times of a naive implementation of this algorithm are given as well.