Skip to main content
Springer Nature Link
Log in

Syntactical Colored Petri Nets Reductions

  • Conference paper
Automated Technology for Verification and Analysis (ATVA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3707))

Abstract

In this paper, we develop a syntactical version of elaborated reductions for high-level Petri nets. These reductions simplify the model by merging some sequential transitions into an atomic one. Their conditions combine local structural ones (e.g. related to the actions of a thread) and global algebraic ones (e.g. related to the threads synchronization). We show that these conditions are performed in a syntactical way, when a syntax of the color mappings is given. We show also how our method outperforms previous ones on a recent case study with regard both to the reduction ratio and the automatization of their application.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Berthelot, G.: Checking properties of nets using transformations. In: Rozenberg, G. (ed.) APN 1985. LNCS, vol. 222. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  2. Berthelot, G., Roucairol, G., Valk, R.: Reduction of nets and parallel programs. In: Brauer, W. (ed.) Net Theory and Applications. LNCS, vol. 84, pp. 277–290. Springer, Heidelberg (1980)

    Google Scholar 

  3. Cohen, E., Lamport, L.: Reduction in TLA. In: International Conference on Concurrency Theory, pp. 317–331 (1998)

    Google Scholar 

  4. Evangelista, S., Haddad, S., Pradat-Peyre, J.F.: Colored Petri nets reductions for concurrent software validation. Technical report, CEDRIC, CNAM, Paris (2004)

    Google Scholar 

  5. Evangelista, S., Kaiser, C., Pradat-Peyre, J.F., Rousseau, P.: Quasar: a new tool for analysing concurrent programs. In: Rosen, J.-P., Strohmeier, A. (eds.) Ada-Europe 2003. LNCS, vol. 2655, pp. 168–181. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Esparza, J., Schröter, C.: Net Reductions for LTL Model-Checking. In: Margaria, T., Melham, T.F. (eds.) CHARME 2001. LNCS, vol. 2144, pp. 310–324. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Evangelista, S.: Syntactical rules for colored Petri nets manipulation. Technical Report 641, CEDRIC, CNAM, Paris (2004)

    Google Scholar 

  8. Flanagan, C., Qadeer, S.: Transactions for software model checking. In: Cook, B., Stoller, S., Visser, W. (eds.) Electronic Notes in Theoretical Computer Science, vol. 89. Elsevier, Amsterdam (2003)

    Google Scholar 

  9. Flanagan, C., Qadeer, S.: A type and effect system for atomicity. In: Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation, pp. 338–349. ACM Press, New York (2003)

    Chapter  Google Scholar 

  10. Godefroid, P., Wolper, P.: Using partial orders for the efficient verification of deadlock freedom and safety properties. Form. Methods Syst. 2(2), 149–164 (1993)

    Article  MATH  Google Scholar 

  11. Haddad, S.: A reduction theory for colored nets. In: Jensen, Rozenberg, G. (eds.) APN 1989. LNCS, vol. 424, pp. 399–425. Springer, Heidelberg (1990)

    Google Scholar 

  12. Haddad, S., Pradat-Peyre, J.F.: Efficient reductions for LTL formulae verification. Technical report, CEDRIC, CNAM, Paris (2004)

    Google Scholar 

  13. Lipton, R.J.: Reduction: a method of proving properties of parallel programs. Commun. ACM 18(12), 717–721 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  14. Poitrenaud, D., Pradat-Peyre, J.F.: Pre and post-agglomerations for \(\mathit{LTL}\) model checking. In: Nielsen, M., Simpson, D. (eds.) High-level Petri Nets, Theory and Application. LNCS, vol. 1825, pp. 387–408. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Stoller, S.D., Cohen, E.: Optimistic synchronization-based state-space reduction. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 489–504. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Schnoebelen, P., Sidorova, N.: Bisimulation and the reduction of petri nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 409–423. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  17. Valmari, A.: On-the-fly verification with stubborn sets. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 397–408. Springer, Heidelberg (1993)

    Google Scholar 

  18. Vernadat, F., Michel, F.: Covering step graph preserving failure semantics. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 253–270. Springer, Heidelberg (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CEDRIC – CNAM Paris, 292, rue St Martin, 75003, Paris

    S. Evangelista & J. -F. Pradat-Peyre

  2. LAMSADE-CNRS UMR 7024, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Cedex 16, Paris

    S. Haddad

Authors
  1. S. Evangelista
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Haddad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. -F. Pradat-Peyre
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Bar Ilan University, 52900, Ramat Gan, Israel

    Doron A. Peled

  2. Department of Information Management, National Taiwan University, Taiwan

    Yih-Kuen Tsay

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Evangelista, S., Haddad, S., Pradat-Peyre, J.F. (2005). Syntactical Colored Petri Nets Reductions. In: Peled, D.A., Tsay, YK. (eds) Automated Technology for Verification and Analysis. ATVA 2005. Lecture Notes in Computer Science, vol 3707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562948_17

Download citation

  • DOI: https://doi.org/10.1007/11562948_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29209-8

  • Online ISBN: 978-3-540-31969-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation