Results 1  10
of
23
Distributed Explicit Fair Cycle Detection (Set Based Approach)
"... The fair cycle detectiou problem is at the heart of both LTL and fair CTL model checking. This paper preseuts a new distributed scalable algorithm for explicit fair cycle detection. Our method combines the simplicity of the distributiou of explicitly preseuted data structure and the features of ..."
Abstract

Cited by 41 (12 self)
 Add to MetaCart
The fair cycle detectiou problem is at the heart of both LTL and fair CTL model checking. This paper preseuts a new distributed scalable algorithm for explicit fair cycle detection. Our method combines the simplicity of the distributiou of explicitly preseuted data structure and the features of symbolic algorithm allowing for an efficient parallelisa tion. If a fair cycle (i.e. couuterexample) is detected, theu the algorithm produces a cycle, which is in general shorter than that produced by depthfirst search based algorithms, Experimental results confirm that our approach outperforms that based ou a direct implementation of the best sequential algorithm.
Local Parallel Model Checking for the AlternationFree µCalculus
 In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN
, 2002
"... We describe the design of (several variants of) a local parallel modelchecking algorithm for the alternationfree fragment of the µcalculus. It exploits a characterisation of the problem for this fragment in terms of twoplayer games. For the corresponding winner, our algorithm determines in paral ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
We describe the design of (several variants of) a local parallel modelchecking algorithm for the alternationfree fragment of the µcalculus. It exploits a characterisation of the problem for this fragment in terms of twoplayer games. For the corresponding winner, our algorithm determines in parallel a winning strategy, which may be employed for debugging the underlying system interactively, and is designed to run on a network of workstations. Depending on the variant, its complexity is linear or quadratic. A prototype implementation within the verification tool Truth shows promising results in practice.
Development of a verified Erlang program for resource locking
 Formal Methods in Industrial Critical Systems
, 2001
"... We have designed a tool to simplify model checking of Erlang programs by translating Erlang into a process algebra with data, called µCRL. As a casestudy for this tool we focused on a simplied locker implementation after the locker that is present in the control software of the AXD 301 switch. The ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
We have designed a tool to simplify model checking of Erlang programs by translating Erlang into a process algebra with data, called µCRL. As a casestudy for this tool we focused on a simplied locker implementation after the locker that is present in the control software of the AXD 301 switch. The translation algorithm has been developed to handle this productionlike code. We use the tools accompanying CRL to generate the transition systems from the specification generated by our tool. With the Caesar/Aldebaran tool set, we verified properties for our casestudy.
Simˇsa, J.: How to Order Vertices for Distributed LTL ModelChecking Based on Accepting Predecessors
 In: Proceedings of the 4th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC 2005
, 2005
"... Distributed automatabased LTL modelchecking relies on algorithms for finding accepting cycles in a Büchi automaton. The approach to distributed accepting cycle detection as presented in [9] is based on maximal accepting predecessors. The ordering of accepting states (hence the maximality) is one o ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Distributed automatabased LTL modelchecking relies on algorithms for finding accepting cycles in a Büchi automaton. The approach to distributed accepting cycle detection as presented in [9] is based on maximal accepting predecessors. The ordering of accepting states (hence the maximality) is one of the main factors affecting the overall complexity of modelchecking as an imperfect ordering can enforce numerous reexplorations of the automaton. This paper addresses the problem of finding an optimal ordering, proves its hardness, and gives several heuristics for finding an optimal ordering in the distributed environment. We compare the heuristics both theoretically and experimentally to find out which of these work well. Key words: LTLmodel checking, Büchi automata, optimal ordering 1
Simˇsa, Distributed Partial Order Reduction of State Spaces
 Electronic Notes in Theoretical Computer Science (PDMC 2004) 128 (3) (2005) 63 – 74
"... State space explosion is a fundamental obstacle in formal verification of concurrent systems. Several techniques for combating this problem have emerged in the past few years, among which the two we are interested in are: partial order reduction and distributed memory state exploration. While the fi ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
State space explosion is a fundamental obstacle in formal verification of concurrent systems. Several techniques for combating this problem have emerged in the past few years, among which the two we are interested in are: partial order reduction and distributed memory state exploration. While the first one tries to reduce the problem to a smaller one, the other one tries to extend the computational power to solve the same problem. In this paper, we consider a combination of these two approaches and propose a distributed memory algorithm for partial order reduction. Keywords: Distributed modelchecking, partial order reduction, LTL modelchecking
Distributed onthefly model checking and test case generation
 In Proc. of SPIN’06, LNCS
, 2006
"... Abstract. The explicitstate analysis of concurrent systems must handle large state spaces, which correspond to realistic systems containing many parallel processes and complex data structures. In this paper, we combine the onthefly approach (incremental construction of the state space) and the di ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
Abstract. The explicitstate analysis of concurrent systems must handle large state spaces, which correspond to realistic systems containing many parallel processes and complex data structures. In this paper, we combine the onthefly approach (incremental construction of the state space) and the distributed approach (state space exploration using several machines connected by a network) in order to increase the computing power of analysis tools. To achieve this, we propose MbDSolve, a new algorithm for distributed onthefly resolution of multiple block, alternationfree boolean equation systems (Bess). First, we apply MbDSolve to perform distributed onthefly model checking of alternationfree modal µcalculus, using the standard encoding of the problem as a Bes resolution. The speedup and memory consumption obtained on large state spaces improve over previously published approaches based on game graphs. Next, we propose an encoding of the conformance test case generation problem as a Bes resolution from which a diagnostic representing the complete test graph (Ctg) is built. By applying MbDSolve, we obtain a distributed onthefly test case generator whose capabilities scale up smoothly w.r.t. wellestablished existing sequential tools. 1
Distributed Local Resolution of Boolean Equation Systems
 In Proc. of PDP’05. Ieee Computer
, 2005
"... Boolean Equation Systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several sequential algorithms for global and local BES resolution have been proposed so far, mainly in the field of verification; how ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Boolean Equation Systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several sequential algorithms for global and local BES resolution have been proposed so far, mainly in the field of verification; however, these algorithms do not scale up satisfactorily as the size of BESs increases. In this paper, we propose a distributed algorithm, called DSOLVE, which performs the local resolution of a BES using a set of machines connected by a network. Our experiments for solving large BESs using clusters of PCs show linear speedups and a scalable behaviour of DSOLVE w.r.t. its sequential counterpart. 1.
From distribution memory cycle detection to parallel model checking
 Electronic Notes in Theoretical Computer Science
, 2002
"... In [2] we proposed a parallel graph algorithm for detecting cycles in very large directed graphs distributed over a network of workstations. The algorithm employs backlevel edges as computed by the breadth first search. In this paper we describe how to turn the algorithm into an explicit state dist ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
In [2] we proposed a parallel graph algorithm for detecting cycles in very large directed graphs distributed over a network of workstations. The algorithm employs backlevel edges as computed by the breadth first search. In this paper we describe how to turn the algorithm into an explicit state distributed memory LTL model checker by extending it with detection of accepting cycles, counterexample generation and partial order reduction. We discuss these extensions and show experimental results.
Truth/SLC  A Parallel Verification Platform for Concurrent Systems
, 2001
"... Concurrent software and hardware systems play an increasing rôle in today's applications. Due to the large number of states and to the high degree of nondeterminism arising from the dynamic behavior of such systems, testing is generally not sucient to ensure the correctness of their implementation. ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Concurrent software and hardware systems play an increasing rôle in today's applications. Due to the large number of states and to the high degree of nondeterminism arising from the dynamic behavior of such systems, testing is generally not sucient to ensure the correctness of their implementation. Formal specification and verification methods are therefore becoming more and more popular, aiming to give rigorous support for the system design and for establishing its correctness properties, respectively (cf. [2] for an overview). In view of the inherent complexity of formal methods it is desirable to provide the user with tool support. It is even indispensable for the design of safetycritical concurrent systems where an ad hoc or conventional software engineering approach is not justifiable. There is one particularly successful automated approach to verification, called model checking, in which one tries to prove that (a model of) a system has certain properties spec...
Issues in Distributed Timed Model Checking  Building Zeus
 SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER
"... In this work we present Zeus, a Distributed Timed Model Checker that evolves from the TCTL Model Checker Kronos [13] and that currently can handle backwards computation of reachability properties [2] over timed automata [3]. Zeus was developed following a software architecture centric approach. Its ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this work we present Zeus, a Distributed Timed Model Checker that evolves from the TCTL Model Checker Kronos [13] and that currently can handle backwards computation of reachability properties [2] over timed automata [3]. Zeus was developed following a software architecture centric approach. Its conceptual architecture was conceived to be sufficiently modular to house several features such as a priori graph partitioning, synchronous and asynchronous computation, communication piggybacking, delayed messaging and deadtime utilization. Surprisingly enough, early experiments pinpointed the difficulties of getting speedups using asynchronous versions and showed interesting results on the synchronous counterpart, although being intuitively less attractive.