New algorithms for deciding the siphon-trap property

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

Volumn 6128 LNCS, Issue , 2010, Pages 267-286

  Oanea, Olivia ^a   Wimmel, Harro ^a   Wolf, Karsten ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

Commoner Hack; Divide and Conquer; Liveness; Petri nets; SAT; Siphons; Traps

Indexed keywords

BOOLEAN SATISFIABILITY; DEADLOCK FREEDOM; DECISION PROCEDURE; DIVIDE-AND-CONQUER; LIVENESS; MINIMAL SIPHONS; SAT SOLVERS; SECOND PROCEDURES; STRUCTURAL ENTITIES; TRAP PROPERTIES;

PETRI NETS; SIPHONS;

GRAPH THEORY;

EID: 77955407901     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13675-7_16     Document Type: Conference Paper

References (11)

1. Barkaoui, K., Minoux, M.: A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol. 616, pp. 62-75. Springer, Heidelberg (1992)
2. Desel, J., Esparza, J.: Free Choice Petri nets. Cambridge Tracts in Theoretical Computer Science, vol. 40. Cambridge University Press, Cambridge (1995)
3. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
4. Esparza, J., Nielsen, M.: Decidability issues for Petri nets. Petri Nets Newsletter 52, 245-262 (1994)
5. Hack, M.H.T.: Analysis of Production Schemata by Petri Nets. Master's thesis, MIT, Dept. Electrical Engineering, Cambridge, Mass (1972)
6. INA. Integrated Net Analyzer (2003), http://www2.informatik.hu-berlin.de/ ~starke/ina.html
7. Karatkevich, A.: Analysis by solving logical equations - calculation of siphons and traps. In: Dynamic Analysis of Petri Net-based Discrete Systems. LNCIS, vol. 356, pp. 87-93. Springer, Heidelberg (2007)
8. Mennicke, S., Oanea, O., Wolf, K.: Decomposition into open nets. In: AWPN 2009. CEUR Workshop Proceedings, vol. 501, pp. 29-34. CEUR-WS.org (2009)
9. MiniSat. Minimalistic, open-source SAT solver (2007), http://www.minisat.se
10. Minoux, M., Barkaoui, K.: Polynomial algorithms for proving or disproving Commoner's property in Petri nets. In: Proceedings 9th Workshop on Theory and Applications of Petri Nets, vol. 1, pp. 113-125 (1988)
11. Zaitsev, D.A.: Decomposition of Petri nets. Cybernetics and Systems Analysis (5), 131-140 (2004)