Results 1  10
of
23,522
Another Look at LTL Model Checking
 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
"... Abstract. We introduce necospot, an LTL model checker for Petri net models. It builds upon Neco, a compiler turning Petri nets into native shared libraries that allows fast onthefly exploration of the statespace, and upon Spot, a C++ library of modelchecking algorithms. We show the architecture ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We introduce necospot, an LTL model checker for Petri net models. It builds upon Neco, a compiler turning Petri nets into native shared libraries that allows fast onthefly exploration of the statespace, and upon Spot, a C++ library of modelchecking algorithms. We show
Net Reductions for LTL ModelChecking
 Correct Hardware Design and Verification Methods (CHARME’01
, 2001
"... . We present a set of reduction rules for LTL modelchecking of 1safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wellknown 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 modelchecking of 1safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wellknown Petri net techniques like invariants and implicit places, and (2) local net reductions. We show
Semiexternal LTL model checking
 In ComputerAided Verification (CAV
, 2008
"... Abstract. In this paper we establish cbit semiexternal 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 tradeoffs between time and space for I/O efficient LTL model checking. First, we design a cbi ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract. In this paper we establish cbit semiexternal 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 tradeoffs between time and space for I/O efficient LTL model checking. First, we design a c
Distributed Memory LTL Model Checking
"... 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 automatabased approach to the LTL model checking problem. This approach reduces the problem of LTL model checking to the problem of nonemptiness of a
Distributed Memory LTL Model Checking
, 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 automatabased approach to the LTL model checking problem. This approach reduces the problem of LTL model checking to the problem of nonemptiness of a
Randomization Helps in LTL Model Checking
, 2001
"... We present and analyze a new probabilistic method for automata based LTL model checking of nonprobabilistic 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 nonprobabilistic 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 modelchecking in spin
, 2001
"... Abstract. In this paper we propose a distributed algorithm for modelchecking LTL. In particular, we explore the possibility of performing nested depthfirst 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 depthfirst 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
 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 applicability in some important cases. For instance, most techniques assume that communication between honest principals 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 applicability in some important cases. For instance, most techniques assume that communication between honest princi
Results 1  10
of
23,522