On Well-Formed Coloured Nets and Their Symbolic Reachability Graph

Chiola, Giovanni; Dutheillet, Claude; Franceschinis, Giuliana; Haddad, Serge

Chiola, Giovanni; Dutheillet, Claude; Franceschinis, Giuliana; Haddad, Serge (1990), On Well-Formed Coloured Nets and Their Symbolic Reachability Graph, 11th International Conference on Application and Theory of Petri Nets, 1990-06, Paris, France

Type

Communication / Conférence

Date

1990

Conference title

11th International Conference on Application and Theory of Petri Nets

Conference date

1990-06

Conference city

Paris

Conference country

France

Metadata

Show full item record

Author(s)

Chiola, Giovanni
Dutheillet, Claude
Franceschinis, Giuliana
Haddad, Serge

Abstract (EN)

The new class of Well Formed Coloured Nets (WN) is formally defined as an extension of Regular Nets, together with an extended Symbolic Reachability Graph (SRG) construction algorithm. WNs allow the representation of any colour function in a structured form, so that they have the same modelling power als general coloured nets (CPN). The SRG allows colour symmetries to be exploited to reduce the space and time complexity. The advantage of using WNs instead of unconstrained CPNs is that the detection of symmetries to construct the SRG is totally algorithmic.

Subjects / Keywords

extension (of) regular nets; complexity reduction; Symbolic Reachability Graph (SRG); Well formed coloured nets (WN)