Results 1  10
of
96
Verification on Infinite Structures
, 2000
"... In this chapter, we present a hierarchy of infinitestate systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonlystudied classes of systems such as contextfree and pushdown automata, and Petri net processes. We then examine the ..."
Abstract

Cited by 87 (2 self)
 Add to MetaCart
In this chapter, we present a hierarchy of infinitestate systems based on the primitive operations of sequential and parallel composition; the hierarchy includes a variety of commonlystudied classes of systems such as contextfree and pushdown automata, and Petri net processes. We then examine the equivalence and regularity checking problems for these classes, with special emphasis on bisimulation equivalence, stressing the structural techniques which have been devised for solving these problems. Finally, we explore the model checking problem over these classes with respect to various linear and branchingtime temporal logics.
Infinite Results
, 1996
"... Recently there has been a spurt of activity in concurrency theory centred on the analysis of infinitestate systems. Much of this work stems from a task dedicated to the study in the recentlyconcluded ESPRIT BRA Concur2, and much of it has subsequently appeared in the proceedings of the annual CO ..."
Abstract

Cited by 64 (5 self)
 Add to MetaCart
Recently there has been a spurt of activity in concurrency theory centred on the analysis of infinitestate systems. Much of this work stems from a task dedicated to the study in the recentlyconcluded ESPRIT BRA Concur2, and much of it has subsequently appeared in the proceedings of the annual CONCUR conference. In this paper, we present an overview of various results obtained regarding expressivity, decidability, and complexity, focussing on the various techniques exploited in each case.
Modal Logics and muCalculi: An Introduction
, 2001
"... We briefly survey the background and history of modal and temporal logics. We then concentrate on the modal mucalculus, a modal logic which subsumes most other commonly used logics. We provide an informal introduction, followed by a summary of the main theoretical issues. We then look at modelchec ..."
Abstract

Cited by 59 (3 self)
 Add to MetaCart
We briefly survey the background and history of modal and temporal logics. We then concentrate on the modal mucalculus, a modal logic which subsumes most other commonly used logics. We provide an informal introduction, followed by a summary of the main theoretical issues. We then look at modelchecking, and finally at the relationship of modal logics to other formalisms.
Practical ModelChecking Using Games
 Lecture
, 1998
"... . We describe how modelchecking games can be the foundation for efficient local modelchecking of the modal mucalculus on transition systems. Gamebased algorithms generate winning strategies for a certain game, which can then be used interactively to help the user understand why the property ..."
Abstract

Cited by 42 (0 self)
 Add to MetaCart
(Show Context)
. We describe how modelchecking games can be the foundation for efficient local modelchecking of the modal mucalculus on transition systems. Gamebased algorithms generate winning strategies for a certain game, which can then be used interactively to help the user understand why the property is or is not true of the model. This kind of feedback has advantages over traditional techniques such as error traces. We give a proof technique for verifying such algorithms, and apply it to one which we have implemented in the Edinburgh Concurrency Workbench. We discuss its usability and performance. 1 Introduction The modal mucalculus (see e.g. [9]) is an expressive logic which can be used to describe properties of systems modelled as labelled transition systems (LTSs). The problem of modelchecking the mucalculus on transition systems is that of deciding whether an LTS satisfies a formula. Many modelchecking algorithms have been developed and implemented in tools. One such tool ...
Modeling and Model Checking Software Product Lines
"... Abstract. Software product line engineering combines the individual developments of systems to the development of a family of systems consisting of common and variable assets. In this paper we introduce the process algebra PLCCS as a product line extension of CCS and show how to model the overall b ..."
Abstract

Cited by 41 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Software product line engineering combines the individual developments of systems to the development of a family of systems consisting of common and variable assets. In this paper we introduce the process algebra PLCCS as a product line extension of CCS and show how to model the overall behavior of an entire family within PLCCS. PLCCS models incorporate behavioral variability and allow the derivation of individual systems in a systematic way due to a semantics given in terms of multivalued modal Kripke structures. Furthermore, we introduce multivalued modal µcalculus as a property specification language for system families specified in PLCCS and show how model checking techniques operate on such structures. In our setting the result of model checking is no longer a simple yes or no answer but the set of systems of the product line that do meet the specified properties. 1
An exponential lower bound for the parity game strategy improvement algorithm as we know it
 In Proc. of 24th LICS
, 2009
"... This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to Vöge and Jurdziński. First, we informally show which structures are difficult to solve for the algorithm. Second, we outline a family of games on which the algorithm requires exponen ..."
Abstract

Cited by 33 (8 self)
 Add to MetaCart
(Show Context)
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to Vöge and Jurdziński. First, we informally show which structures are difficult to solve for the algorithm. Second, we outline a family of games on which the algorithm requires exponentially many strategy iterations, answering in the negative the longstanding question whether this algorithm runs in polynomial time. Additionally we note that the same family of games can be used to prove a similar result w.r.t. the strategy improvement variant by Schewe as well as the strategy iteration for solving discounted payoff games due to Puri. 1.
A gamebased framework for CTL counterexamples and 3valued abstractionrefinement
 In Computer Aided Verification (CAV), LNCS 2725
, 2003
"... Abstract. This work exploits and extends the gamebased framework of CTL model checking for counterexample and incremental abstractionrefinement. We define a gamebased CTL model checking for abstract models over the 3valued semantics, which can be used for verification as well as refutation. The ..."
Abstract

Cited by 26 (6 self)
 Add to MetaCart
(Show Context)
Abstract. This work exploits and extends the gamebased framework of CTL model checking for counterexample and incremental abstractionrefinement. We define a gamebased CTL model checking for abstract models over the 3valued semantics, which can be used for verification as well as refutation. The model checking may end with an indefinite result, in which case we suggest a new notion of refinement, which eliminates indefinite results of the model checking. This provides an iterative abstractionrefinement framework. It is enhanced by an incremental algorithm, where refinement is applied only where indefinite results exist and definite results from prior iterations are used within the model checking algorithm. We also define the notion of annotated counterexamples, which are sufficient and minimal counterexamples for full CTL. We present an algorithm that uses the game board of the model checking game to derive an annotated counterexample in case the examined system model refutes the checked formula. 1
Solving Parity Games in Practice
"... Abstract. Parity games are 2player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model checking) for temporal logics. In this paper we investigate practical aspects of solving parity games. The mai ..."
Abstract

Cited by 26 (9 self)
 Add to MetaCart
(Show Context)
Abstract. Parity games are 2player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model checking) for temporal logics. In this paper we investigate practical aspects of solving parity games. The main contribution is a suggestion on how to solve parity games efficiently in practice: we present a generic solver that intertwines optimisations with any of the existing parity game algorithms which is only called on parts of a game that cannot be solved faster by simpler methods. This approach is evaluated empirically on a series of benchmarking games from the aforementioned application domains, showing that using this approach vastly speeds up the solving process. As a sideeffect we obtain the surprising observation that Zielonka’s recursive algorithm is the best parity game solver in practice. 1
A Probabilistic Temporal Calculus Based on Expectations
, 1997
"... Generalising Booleanvalued predicates to expectations  functions from the state space into [0; 1]  allows the definition of probabilistic temporal operators that treat explicit probabilities as well as demonic nondeterminism and divergence. The conventional operational interpretation of the te ..."
Abstract

Cited by 24 (14 self)
 Add to MetaCart
Generalising Booleanvalued predicates to expectations  functions from the state space into [0; 1]  allows the definition of probabilistic temporal operators that treat explicit probabilities as well as demonic nondeterminism and divergence. The conventional operational interpretation of the temporal operators does not generalise so easily: although one may speak of "satisfying a predicate" in the standard case, it is not meaningful to "satisfy an expectation". That difficulty is avoided by giving the operational interpretation of the operators for the probabilistic case in terms of various kinds of gambling game.