论文信息 - Relating Coloured Petri Nets to Constraint Handling Rules

Relating Coloured Petri Nets to Constraint Handling Rules

Constraint Handling Rules (CHR) is a declarative rulebased concurrent committed-choice programming language. Petri nets are a well-known formalism for modeling and analysis of concurrent processes. We aim to develop a framework to exploit Petri nets as a tool for the modeling and analysis of CHR programs. In this paper, we show that place/transition nets can easily be embedded into CHR and we develop a translation of a significant segment of CHR into coloured Petri nets (CPN).

Hariolf Betz

[2] C. Petri. Kommunikation mit Automaten , 1962 .

[3] Khalil Djelloul,et al. A Unified Semantics for Constraint Handling Rules in Transaction Logic , 2007, LPNMR.

[4] Rüdiger Valk,et al. Formal Properties of Place/Transition Nets , 1979, Advanced Course: Net Theory and Applications.

[5] Peter J. Stuckey,et al. The Refined Operational Semantics of Constraint Handling Rules , 2004, ICLP.

[6] Thom W. Frühwirth. Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis , 2005, ICLP.

[7] Kurt Jensen,et al. Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..

[8] Thom W. Frühwirth,et al. Theory and Practice of Constraint Handling Rules , 1998, J. Log. Program..

[9] Thom W. Frühwirth,et al. Constraint Handling Rules , 2009, Constraint Programming.

[10] Slim Abdennadher,et al. Operational Semantics and Confluence of Constraint Propagation Rules , 1997, CP.

[11] Thom W. Frühwirth,et al. Probabilistic Constraint Handling Rules , 2002, Electron. Notes Theor. Comput. Sci..

[12] Marc Meister. Fine-grained Parallel Implementation of the Preflow-Push Algorithm in CHR , 2006, WLP.