Results 1  10
of
24
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 289 (36 self)
 Add to MetaCart
We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like modelchecking for branchingtime logics), we consider the more general class of alternating pushdown systems and use alternating finitestate automata as a representation structure for their sets of configurations. We give a simple and natural procedure to compute sets of predecessors for this representation structure. We apply this procedure and the automatatheoretic approach to modelchecking to define new modelchecking algorithms for pushdown systems and both linear and branchingtime properties. From these results we derive upper bounds for several modelchecking problems, and we also provide matching lower bounds, using reductions based on some techniques introduced by Walukiewicz.
Formal Verification in Hardware Design: A Survey
 ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS
, 1999
"... ..."
Decidability Issues for Petri Nets  a survey
, 1994
"... : We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics. 1. Introduction Petri nets are one of the most popular formal models for the representation and analysis of parallel proc ..."
Abstract

Cited by 89 (5 self)
 Add to MetaCart
: We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics. 1. Introduction Petri nets are one of the most popular formal models for the representation and analysis of parallel processes. They are due to C.A. Petri, who introduced them in his doctoral dissertation in 1962. Some years later, and independently from Petri's work, Karp and Miller introduced vector addition systems [47], a simple mathematical structure which they used to analyse the properties of "parallel program schemata', a model for parallel computation. In their seminal paper on parallel program schemata, Karp and Miller studied some decidability issues for vector addition systems, and the topic continued to be investigated by other researchers. When Petri's ideas reached the States around 1970, it was observed that Petri nets and vector addition systems were mathematically equivalent, even though thei...
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.
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 68 (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.
Deductive Model Checking
, 1998
"... We present an extension of classical tableaubased model checking procedures to the case of infinitestate systems, using deductive methods in an incremental construction of the behavior graph. Logical formulas are used to represent infinite sets of states in an abstraction of this graph, which is ..."
Abstract

Cited by 46 (14 self)
 Add to MetaCart
We present an extension of classical tableaubased model checking procedures to the case of infinitestate systems, using deductive methods in an incremental construction of the behavior graph. Logical formulas are used to represent infinite sets of states in an abstraction of this graph, which is repeatedly refined in the search for a counterexample computation, ruling out large portions of the graph before they are expanded to the statelevel. This can lead to large savings, even in the case of finitestate systems. Only local conditions need to be checked at each step, and previously proven properties can be used to further constrain the search. Although the resulting method is not always automatic, it provides a flexible, general and complete framework that can integrate a diverse number of other verification tools.
More Infinite Results
, 1997
"... Recently there has been a spurt of activity in concurrency theory centred on the analysis of infinitestate systems. The following two problems have been intensely investigated: (1) given two infinitestate systems, are they equal with respect to a certain equivalence notion?, and (2) given an infin ..."
Abstract

Cited by 38 (2 self)
 Add to MetaCart
Recently there has been a spurt of activity in concurrency theory centred on the analysis of infinitestate systems. The following two problems have been intensely investigated: (1) given two infinitestate systems, are they equal with respect to a certain equivalence notion?, and (2) given an infinitestate system and a property expressed in a certain temporal logic, does the system satisfy the property? In his paper "Infinite Results" [Mol96] , Moller surveys some of the key results on the decidability and complexity of problem (1). This paper is a survey on the results about problem (2). 1 Introduction Most techniques for the verification of concurrent systems proceed by an exhaustive traversal of the state space. Therefore, they are inherently incapable of considering systems with infinitely many states. Recently, some methods have been developed to overcome this limitation, at least for restricted classes of infinitestate systems. Using them, several verification problems have b...
Composite Model Checking: Verification with TypeSpecific Symbolic Representations
 ACM Transactions on Software Engineering and Methodology
, 2000
"... In recent years, there has been a surge of progress in automated verification methods based on state exploration. In areas like hardware design, these technologies are rapidly augmenting key phases of testing and validation. To date, one of the most successful of these methods has been symbolic mode ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
In recent years, there has been a surge of progress in automated verification methods based on state exploration. In areas like hardware design, these technologies are rapidly augmenting key phases of testing and validation. To date, one of the most successful of these methods has been symbolic model checking, in which large finitestate machines are encoded into compact data structures such as binary decision diagrams (BDDs)  and are then checked for safety and liveness properties. However, these techniques have not realized the same success on software systems. One limitation is their inability to deal with infinitestate programs  even those with a single unbounded integer. A second problem is that of finding efficient representations for various variable types. We recently proposed a model checker for integerbased systems that uses arithmetic constraints as the underlying state representation. While this approach easily verified some subtle, infinitestate concurrency problems...
Fixpoint Alternation: Arithmetic, Transition Systems, and the Binary Tree
, 1998
"... We provide an elementary proof of the xpoint alternation hierarchy in arithmetic, which in turn allows us to simplify the proof of the modal mucalculus alternation hierarchy. ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We provide an elementary proof of the xpoint alternation hierarchy in arithmetic, which in turn allows us to simplify the proof of the modal mucalculus alternation hierarchy.
More Infinite Results
 UNIVERSITY OF PASSAU. UNIVERSITY OF PASSAU
, 1996
"... Recently there has been a spurt of activity in concurrency theory centered on the analysis of infinitestate systems. The following two problems have been intensely investigated: (1) given two infinitestate systems, are they equal with respect to a certain equivalence notion?, and (2) given an i ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Recently there has been a spurt of activity in concurrency theory centered on the analysis of infinitestate systems. The following two problems have been intensely investigated: (1) given two infinitestate systems, are they equal with respect to a certain equivalence notion?, and (2) given an infinitestate system and a property expressed in a certain temporal logic, does the system satisfy the property? In his CONCUR '96 paper, Faron Moller surveys some of the key results on the decidability and complexity of (1). The purpose of this paper for CONCUR's satellite INFINITY Workshop is to do the same with (2).