Verification of bounded Petri nets using integer programming-Reference-Cited by-同舟云学术

Verification of bounded Petri nets using integer programming

Published:2006-08-31 Issue:2 Volume:30 Page:143-176
ISSN:0925-9856
Container-title:Formal Methods in System Design
language:en
Short-container-title:Form Method Syst Des

Author:

Khomenko Victor,Koutny Maciej

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s10703-006-0022-1.pdf

Reference23 articles.

1. Ajili F, Contejean E (1997) Avoiding slack variables in the solving of linear diophantine equations and inequations. Theor Comput Sci 173:183–208

2. Best E, Grahlmann B (1996) PEP —More than a Petri net tool. In: Proc TACAS'96, Lecture Notes in Computer Science, Springer-Verlag, Vol. 1055, pp 397–401

3. Clarke EM, Grumberg O, Peled D (1999) Model checking. MIT Press

4. Contejean E, Devie H (1994) An efficient incremental algorithm for solving systems of linear diophantine equations. Inf Comput 113:143–172

5. Corbett JC (1996) Evaluating deadlock detection methods for concurrent software. IEEE Trans Soft Eng SE-22(3):161–180

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved Net Reductions for LTL $$\setminus $$ \ X Model Checking;Structured Object-Oriented Formal Language and Method;2014

2. Verification of Petri Nets with Read Arcs;Lecture Notes in Computer Science;2012

3. Occurrence Nets Then and Now: The Path to Structured Occurrence Nets;Applications and Theory of Petri Nets;2011

4. Structured Occurrence Nets: A Formalism for Aiding System Failure Prevention and Analysis Techniques;Fundamenta Informaticae;2009

5. A Shortest-Path Lyapunov Approach for Forward Decision Processes;International Journal of Computer Games Technology;2009