Covering step graph

  • François Vernadat
  • Pierre Azéma
  • François Michel
Full Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1091)

Abstract

Within the framework of concurrent systems, several verification approaches require as a preliminary step the complete derivation of the state space. Partial-order methods are efficient for reducing the state explosion due to the representation of parallelism by interleaving. The covering step graphs are introduced as an alternative to labelled transition systems. A transition step consists of several possibly concurrent events. In a covering step graph, steps of independent transitions are substituted as much as possible to the subgraph which would result from the firing of the independent transitions. Attention must be paid to the case of conflict and confusion. An algorithm for the “on the fly” derivation of step graphs is proposed. This algorithm is then extended to behaviour analysis by means of observational equivalence. A performance evaluation is made with respect to other methods.

Keywords

concurrent systems state space exploration partial-order verification methods 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [FM 90]
    J. Fernandez, L. Mounier Verifying Bisimulation on the Fly 3 rd. Int. Conf on Formal Description Techniques, Madrid, 1990Google Scholar
  2. [GW 91]
    P. Godefroid, P. Wolper Using Partial Orders for efficient verification of deadlock freedom and safety properties In Computer Aided Verification, 1991, LNCS 575Google Scholar
  3. [GP 93]
    P. Godefroid, D. Pirotin Refining Dependencies Improves Partial-Order verification methods In Computer Aided Verification. 1993, LNCS 697Google Scholar
  4. [Esp 93]
    J. Esparza Model Checking using net unfoldings In TAPSOFT'93, 1993. LNCS 668Google Scholar
  5. [HM 85]
    M. Hennessy, R. Milner Algebraic Laws for Nondeterminism and Concurrency Journal of the A.C.M Volume 32 1985Google Scholar
  6. [Jen 87]
    K. Jensen Coloured Petri Nets. In Brauer, W., Reisig, W. & Rozenberg, G. (Ed.): Petri Nets: Central Models and their Properties. Advances in Petri Nets LNCS 254Google Scholar
  7. [PF 90]
    D. H. Pitt, D. Freestone The derivation of conformance tests from lotos specifications IEEE Transactions on Software Engineering, 16(12), 1990Google Scholar
  8. [McMil 95]
    K. L. McMillan Trace theoretic verification of asynchronous circuits using unfoldings In Computer Aided Verification, 1995, LNCS 939Google Scholar
  9. [Maz 87]
    A. Mazurkiewicz Trace Theory In “Petri Nets: Applications and Relationship to other models of concurrency” LNCS 255Google Scholar
  10. [Mil 85]
    R. Milner Communication and Concurrency Prentice Hall.Google Scholar
  11. [Rei 85]
    W. Reisig Petri Nets: an Introduction EATCS, Monographs on Theoretical Computer Science, Springer Verlag, 1985Google Scholar
  12. [Val 89]
    A. Valmari Stubborn Sets for reduced state space generation 10 th Int. Conf on Application and Theory of Petri Nets, Bonn, 1989, LNCS 483Google Scholar
  13. [WG 93]
    P. Wolper, P. Godefroid Partial Order Methods for Temporal Verification Proceedings of CONCUR'93, LNCS 715Google Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • François Vernadat
    • 1
  • Pierre Azéma
    • 1
  • François Michel
    • 1
  1. 1.LAAS-CNRSToulouse cedexFrance

Personalised recommendations