The University of Southampton
University of Southampton Institutional Repository

High-Level Petri Nets as Type Theories in the Join Calculus

High-Level Petri Nets as Type Theories in the Join Calculus
High-Level Petri Nets as Type Theories in the Join Calculus
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, $PN_i$, introduce a hierarchy of type systems of decreasing strictness, $Type_i$, $i=0,\ldots,3$, and we prove that a join process is typeable according to $Type_i$ if and only if it is (strictly equivalent to) a net of class $PN_i$. In the details, $PN_0$ and $PN_1$ contain, resp., usual place/transition and coloured Petri nets, while $PN_2$ and $PN_3$ propose two natural notions of high-level net accounting for dynamic reconfiguration and process creation and called reconfigurable and dynamic Petri nets, respectively.
join-calculus, petri nets, foundations of distributed systems
3-540-41864-4
104-120
Buscemi, M.
af961b66-d4da-4aac-9317-b8005c6e5c6e
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
Buscemi, M.
af961b66-d4da-4aac-9317-b8005c6e5c6e
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7

Buscemi, M. and Sassone, V. (2001) High-Level Petri Nets as Type Theories in the Join Calculus At Foundations of Software Science and Computation Structures, FOSSACS 2001.. , pp. 104-120.

Record type: Conference or Workshop Item (Paper)

Abstract

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, $PN_i$, introduce a hierarchy of type systems of decreasing strictness, $Type_i$, $i=0,\ldots,3$, and we prove that a join process is typeable according to $Type_i$ if and only if it is (strictly equivalent to) a net of class $PN_i$. In the details, $PN_0$ and $PN_1$ contain, resp., usual place/transition and coloured Petri nets, while $PN_2$ and $PN_3$ propose two natural notions of high-level net accounting for dynamic reconfiguration and process creation and called reconfigurable and dynamic Petri nets, respectively.

PDF jNetsFOSSACSoff.pdf - Other
Download (204kB)

More information

Published date: 2001
Venue - Dates: Foundations of Software Science and Computation Structures, FOSSACS 2001., 2001-01-01
Keywords: join-calculus, petri nets, foundations of distributed systems
Organisations: Web & Internet Science

Identifiers

Local EPrints ID: 262283
URI: http://eprints.soton.ac.uk/id/eprint/262283
ISBN: 3-540-41864-4
PURE UUID: ed2178e7-6677-403d-93f4-75a091fd5cfc

Catalogue record

Date deposited: 11 Apr 2006
Last modified: 18 Jul 2017 08:52

Export record

Contributors

Author: M. Buscemi
Author: V. Sassone

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×