High-level Petri nets as type theories in the join calculus

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

Volumn 2030, Issue , 2001, Pages 104-120

  Buscemi, Maria Grazia ^a   Sassone, Vladimiro ^a  

^a UNIVERSITY OF CATANIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DYNAMIC MODELS; EQUIVALENCE CLASSES; FORMAL LANGUAGES; PETRI NETS;

COLOURED PETRI NETS; DYNAMIC RE-CONFIGURATION; HIGH-LEVEL PETRI NETS; JOIN CALCULUS; PROCESS CREATION; RECONFIGURABLE; TYPE SYSTEMS; TYPE THEORY;

COMPUTATION THEORY;

EID: 33750983446     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45315-6_7     Document Type: Conference Paper

References (18)

1. A. Asperti and N. Busi (1996), Mobile Petri Nets, Technical Report UBLCS 96- 10, Università di Bologna.
2. G. Berry and G. Boudol (1992), The Chemical Abstract Machine, Theoretical Computer Science, 96:217-248.
3. M. Boreale, C. Fournet, and C. Laneve (1998), Bisimulations for the Join- Calculus, In Proc. PROCOMET'98, D. Gries and W.P. de Roever (Eds.), 68-86, IFIP, Chapman & Halls.
4. R. Bruni, J. Meseguer, U. Montanari, and V. Sassone (2000), Functorial Models for Petri Nets, Information and Computation. To appear.
5. C. Fournet and G. Gonthier (1996), The Reflexive Chemical Abstract Machine and the Join-Calculus, In Proc. POPL'96, 372-385, ACM.
6. C. Fournet and G. Gonthier (1996), A Hierarchy of Equivalences for Asynchronous Calculi, In Proc. ICALP'98, Lecture Notes in Computer Science 1443, 844-855, Springer.
7. C. Fournet, G. Gonthier, J. Lévy, L. Maranget, and D. Rémy (1996), A Calculus of Mobile Agents, In Proc. CONCUR'96, Lecture Notes in Computer Science 1119, 406-421, Springer.
8. C. Fournet, C. Laneve, L. Maranget, and D. Rémy (1997), Implicit Typing à la ML for the Join-Calculus, In Proc. CONCUR'97, Lecture Notes in Computer Science 1243, 196-212, Springer.
9. K. Jensen (1992), Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Monographs on Theoretical Computer Science, Springer.
10. C. Laneve (1996), May and Must Testing in the Join-Calculus, Technical Report UBLCS 96-04, Università di Bologna.
11. F. Le Fessant and L. Maranget (1998), Compiling Join-Patterns, In Proc. HLCL'98, Electronic Notes in Computer Science 16(3), Elsevier.
12. R. Milner (1993), Action Calculi, or Syntactic Action Structures, In Proc. MFCS'93, Lecture Notes in Computer Science 711, 105-121, Springer.
13. M. Nielsen, L. Priese, and V. Sassone (1995), Characterizing Behavioural Congruences for Petri Nets, in Proc. CONCUR 95, Lecture Notes in Computer Science 962, 175-189, Springer.
14. M. Odersky (2000), Functional Nets, In Proc. ESOP'2000, Lecture Notes in Computer Science 1782, 1-25, Springer.
15. M. Odersky, C. Zenger, M. Zenger, and G. Chen (1999), A Functional View of Join, Technical Report ACRC-99-016, University of South Australia.
16. C.A. Petri (1962), Kommunikation mit Automaten. Ph.D. thesis, Institut für Instrumentelle Mathematik, Bonn.
17. W. Reisig (1985), Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science, Springer.
18. V. Sassone (2000), On the Algebraic Structure of Petri Nets, Bulletin of EATCS 72, 133-148.