relation: http://eprints.imtlucca.it/134/
title: High-Level Petri Nets as Type Theories in the Join Calculus
creator: Buscemi, Maria Grazia
creator: Sassone, Vladimiro
subject: QA75 Electronic computers. Computer science
description: We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four classes of nets of increasing expressiveness, ∏  i , introduce a hierarchy of type systems of decreasing strictness, Δ i , i = 0,..., 3, and we prove that a join process is typeable according to Δ i  if and only if it is (strictly equivalent to) a net of class ∏  i . In the details, ∏  0  and ∏ 1 contain, resp., usual place/transition and coloured Petri nets, while ∏ 2 and ∏ 3 propose two natural notions of high-level net accounting for dynamic reconfiguration and process creation and called reconfigurable and dynamic Petri nets, respectively.  
publisher: Springer
contributor: Honsell, Furio
contributor: Miculan, Marino
date: 2001
type: Book Section
type: PeerReviewed
identifier:   Buscemi, Maria Grazia and Sassone, Vladimiro  High-Level Petri Nets as Type Theories in the Join Calculus.   In:  Proceedings of Foundations of Software Science and Computation Structure (FoSSaCS ’01).   Lecture Notes in Computer Science, 2030 .  Springer, pp. 104-120.  ISBN 3-540-41864-4      (2001)  
relation: http://dx.doi.org/10.1007/3-540-45315-6_7
relation: 10.1007/3-540-45315-6_7