Results 1 - 10 of 23,522

Another Look at LTL Model Checking

by E. Clarke, O. Grumberg, K. Hamaguchi - FORMAL METHODS IN SYSTEM DESIGN , 1994
"... We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using this reduction, we also describe how to construct a symbolic LTL model checker that appears to be quite efficient in practice. In particular, we show how the SMV model checking system developed by Mc ..."
Abstract - Cited by 121 (11 self) - Add to MetaCart
We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using this reduction, we also describe how to construct a symbolic LTL model checker that appears to be quite efficient in practice. In particular, we show how the SMV model checking system developed

LTL Model Checking with Neco

by Łukasz Fronc, Re Duret-lutz
"... Abstract. We introduce neco-spot, an LTL model checker for Petri net models. It builds upon Neco, a compiler turning Petri nets into native shared libraries that allows fast on-the-fly exploration of the state-space, and upon Spot, a C++ library of model-checking algorithms. We show the architecture ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. We introduce neco-spot, an LTL model checker for Petri net models. It builds upon Neco, a compiler turning Petri nets into native shared libraries that allows fast on-the-fly exploration of the state-space, and upon Spot, a C++ library of model-checking algorithms. We show

Net Reductions for LTL Model-Checking

by Javier Esparza, Claus Schröter - Correct Hardware Design and Verification Methods (CHARME’01 , 2001
"... . We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on well-known Petri net techniques like invariants and implicit places, and (2) local net reductions. We show that the condi ..."
Abstract - Cited by 4 (1 self) - Add to MetaCart
. We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on well-known Petri net techniques like invariants and implicit places, and (2) local net reductions. We show

Semi-external LTL model checking

by Stefan Edelkamp, Peter S - In Computer-Aided Verification (CAV , 2008
"... Abstract. In this paper we establish c-bit semi-external graph algorithms, – i.e., algorithms which need only a constant number c of bits per vertex in the internal memory. In this setting, we obtain new trade-offs between time and space for I/O efficient LTL model checking. First, we design a c-bi ..."
Abstract - Cited by 4 (3 self) - Add to MetaCart
Abstract. In this paper we establish c-bit semi-external graph algorithms, – i.e., algorithms which need only a constant number c of bits per vertex in the internal memory. In this setting, we obtain new trade-offs between time and space for I/O efficient LTL model checking. First, we design a c

Distributed Memory LTL Model Checking

by unknown authors
"... Distribution and parallelization of model checking algorithms is receiving a growing interest as an additional technique to attack the state space explosion problem. In particular, networks of workstations are used to provide model checking algorithms with aggregate memory and computational power of ..."
Abstract - Add to MetaCart
of several interconnected computers. Thus they allow distributed memory algorithms to verify larger (hence more realistic) systems. The thesis focuses on the automata-based approach to the LTL model checking problem. This approach reduces the problem of LTL model checking to the problem of non-emptiness of a

Distributed Memory LTL Model Checking

by Of Informatics , 2004
"... Distribution and parallelization of model checking algorithms is receiving a growing interest as an additional technique to attack the state space explosion problem. In particular, networks of workstations are used to provide model checking algorithms with aggregate memory and computational power of ..."
Abstract - Add to MetaCart
of several interconnected computers. Thus they allow distributed memory algorithms to verify larger (hence more realistic) systems. The thesis focuses on the automata-based approach to the LTL model checking problem. This approach reduces the problem of LTL model checking to the problem of non-emptiness of a

Randomization Helps in LTL Model Checking

by Lubos Brim, Ivana Cerna, Martin Necesal , 2001
"... We present and analyze a new probabilistic method for automata based LTL model checking of non-probabilistic systems with intention to reduce memory requirements. The main idea of our approach is to use randomness to decide which of the needed information (visited states) should be stored during a c ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
We present and analyze a new probabilistic method for automata based LTL model checking of non-probabilistic systems with intention to reduce memory requirements. The main idea of our approach is to use randomness to decide which of the needed information (visited states) should be stored during a

Distributed ltl model-checking in spin

by Jiri Barnat, Lubos Brim , 2001
"... Abstract. In this paper we propose a distributed algorithm for modelchecking LTL. In particular, we explore the possibility of performing nested depth-first search algorithm in distributed SPIN. A distributed version of the algorithm is presented, and its complexity is discussed. 1 ..."
Abstract - Cited by 49 (12 self) - Add to MetaCart
Abstract. In this paper we propose a distributed algorithm for modelchecking LTL. In particular, we explore the possibility of performing nested depth-first search algorithm in distributed SPIN. A distributed version of the algorithm is presented, and its complexity is discussed. 1

LTL model checking for security protocols

by Alessandro Armando, Roberto Carbone, Luca Compagna - In 20th IEEE Computer Security Foundations Symposium (CSF20 , 2007
"... Most model checking techniques for security protocols make a number of simplifying assumptions on the protocol and/or on its execution environment that prevent their appli-cability in some important cases. For instance, most tech-niques assume that communication between honest princi-pals is control ..."
Abstract - Cited by 44 (7 self) - Add to MetaCart
Most model checking techniques for security protocols make a number of simplifying assumptions on the protocol and/or on its execution environment that prevent their appli-cability in some important cases. For instance, most tech-niques assume that communication between honest princi

Simple bounded LTL model checking

by Timo Latvala, Armin Biere, Keijo Heljanko, Tommi Junttila - IN: FMCAD. VOLUME 3312 OF LNCS , 2004
"... ..."
Abstract - Cited by 23 (6 self) - Add to MetaCart
Abstract not found
Results 1 - 10 of 23,522