Transformations and Decompositions of Nets

We present a set of transformations of place/transition systems which preserve several classical properties of nets namely boundedness, deadlock freeness, liveness and covering by S-invariants. These transformations may simplify or refine a system and allow either to simplify a place/transition system before analysing it or to introduce more details in a given system having some propreties without changing them. We also present a decomposition technique to split a system into subsytems which can be analysed separatly.

[1]  Robert Valette,et al.  Analysis of Petri Nets by Stepwise Refinements , 1979, J. Comput. Syst. Sci..

[2]  Wolfgang Reisig,et al.  Petri Nets : central models and their properties : proceedings of an advanced course, Bad Honnef, 8.-19. September 1986 , 1987 .

[3]  Klaus Voss,et al.  On the Notion of Interface in Condition/Event-Systems , 1982, European Workshop on Applications and Theory of Petri Nets.

[4]  Lucia Pomello,et al.  Some equivalence notions for concurrent systems. An overview , 1985, Applications and Theory in Petri Nets.

[5]  Charles André,et al.  Structural Transformations Giving B-Equivalent PT-Nets , 1982, European Workshop on Applications and Theory of Petri Nets.

[6]  Kurt Lautenbach,et al.  Elements of General Net Theory , 1979, Advanced Course: Net Theory and Applications.

[7]  Carla Simone,et al.  Giving back some freedom to the system designer , 1985 .

[8]  Giorgio De Michelis,et al.  Exhibited-Behaviour Equivalence and Organizational Abstraction in Concurrent System Design , 1985, ICDCS.

[9]  Gérard Berthelot,et al.  Checking properties of nets using transformation , 1985, Applications and Theory in Petri Nets.

[10]  Wolfgang Reisig,et al.  Place/Transition Systems , 1986, Advances in Petri Nets.

[11]  Ichiro Suzuki,et al.  Stepwise Refinements of Transitions and Places , 1980, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.