Projects



Changes between Version 3 and Version 4 of ccpn


Ignore:
Timestamp:
Feb 2, 2019, 11:08:37 PM (6 years ago)
Author:
9simon
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • ccpn

    v3 v4  
    11== CCPN: Curry Coloured Petri Nets ==
    22
    3 The new Petri net formalism and its tools provide the possibilities
    4  - to model CPN (Coloured Petri Nets) with code annotations with the Renew editor environment,
     3The Curry-coloured Petri net formalism and its tool set provide the possibilities
     4 - to model CCPNs (Curry-coloured Petri nets) with Curry inscriptions in the Renew editor environment
    55 - to simulate CCPN models
    66 - to generate a reachability graph for CCPN models
    7  - to be used as a Haskell library
    8 While Haskell is used as the main programming language Curry is used for the inscription language.
    9 The main advantage is that CCPN annotations are mostly side effect free due to the strong type system of Haskell and Curry.
    10 Binding searches are redirected to the compiler, therefore using the efficient implemention of complex operations.
     7 - to be integrated as a Haskell library into Haskell programs
     8While Haskell is used as the implementations language, Curry is used as the inscription language.
     9The 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.
     10Binding searches are based on the highly optimized KiCS2 compiler Curry evaluation environment.
    1111
    12 Here we provide a webpage for download for reviewers:  [http://www.informatik.uni-hamburg.de/TGI/moldt/renew2.6devbase.zip renew2.6devbase.zip]
     12Here we provide a download for reviewers:  [http://www.informatik.uni-hamburg.de/TGI/moldt/renew2.6devbase.zip renew2.6devbase.zip]
    1313
    14 References for CCPN so far are:
     14References for CCPN are:
    1515
    1616 - 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.