CCPN: Curry Coloured Petri Nets

The new Petri net formalism and its tools provide the possibilities

• to model CPN (Coloured Petri Nets) with code annotations with the Renew editor environment,
• to simulate CCPN models
• to generate a reachability graph for CCPN models
• to be used as a Haskell library

While Haskell is used as the main programming language Curry is used for the inscription language. The main advantage is that CCPN annotations are mostly side effect free due to the strong type system of Haskell and Curry. Binding searches are redirected to the compiler, therefore using the efficient implemention of complex operations.

[Download-tools-and-examples] Here we provide a webpage for download for reviewers

References for CCPN so far are:

• Michael Simon. Curry-Coloured Petri Nets: A concurrent simulator for Petri nets with purely functional logic program inscriptions. Master thesis, University of Hamburg, Department of Informatics, Vogt-Kölln Str. 30, D-22527 Hamburg, April 2018.

• Michael Simon and Daniel Moldt. About the development of a Curry-Coloured Petri net simulator. In Robert Lorenz and Johannes Metzger, editors, Algorithms and Tools for Petri Nets, Proceedings of the 21th Workshop AWPN 2018, Augs- burg, Germany, number 2018-02 in Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg, pages 53–54, 2018.

• Michael Simon and Daniel Moldt. Tools for Curry-Coloured Petri Nets. Internal Report 10 pages (Please contact the authors)