AbstractWe present UppDMC, a distributed model-checking tool. It is tailored for checking finite-state systems and μ-calculus specifications with at most one alternation of minimal and maximal fixed-point operators. This fragment is also known as Lμ2. Recently, efficient game-based algorithms for this logic have been outlined.We describe the implementation of these algorithms within UppDMC and study their performance on practical examples. Running UppDMC on a simple workstation cluster, we were able to check liveness properties of the largest examples given in the VLTS Benchmark Suite, for which no answers were previously known
Model checking is a successful method for checking properties on the state space of concurrent, reac...
AbstractWe describe a parallel algorithm for solving parity games, with applications in, e.g., modal...
AbstractModel checking suffers from the state explosion problem, due to the exponential increase in ...
AbstractWe present UppDMC, a distributed model-checking tool. It is tailored for checking finite-sta...
AbstractWe describe a parallel model-checking algorithm for the fragment of the μ-calculus that allo...
AbstractIn this work we extend the approach used in [6] to perform distributed-memory AFMC model che...
In this thesis we investigate how the known framework of automatic formal verification by model chec...
Model checking is an automated verification procedure, which checks that a model of a system satisfi...
AbstractModel checking procedures have already proved useful for system verification. They are succe...
Model checking is a successful method for checking properties on the state space of concurrent, reac...
The model checking problem for open systems has been intensively studied in the literature, for both...
AbstractIn this paper we present algorithms for model checking CTL over systems specified as Petri n...
The model checking problem for open systems has been intensively studied in the literature, for both...
The explicit-state analysis of concurrent systems must handle large state spaces, which correspond t...
The propositionalμ-calculus can be divided into two categories, global model checking algorithm and ...
Model checking is a successful method for checking properties on the state space of concurrent, reac...
AbstractWe describe a parallel algorithm for solving parity games, with applications in, e.g., modal...
AbstractModel checking suffers from the state explosion problem, due to the exponential increase in ...
AbstractWe present UppDMC, a distributed model-checking tool. It is tailored for checking finite-sta...
AbstractWe describe a parallel model-checking algorithm for the fragment of the μ-calculus that allo...
AbstractIn this work we extend the approach used in [6] to perform distributed-memory AFMC model che...
In this thesis we investigate how the known framework of automatic formal verification by model chec...
Model checking is an automated verification procedure, which checks that a model of a system satisfi...
AbstractModel checking procedures have already proved useful for system verification. They are succe...
Model checking is a successful method for checking properties on the state space of concurrent, reac...
The model checking problem for open systems has been intensively studied in the literature, for both...
AbstractIn this paper we present algorithms for model checking CTL over systems specified as Petri n...
The model checking problem for open systems has been intensively studied in the literature, for both...
The explicit-state analysis of concurrent systems must handle large state spaces, which correspond t...
The propositionalμ-calculus can be divided into two categories, global model checking algorithm and ...
Model checking is a successful method for checking properties on the state space of concurrent, reac...
AbstractWe describe a parallel algorithm for solving parity games, with applications in, e.g., modal...
AbstractModel checking suffers from the state explosion problem, due to the exponential increase in ...