Modular Verification of Petri Nets Properties: A Structure-Based Approach

  • Kais Klai
  • Serge Haddad
  • Jean-Michel Ilié
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3731)

Abstract

In this paper, we address the modular verification problem for a Petri net obtained by composition of two subnets. At first, we show how to transform an asynchronous composition into a synchronous one where the new subnets are augmented from the original ones by means of linear invariants. Then we introduce a non-constraining rela- tion between subnets based on their behaviour. Whenever this relation is satisfied, standard properties like the liveness and the boundedness and generic properties specified by a linear time logic may be checked by examination of the augmented subnets in isolation. Finally, we give a sufficient condition for this relation which can be detected modularly using an efficient algorithm.

Keywords

Abstraction modular verification (de)composition Petri nets 
Download to read the full conference paper text

References

  1. 1.
    Benalycherif, M.-L., Girault, C.: Behavioural and structural composition rules preserving liveness by synchronisation for colored FIFO nets. In: Billington, J., Reisig, W. (eds.) ICATPN 1996. LNCS, vol. 1091, pp. 73–92. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  2. 2.
    Christensen, S., Petrucci, L.: Modular analysis of petri nets. Computer Journal 43(3), 224–242 (2000)CrossRefMATHGoogle Scholar
  3. 3.
    Haddad, S., Ilié, J.-M., Klai, K.: An incremental verification technique using decomposition of petri net. In: Proc. of the IEEE SMC 2002 - Systems, Man and Cybernetics, Hammamet, Tunisia (2002)Google Scholar
  4. 4.
    Haddad, S., Ilié, J.-M., Klai, K.: Design and evaluation of a symbolic and abstraction-based model checker. In: Proc. of Automated Technology for Verification and Analysis: Second International Conference, ATVA 2004, Taipei, Taiwan, ROC, October 31-November 3 (2004)Google Scholar
  5. 5.
    Ilié, J.-M., Klai, K., Zouari, B.: A modular verification methodology for dnri petri nets. In: Proc. of the International Conference ACS/IEEE 2003 on Computer Systems and Applications (AICCSA-2003), Tunis, Tunisia, pp. 14–18 (2003)Google Scholar
  6. 6.
    Latvala, T., Mäkelä, M.: LTL model checking for modular petri nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 298–311. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Noord, V.: Treatment of epsilon moves in subset construction. In: Computational Linguistics, MIT Press for the Association for Computational Linguistics, vol. 26 (2000)Google Scholar
  8. 8.
    Santone, A.: Compositionality for Improving Model Checking. In: Proc. of FORTE 2000, in Proc. of Formal Methods for Distributed System Development (October 2000)Google Scholar
  9. 9.
    Sibertin-Blanc, C.: A client-server protocol for composition of Petri nets. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol. 691. Springer, Heidelberg (1993)Google Scholar
  10. 10.
    Souissi, Y., Memmi, G.: Compositions of nets via a communication medium. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol. 483, pp. 457–470. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  11. 11.
    Valmari, A.: Compositional state space generation. In: Proc. of ICATPN 1990, LNCS (May 1990)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2005

Authors and Affiliations

  • Kais Klai
    • 1
  • Serge Haddad
    • 2
  • Jean-Michel Ilié
    • 3
  1. 1.LaBRI CNRS UMR 5800Université de Bordeaux ITalenceFrance
  2. 2.LAMSADE CNRS UMR 7024Université de Paris DauphineFrance
  3. 3.LIP6 CNRS UMR 7606Université de Paris 6France

Personalised recommendations