CCPN: Curry Coloured Petri Nets

The Curry-coloured Petri net formalism and its tool set provide the possibilities

• to model CCPNs (Curry-coloured Petri nets) with Curry inscriptions in the ​Renew editor environment
• to simulate CCPN models
• to generate a reachability graph for CCPN models
• to be integrated as a Haskell library into Haskell programs

While Haskell is used as the implementations language, Curry is used as the inscription language. The main advantage is that CCPN inscriptions are side effect free due to the Curry's functional purness and the control of side effects by its strong type system. Binding searches are based on the highly optimized Curry evaluation environment of the ​KiCS2 compiler.

Here we provide a download for reviewers: ​renew2.6devbase.zip

References for CCPN 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, Augsburg, 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)