A New Synchronisation Model for Multi-Level Object Petri Nets

• Autorzy: Farwer B. , Kudlek M.
• Języki publikacji: EN

Abstrakty

EN

The present paper continues work from [7]. One goal of this work is to find a class of (object) Petri nets of lesser power than Turing machines, such that there exists a universal Petri net within that class. Another goal is to surpass the restricted synchronisation of transitions in object and system nets in the case of value semantics. Finally, an encoding of the proposed class of object Petri nets into linear logic Petri nets (LLPNs) is given, which directly leads to a specification that can be model-checked by existing tools.

Słowa kluczowe

EN

universal Petri net; universal machine; object Petri-net; higher-order Petri net; synchronization; value semantics

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2004
• Tom: Vol. 60, nr 1-4
• Strony: 131--142
• Opis fizyczny: Bibliogr. 15 poz., wykr.

Twórcy

autor

Farwer B.

• University of Hamburg, Department of Computer Science, Vogt-Kölln-Str. 30 D-22527 Hamburg, Germany

autor

Kudlek M.

• University of Hamburg, Department of Computer Science, Vogt-Kölln-Str. 30 D-22527 Hamburg, Germany

Bibliografia

• [1] Brown. C.: Relating Petri Nets to Formulae of Linear Logic, Technical report. Department of Computer Science. University of Edinburgh. 1989.
• [2] Engberg. U., Winskel, G.: Petri Nets as Models for Linear Logic, Technical report. Computer Science Department, Aarhus University, 1990.
• [3] Farwer. B.: Linear Logic Based Calculi for Object Petri Nets. Ph.D. Thesis, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln-Str. 30, D-22527 Hamburg, 1999.
• [4] Farwer. B.: A Linear Logic View of Object Petri Nets, Fundamenta Informaticae, 37(3), 1999, 225-246.
• [5] Farwer. B.: Linear Logic Based Calculi for Object Petri Nets, Logos Verlag, ISBN 3-89722-539-5, Berlin, 2000.
• [6] Farwer. B.: Relating Formalisms for Non-Object-Oriented Object Petri Nets, Concurrency, Specification, and Programming (CSP'2000). Proceedings. Volume I (P. S. L. Czaja, Ed.). Humboldt-Universität. Berlin. 2000.
• [71 Farwer. В., Kudlek. M., Misra. K.: Some Considerations on Higher Order Petri Nets, Fundamenta Informaticae. 54(2-3). 2003. 185-193.
• [8] Farwer, B., Leuschel, M.: Mode! Checking Object Petri Nets in Prolog, Technical Report DSSE-TR-2003-4, Declarative Systems and Software Engineering Group, School of Electronics and Computer Science. University of Southampton, SO17 1BJ. UK, 2003.
• [9] Kudlek. M.: On Universal Finite Automata and a-Transducers, in: Grammars and Automata for String Processing : From Mathematics and Computer Science to Biology and Back (C. M. Vide, V. Mitrana, Eds.), vol. 9 of Topics in Computer Mathematics, Taylor and Francis. London, 2003, 163-170.
• [10] Kudlek. M., Margenstern. M.: Universal Turing Machines with Complexity Constraints, Proceedings of the International Conference ‘Automata and Formal Languages VIII’, Publ. Math. Debrecen 53, 1999.
• [11] Kummer, О.: Undecidability in Object-Oriented Petri Nets, Petri Net Newsletter. (59), 2000, 18-23.
• [12] Kummer. О.: Referenznetze, Logos Verlag, 2002.
• [13] Martí-Oliet. N., Meseguer, J.: From Petri Nets to Linear Logic, Technical report. SRI International, Computer Science Laboratory, Stanford, 1989.
• [14] Meseguer. J.: Conditional Rewriting Logic as a Unified Model of Concurrency, Theoretical Computer Science, 96, 1992,73-155.
• [15] Meseguer. J.: A Logical Theory of Concurrent Objects and its Realization in the Maude Language. Research Directions in Concurrent Object-Oriented Programming (G. Aga, P. Wegner. A. Yonezawa. Eds.). MIT Press, 1993.