Publisher
Springer International Publishing
Reference40 articles.
1. Aho AV, Hopcroft JE (1974) The design and analysis of computer algorithms. Addison-Wesley Longman Publishing Co. Inc., Boston
2. Barkaoui K, Minoux M (1992) A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets. In: Proceedings of the 13th international conference on application and theory of Petri nets, Sheffield, UK, pp 62–75
3. Best E (1987) Structural theory of Petri nets: the free choice hiatus. In: Lecture notes in computer science, vol 254, New York, 1987. Springer, pp 168–206
4. Best E, Thiagarajan P (1987) Some classes of live and safe Petri nets. In: Voss K, Genrich H, Rozenberg G (eds) Concurrency and nets. Springer, Berlin, pp 71–94
5. Matriser Et Appliquer Le Grafcet;M Blanchard,1979