Results 1 - 10 of 12,866

Model-Checking for Real-Time Systems

by Kim G. Larsen, Paul Pettersson, Wang Yi , 1995
"... . Efficient automatic model--checking algorithms for real-time systems have been obtained in recent years based on the state--region graph technique of Alur, Courcoubetis and Dill. However, these algorithms are faced with two potential types of explosion arising from parallel composition: explosion ..."
Abstract - Cited by 107 (12 self) - Add to MetaCart
in the space of control nodes, and explosion in the region space over clock-variables. This paper reports on work attacking these explosion problems by developing and combining compositional and symbolic model--checking techniques. The presented techniques provide the foundation for a new automatic

Compositional and Symbolic Model-Checking of Real-Time Systems

by Kim G. Larsen, Paul Pettersson, Wang Yi - In Proc. of the 16th IEEE Real-Time Systems Symposium , 1995
"... Efficient automatic model-checking algorithms for real-time systems have been obtained in recent years based on the state-region graph technique of Alur, Courcoubetis and Dill. However, these algorithms are faced with two potential types of explosion arising from parallel composition: explosion in t ..."
Abstract - Cited by 71 (21 self) - Add to MetaCart
in the space of control nodes, and explosion in the region space over clockvariables. In this paper we attack these explosion problems by developing and combining compositional and symbolic model-checking techniques. The presented techniques provide the foundation for a new automatic verification tool Uppaal

Compositional and Symbolic Model-Checking of Real-Time Systems

by Kim G. Larson, Kim G. Larsen, Paul Pettersson, Paul Pettersson, Wang Yi, Wang Yi , 1996
"... Efficient automatic model-checking algorithms for real-time systems have been obtained in recent years based on the state-region graph technique of Alur, Courcoubetis and Dill. However, these algorithms are faced with two potential types of explosion arising from parallel composition: explosion in t ..."
Abstract - Add to MetaCart
in the space of control nodes, and explosion in the region space over clockvariables. In this paper we attack these explosion problems by developing and combining compositional and symbolic model-checking techniques. The presented techniques provide the foundation for a new automatic verification tool Uppaal

Compositional and Symbolic Model-Checking of Real-Time Systems*

by unknown authors
"... Efficient automatic model-checking algorithms for real-time systems have been obtained in recent years based on the state-region graph technique of Alur, Courcoubetis and Dill. However, these algorithms are faced with two potential types of explosion arising from parallel composition: explosion in t ..."
Abstract - Add to MetaCart
in the space of control nodes, and explosion in the region space over clockvariables. In this paper we attack these explosion problems by developing and combining compositional and symbolic model-checking techniques. The presented techniques provide the foundation €or a new automatic verification tool UPPAAL

Symbolic Model Checking without BDDs

by Armin Biere , Alessandro Cimatti, Edmund Clarke, Yunshan Zhu , 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract - Cited by 917 (75 self) - Add to MetaCart
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis

Reachability Analysis of Pushdown Automata: Application to Model-Checking

by Ahmed Bouajjani, Javier Esparza, Oded Maler , 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finite-state automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract - Cited by 376 (38 self) - Add to MetaCart
model-checking for branching-time logics), we consider the more general class of alternating pushdown systems and use alternating finite-state automata as a representation structure for their sets of configurations. We give a simple and natural procedure to compute sets of predecessors

On the Decidability of Model-checking for P Systems

by ZHE DANG, Oscar H. Ibarra, Cheng Li, Gaoyan Xie - JOURNAL OF AUTOMATA, LANGUAGES AND COMBINATORICS
"... Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, namely a P system, from natural phenomena of cell evolutions and chemical reactions. Because of the nature of maximal para ..."
Abstract - Cited by 11 (1 self) - Add to MetaCart
what is decidable (or undecidable) about model-checking these systems under extended logic formalisms of CTL. We also report on some experiments on whether existing conservative (symbolic) model-checking techniques can be practically applied to handle P systems with a reasonable size.

Reflecting Symbolic Model Checking in Coq

by Kumar Neeraj Verma , 2000
"... We describe an implementation and a proof of correctness of a symbolic model checker for the -calculus using BDDs, completely formalized in the Coq proof assistant. This gives us a certified model checker which can run as a sub-system of Coq and provides a safe way of integrating symbolic model chec ..."
Abstract - Add to MetaCart
checking techniques inside the Coq proof assistant. Coq's extraction mechanism also gives us a certified model checker running in Caml.

Symbolic Model Checking: 10^20 States and Beyond

by J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, L. J. Hwang , 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract - Cited by 758 (41 self) - Add to MetaCart
of states. We describe a general method that represents the state space symbolical/y instead of explicitly. The generality of our method comes from using a dialect of the Mu-Calculus as the primary specification language. We describe a model checking algorithm for Mu-Calculus formulas that uses Bryant’s

Symbolic Model Checking for Real-time Systems

by Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine - INFORMATION AND COMPUTATION , 1992
"... We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an ..."
Abstract - Cited by 578 (50 self) - Add to MetaCart
We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given
Results 1 - 10 of 12,866