Transformations and decompositions of nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 254 LNCS, Issue , 1987, Pages 359-376

  Berthelot, G ^a,b  

^a CNAM IIE ^*  (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Decompositions of P T nets; Equivalence of P T Nets; Transformations of P T Nets

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOUNDEDNESS; DEADLOCK FREENESS; DECOMPOSITION TECHNIQUE; LIVENESS; P/T NET; S-INVARIANT; SUBSYTEMS;

PETRI NETS;

EID: 85034854874     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-47919-2_13     Document Type: Conference Paper

References (21)

1. C. André “systèmes à évolutions parallèles: modélisation par réseaux de Petri à capacités et analyse par abstraction” thèse d’état, Université de Nice, France, February 1981.
2. C. André “behaviour of a place/transition Net on a subset of transitions” IFB 52 Springer Verlag 1982.
3. C. André “ Structural transformations giving B-equivalent PT-nets” IFB 66, Springer-Verlag 1983.
4. G. Berthelot “Transformations et analyse de Réseaux de Petri.Application aux protocoles” Thèse d’état, Université P. et M. Curie, Paris France, June 1983.
5. G. Berthelot “Checking properties of Nets using transformations” LNCS 222 Advances in Petri Nets 85, G. Rozenberg ed, Springer-Verlag 1986.
6. N.H. Beldiceanu “Vérification de propriétés de réseaux de Petri à l’aide de règles de production” Rapport de recherche MASI n∘154, Université P. et M. Curie, Paris, France, October 1986
7. E. Best, C. Fernandez “Notations and terminology on Petri Nets theory” Arbeitspapiere der GMD n∘ 195, January 1986.
8. F. De Cindio, G. De Michelis, L. Pomello, C. Simone “Exhibited-Behaviour equivalence and Organizational abstraction in concurrent system design” The 5th Int. Conf on Distributed Computing Systems, Denver, Colorado, May 13–17, 1985, IEEE, pp 486–495.
9. F. De Cindio, G. De Michelis, C. Simone “Giving back some freedom to system designer”. System Research, n∘2.4, 1985.
10. Genrich, Lautenbach, Thiagarajan “Elements of general Net theory”, LNCS 84, Springer-Verlag 1980.
11. M. Hack “Extended State-Machine allocatable Nets, an extension of Free Choice Petri Nets results” Cambridge, Massachussets, MIT Project MAC, CSG-Memo 78-1, 1974
12. S. Haddad. Private conversation, lecture notes and thèse de 3ième cycle Université P. et M. Curie, Paris France, to appear in March 1987.
13. K. Lautenbach “Linear algebraic techniques for Place/Transitions Nets”. Proceedings of the Advanced Course on Petri Nets, Bad Honnef, Germany, September 8–19, 1986.
14. G. Memmi “Advanced algebraic techniques”. Proceedings of the Advanced Course on Petri Nets, Bad Honnef, Germany. September 8–19, 1986.
15. R. Milner “A calculus for communicating systems”, LNCS 92, Springer-Verlag 1980.
16. L. Pomello “Some equivalence notions for concurrent systems: An overview”, LNCS 222 Advances in Petri Nets 85, G.Rozenberg ed. Springer-Verlag 1986.
17. M. Placide “Transformations de réseaux de Petri préservant des propriétés significatives. Définition des homomorphismes associés” Thèse de 3ième cycle, Université de Nice, France, December 1982.
18. W. Reisig “Place/Transition Systems” Proceedings of the Advanced Course on Petri Nets, Bad Honnef, Germany. September 8–19, 1986.
19. I. Suzuki, T. Murata “Stepwise refinements of transitions and places” IFB 52, Springer-Verlag 1982.
20. R. Valette “Analysis of Petri Nets by stepwise refinement” J. Compt. System Sci., vol 18, n∘1, pp 35–46, February 1979.
21. K. Voss “On the notion of interface in condition/event-systems” IFB 66, Springer-Verlag 1983.