Skip to main content

On proving large distributed systems: Petri net modules verification

  • Theory
  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1277))

Included in the following conference series:

Abstract

In this paper we present a formal basis for validating large distributed systems. Distributed systems are described by composition of coloured Petri-Net = modules. Compositional proof technique for such systems, where properties are = specified in terms of a linear time temporal logic, is proposed.

This research is supported by the Russian Fund for Basic Research (Project No. 96-01-01717) and INTAS-RFBR (grant 95-0378)

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anisimov, N., Kovalenko, A.: Asynchronous Composition of Petri Nets via Places. In: Perspectives of System Informatics (Proceedings of the Andrei Ershov Second International Memorial Conference). Novosibirsk (1996) 214–219.

    Google Scholar 

  2. Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley Publishing Company, 1988.

    Google Scholar 

  3. Cleaveland, R., Smolka, A. (Eds.): Strategic Directions in Computing Research. Concurrency Working Group Report. Bulletin EATCS, 60 (1996) 97–122.

    Google Scholar 

  4. Jensen,K.: Coloured Petri Nets. Vol.l. Eatcs Monographs on TCS, Springer-Verlag, 1994.

    Google Scholar 

  5. Liu,H., Park,J.-C., Miller, R.E.: On Hybrid Synthesis for Hierarchical Structured Petri Nets. Technical Report CS-TR-3628, University of Maryland, Colledge Park, = 1996.

    Google Scholar 

  6. Lomazova, I.: A Complete Axiomatics for Proving Safety Properties of Petri Nets. In: Perspectives of System Informatics (Proceedings of the Andrei Ershov Second International Memorial Conference). Novosibirsk (1996) 268–272.

    Google Scholar 

  7. Manna, Z., Pnueli A.: The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1992.

    Google Scholar 

  8. Reisig, W.: Petri Nets. Springer-Verlag, 1985.

    Google Scholar 

  9. Reisig, W.: Elements of Temporal Logic Coping with Concurrency. Technical Report TR 342/23/92, München: Technische Universität, Institut für Informatik, 1992.

    Google Scholar 

  10. Smith, E.: A Survey on High-Level Petri-Net Theory. Bulletin EATCS, 59 (1996) 267–293.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lomazova, I.A. (1997). On proving large distributed systems: Petri net modules verification. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1997. Lecture Notes in Computer Science, vol 1277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63371-5_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-63371-5_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63371-6

  • Online ISBN: 978-3-540-69525-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics