System modelling with HyperNets

The authors propose a new graphical modelling tool, HyperNets, closely related to high level Petri nets (coloured, predicate-transition). HyperNets semantics is based on point-to-set functions and constraint theories. We associate a graphical representation to a point-to-set representation of HyperNets. The reachability set is characterized by fixed-point semantics. The correctness and completeness of a non-determinist semi-decision algorithm for the accessibility problem is proved. This algorithm also gives fire sequences; high-level Petri nets then appear as a particular case of HyperNets. We have implemented a version of this algorithm for linear HyperNets in the MINOS system.

[1]  Tadao Murata,et al.  Detection of Ada Static Deadlocks Using Petri Net Invariants , 1989, IEEE Trans. Software Eng..

[2]  Carlo Ghezzi,et al.  A Unified High-Level Petri Net Formalism for Time-Critical Systems , 1991, IEEE Trans. Software Eng..

[3]  Kurt Jensen,et al.  Coloured Petri Nets , 1997, Monographs in Theoretical Computer Science An EATCS Series.

[4]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[5]  Tadao Murata,et al.  A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs , 1988, IEEE Trans. Software Eng..

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

[7]  Kurt Lautenbach,et al.  S-Invariance in Predicate/Transition Nets , 1982, European Workshop on Applications and Theory of Petri Nets.

[8]  Alain Colmerauer,et al.  An introduction to Prolog III , 1989, CACM.

[9]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..