Covering step graph

  • François Vernadat
  • Pierre Azéma
  • François Michel
Full Papers

DOI: 10.1007/3-540-61363-3_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1091)
Cite this paper as:
Vernadat F., Azéma P., Michel F. (1996) Covering step graph. In: Billington J., Reisig W. (eds) Application and Theory of Petri Nets 1996. ICATPN 1996. Lecture Notes in Computer Science, vol 1091. Springer, Berlin, Heidelberg

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.

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