An O(|S| × |T|)-algorithm to verify if a net is regular

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

Volumn 1091, Issue , 1996, Pages 366-379

  Kovalyov, Andrei ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS;

BOUNDEDNESS; EXPRESSIVE POWER; EXTENDED FREE CHOICE NETS; INITIAL MARKING; LINEAR-ALGEBRAIC; LIVENESS; STRONGLY CONNECTED;

ALGORITHMS;

EID: 21344453719     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61363-3_20     Document Type: Conference Paper

References (14)

1. [Be] E.Best: Structure theory of Petri nets: the free choice hiatus. LNCS 254. (1987) 168-205.
2. [Dl] J.Desel: Regular marked Petri nets. Proc. of the 19th Int. Workshop on Graph- Theoretic Concepts in Computer Science/ Jan van Leeuween (ed.) LNCS 790, pp.264-275 (1993).
3. [D2] J.Desel: A proof of the Rank Theorem for extended free choice nets. Proc. of the 13th Int. Conf. on Appl. and Theory of Petri nets/Jensen,K.(ed.) LNCS 616, pp.134-153 (1992).
4. [DEI] J.Desel, J.Espaxza: Free Choice Petri Nets. Cambridge Universty Press. 1995, 244p.
5. [DE2] J.Desel,J.Esparza: Reachability in cyclic extended free choice systems. Theoretical Computer Science 114(1993) 93-118.
6. [EBS] J.Esparza, E.Best, M.Silva: Minimal deadlocks in free choice nets. Hildesheìmer Informatik-Berichte. N 1. July 89. Universität Hildesheim.
7. [H] M.T.Hack: Analysis of production schemata by Petri nets, Cambridge, Mass.: MIT, Project MAC TR-94, (1972) pp.119. Corrections 1974.
8. [Kel] P.Kemper: On Finding a cover of minimal siphons in extended free choice nets. Algorithmen und Werkzeuge für Petrinetze. Workshop der GI-Fachgruppe 0.0.1 "Petrinetze und verwandte Systemmodelle." Berlin, 10-11 Oktober 1994.
9. [Ke2] P.Kemper: 0((_P| x|r|)-algorithm to compute a cover of S-components in EFC- nets. Forschungsbericht 543, Universitaet Dortmund, 1994.
10. [Ke3] P.Kemper: Linear time algoritm to find a minimal deadlock in a strongly connected free-choice nets. Proc. of the 14th Int. Conf. on Appl. and Theory of Petri nets. Chicago, June 1993. LNCS 691.
11. [Kl] A.V. Kovalyov: An 0(151 ×|T|)-Algorithm to Verify Liveness and Boundedness in Extended Free Choice Nets. Proceedings of the 10th IEEE International Symposium On Intelligent Control. August 27-29, 1995, Monterey, Califorornia, USA. pp.597-601.
12. [K2] A.V. Kovalyov: A new formulation of the Rank Theorem for live and bounded extended free choice nets. Submitted at the 1996 IEEE International Conference on Robotics and Automation. Minneapolis, Minnesota, USA.
13. [S] P.H.Starke: Analyse von Petri-Netz-Modellen. B.G.Teubner Stuttgart 1990 (in German).
14. [Ta] R. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Comp., Vol.l, p.p.146-160.