Properties of object petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3099, Issue , 2004, Pages 278-297

  Köhler, Michael ^a   Rölke, Heiko ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Decidability; Nets within nets; Object petri nets

Indexed keywords

COMPUTABILITY AND DECIDABILITY; TURING MACHINES;

BOUNDEDNESS; ELEMENTARY OBJECTS; NET SYSTEMS; NETS-WITHIN-NETS; OBJECT PETRI NETS; PETRI NET MODELS; REACHABILITY;

PETRI NETS;

EID: 35048835857     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27793-4_16     Document Type: Article

References (20)

1. A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. Theoretical Computer Science, 236:35-132, 2000.
2. L. Cardelli, A. D. Gordon, and G. Ghelli. Mobility types for mobile ambients. In Automata, Languages, and Programming (ICALP'99), volume 1644 of LNCS, pages 230-239. Springer-Verlag, 1999.
3. G. Ciardo. Petri nets with marking-dependent arc cardinality: properties and analysis. In R. Valette, editor, Application and Theory of Petri Nets, volume 815 of LNCS, pages 179-199. Springer-Verlag, 1994.
4. C. Dufourd, A. Finkel, and P. Schnoebelen. Reset nets between decidability and undecidability. In K. Larsen, editor, Automata, Languages, and Programming (ICALP'98), volume 1443 of LNCS, pages 103-115. Springer-Verlag, 1998.
5. B. Farwer. A linear logic view of object Petri nets. Fundamenta Informaticae, 37(3):225-246, 1999.
6. A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
7. R. M. Karp and R. E. Miller. Parallel program schemata. Journal of Computer and System Sciences, 3(2):147-195, May 1969.
8. M. Köhler and B. Farwer. Mobile object-net systems and their processes. Fundamenta Informaticae, 59:1-17, 2004.
9. M. Köhler, D. Moldt, and H. Rölke. Modelling mobility and mobile agents using nets within nets. In W. v. d. Aalst and E. Best, editors, Application and Theory of Petri Nets 2003, volume 2679 of LNCS, pages 121-140. Springer-Verlag, 2003.
10. M. Köhler and H. Rölke. Concurrency for mobile object-net systems. Fundamenta Informaticae, 54(2-3), 2003.
11. O. Kummer. Undecidability in object-oriented Petri nets. Petri Net Newsletter, 59:18-23, 2000.
12. O. Kummer. Referenznetze. Logos Verlag, 2002.
13. I. A. Lomazova and P. Schnoebelen. Some decidability results for nested Petri nets. In Perspectives of System Informatics (PSI'99), volume 1755 of LNCS, pages 208-220. Springer-Verlag, 2000.
14. E. W. Mayr. An algorithm for the general Petri net reachability problem. In 13th Annual ACM Symposium on Theory of Computing, pages 238-246, 1981.
15. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96:73-155, 1992.
16. J. Meseguer, U. Montanari. Petri nets are monoids, Information and Computation, 88(2), 105-155, 1990.
17. W. Reisig. Petri nets and algebraic specifications. Theoretical Computer Science, 80:1-34, 1991.
18. M.-O. Stehr, J. Meseguer, and P. C. Ölveczky. Rewriting logic as a unifying framework for Petri nets. In H. Ehrig, G. Juhas, J. Padberg, and G. Rozenberg, editors, Unifying Petri Nets, LNCS. Springer-Verlag, December 2001.
19. R. Valk. Self-modifying nets, a natural extension of Petri nets. In Ausiello, G. and Böhm, C., editors, Automata, Languages and Programming, volume 62 of LNCS, pages 464-476. Springer-Verlag, 1978.
20. R. Valk. Petri nets as token objects: An introduction to elementary object nets. In J. Desel and M. Silva, editors, Application and Theory of Petri Nets, volume 1420 of LNCS, pages 1-25, 1998.