Partial-Order Reduction in the Weak Modal Mu-Calculus

@inproceedings{Ramakrishna1997PartialOrderRI,
  title={Partial-Order Reduction in the Weak Modal Mu-Calculus},
  author={Y. S. Ramakrishna and Scott A. Smolka},
  booktitle={CONCUR},
  year={1997}
}
We present a partial-order reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mu-calculus. We have implemented our technique in the Concurrency Factory specification and verification environment; experimental results show that partial-order reduction can be highly effective in combating state explosion in modal mu-calculus model checking. 

Partial Order Reduction for Reachability Games

TLDR
This work presents a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability/safety objectives and formally proves its correctness on the class of games played on general labelled transition systems.

Partial Order Reduction for Verification of Spatial Properties of Pi-Calculus Processes

Calculating-Confluence Compositionally

TLDR
This paper proposes a new on-the-fly algorithm to calculate partial τ-confluence, and proposes new techniques to do so on large systems in a compositional manner, and shows how this information inherent in the way a large system is composed of smaller systems is deduced in a computationally cheap manner.

Stubborn Set Reduction for Two-Player Reachability Games

TLDR
This work presents a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability objectives, and formally proves its correctness on the class of games played on general labelled transition systems.

Partial Order Reductions Preserving Simulations

The "state explosion problem" can be alleviated by using partial order reduction techniques. These methods rely on expanding only a fragment of the full state space of a program, which is suucient

Computation Tree Logic with Deadlock Detection

TLDR
An extension of CTL-X is proposed, or an alternative treatment of non-totality, that fills this hiatus and the equivalence induced is characterised as branching bisimulation equivalence with explicit divergence, which is shown to be the coarsest congruence contained in divergence sensitive branching bisiccation equivalence.

Improving Partial Order Reductions for Universal Branching Time Properties

TLDR
It is proved that reduction for concurrency fair version of ACTL−X* is more efficient than for ACTL+X*, and an improvement of the LTL−X reduction method is suggested.

Process Algebra and Model Checking

TLDR
This work surveys the area of process algebra and model checking, focusing on three process algebras such as CCS, CSP and ACP, and introduces the process-alebra-based model-checking tools FDR, CWB and XMC.

Characterising Probabilistic Processes Logically ( Extended

TLDR
It is shown that even without the fixpoint operators this probabilistic mu-calculus can be used to characterise these behavioural relations in the sense that two states are equivalent if and only if they satisfy the same set of formulae.

Partial Order Reductions Using Compositional Confluence Detection

TLDR
This paper proposes a new technique of partial order reductions based on compositional confluence detection ( Ccd), which can be combined with the techniques mentioned above and describes how Ccd -based reductions were implemented in the Cadp toolbox.

References

SHOWING 1-10 OF 30 REFERENCES

Using partial orders for the efficient verification of deadlock freedom and safety properties

This article presents an algorithm for detecting deadlocks in concurrent finite-state systems without incurring most of the state explosion due to the modeling of concurrency by interleaving. For

Efficient model checking via the equational /spl mu/-calculus

  • G. BhatR. Cleaveland
  • Computer Science
    Proceedings 11th Annual IEEE Symposium on Logic in Computer Science
  • 1996
TLDR
This paper shows how an expressive temporal logic, CTL*, may be efficiently translated into the modal /spl mu/-calculus, and how one may employ model-checking techniques to determine if systems satisfy formulas in CTL*.

Faster Model Checking for the Modal Mu-Calculus

TLDR
An algorithm for model checking that handles the full modal mucalculus including alternating fixpoints, which has a better worst-case complexity than the best known algorithm for this logic while performing just as well on certain sublogics as other specialized algorithms.

Combining partial order reductions with on-the-fly model-checking

  • D. Peled
  • Computer Science
    Formal Methods Syst. Des.
  • 1996
TLDR
An extension of the model-checker SPIN, which implements this combination, is studied, showing substantial reduction over traditional search, not only in the number of reachable states, but directly in the amount of memory and time used.

Partial-order methods for model checking: from linear time to branching time

TLDR
A general technique for lifting partial-order methods from linear-time to branching-time logics is introduced and is shown to be applicable both to reductions that are applied to the structure representing the program before running the model checking procedure, as well as to reduction that can be obtained when model checking is done in an automata-theoretic framework.

Local Model Checking in the Modal mu-Calculus

Efficient Graph-Based Algorithms For Model Checking In The Modal Mu-Calculus

TLDR
Several improvements over the basic model-checking algorithm are presented, including a global incremental algorithm, a local algorithm, as well as a realtime extension of the local algorithm.

Results on the Propositional µ-Calculus

TLDR
A propositional version of the Μ-calculus is defined, and an exponential-time decision procedure, small model property, and complete deductive system is given, and it is shown that it is strictly more expressive than PDL.

Three logics for branching bisimulation

  • R. NicolaF. Vaandrager
  • Philosophy
    [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
  • 1990
Three temporal logics are introduced which induce on labeled transition systems the same identifications as branching bisimulation. The first is an extension of Hennessy-Milner logic with a kind of

Results on the Propositional mu-Calculus

  • D. Kozen
  • Mathematics
    Theor. Comput. Sci.
  • 1983