On Well-Formed Nets and Optimizations in Enabling Tests

Simulation techniques are frequently used to verify behavioural properties of complex systems. The tools which enhance these techniques have to cope with combinatorial explosion problems, even for small system specifications. Several optimizations have been proposed in order to perform exhaustive simulations. In well-formed nets, they may be complemented by optimized management of transition firings. We would like to propose a methodological approach to take into account dependency relations between tokens to avoid useless combinations. A simulation service has been implemented to enhance this work.

[1]  Giovanni Chiola,et al.  On Well-Formed Coloured Nets and Their Symbolic Reachability Graph , 1991 .

[2]  Giovanni Chiola,et al.  A structural colour simplification in well-formed coloured nets , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

[3]  Søren Christensen,et al.  Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs , 1992, Application and Theory of Petri Nets.

[4]  Hartmann J. Genrich,et al.  Predicate/Transition Nets , 1986, Advances in Petri Nets.

[5]  Gary J. Nutt,et al.  A simulation system architecture for graph models , 1991, Applications and Theory of Petri Nets.

[6]  Giovanni Chiola,et al.  A symbolic simulation mechanism for well-formed coloured Petri nets , 1992, Proceedings. 25th Annual Simulation Symposium.

[7]  Grzegorz Rozenberg,et al.  High-level Petri Nets: Theory And Application , 1991 .

[8]  Patrice Godefroid Using Partial Orders to Improve Automatic Verification Methods , 1990, CAV.

[9]  Serge Haddad,et al.  Regular stochastic Petri nets , 1989, Applications and Theory of Petri Nets.