Petri nets and resource bisimulation

• Autorzy: Bashkin V.A. , Lomazova I.A.
• Języki publikacji: EN

Abstrakty

EN

Resources are defined as submultisets of Petri net markings. Two resources are called similar if replacing one of them by another in any marking doesn't change the Petri net's behavior. We define the relations of resource similarity and resource bisimulation and show that they are finitely based. In this paper the resource bisimulation is studied for different classes of Petri nets: ordinary Petri nets, high-level Petri nets and nested Petri nets - Petri nets with Petri nets as tokens.

Słowa kluczowe

EN

Petri net; resource similarity; bisimulation equivalence; high-level Petri nets; nested Petri nets

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2003
• Tom: Vol. 55, nr 2
• Strony: 101--114
• Opis fizyczny: bibliogr. 13 poz.

Twórcy

autor

Bashkin V.A.

autor

Lomazova I.A.

• Yaroslavl State University Yaroslavl, 152000, Russia,

Bibliografia

• [AS92] C. Autant and Ph. Schnoebelen. Place bisimulations in Petri nets. In Proc. 13th Int. Conf. Application and Theory of Petri Nets, Sheffield, UK, 1992, volume 616 of Lecture Notes in Computer Science, pages 45-61. Springer, 1992.
• [BL2000] V. A. Bashkin and I. A. Lomazova. Reduction of Coloured Petri nets based on resource bisimulation. Joint Bulletin of NCC IIS (Comp. Science), Vol. 13, pages 12-17. Novosibirsk, Russia, 2000.
• [FL2002] B. Farwer and I. Lomazova. A systematic approach towards object-based Petri net formalisms. In Proc. Int. Andrey Ershov memorial Conf. Perspectives of System Informatics, PSI 2001, volume 2244 of Lecture Notes in Computer Science, pages 255-267. Springer, 2002.
• [Hirsh94] Hirshfeld Y. Congruences in commutative semigroups Research report ECS-LFCS-94-291, Department of Computer Science, University of Edinburgh, 1994.
• [Jan93] P. Jan ar. Decidability questions for bisimilarity of Petri nets and some related problems In Proc. STACS’94, volume 775 of Lecture Notes in Computer Science, pages 581-592. Springer, 1993.
• [L2000] I. A. Lomazova. Nested Petri nets — a Formalism for Specification and Verification of Multi-Agent Distributed Systems. Fundamenta Informaticae, 43(1–4); 195-214, 2000.
• [L2001] I. A. Lomazova. Nested Petri nets: multi level and recursive systems. Fundamenta Informaticae, 47(3–4); 283-293, 2001.
• [L2002] I. A. Lomazova. Object-oriented Petri nets: formal semantics and analisys. System Informatics, Vol. 8. Novosibirsk, 2002. (To be published, in Russian.)
• [Mil80] R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science, Vol. 92. Springer, 1980.
• [Red65] Redei L. The theory of finitely generated commutative semigroups. Oxford University Press, New York, 1965.
• [SS2000] Ph. Shnoebelen and N. Sidorova. Bisimulation and the reduction of Petri nets. In Proc. 21st Int. Conf. Application and Theory of Petri Nets, Aarhus, Denmark, 2000, volume 1825 of Lecture Notes in Computer Science, pages 409-423. Springer, 2000.
• [Sid98] N. Sidorova. Petri Nets transformations. PhD theses, Yaroslavl State University, Yaroslavl, Russia, 1998. In Russian.
• [Smith98] E. Smith Principles of high-level net theory. Lectures on Petri nets. In Lectures on Petri nets I: Basic models. Advances in Petri nets, volume 1491 of Lecture Notes in Computer Science, pages 174-210. Springer, 1998.