Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets
暂无分享,去创建一个
[1] P. Simons. Towards Constraint Satisfaction through Logic Programs and the Stable Model Semantics , 1997 .
[2] Antti Valmari,et al. A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..
[3] Ilkka Niemelä,et al. Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.
[4] Bernd Grahlmann,et al. The PEP Tool , 1997, CAV.
[5] Stephan Melzer,et al. Deadlock Checking Using Net Unfoldings , 1997, CAV.
[6] Antti Valmari. A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..
[7] Walter Vogler,et al. An Improvement of McMillan's Unfolding Algorithm , 1996, Formal Methods Syst. Des..
[8] Keijo Heljanko,et al. Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets , 1999, Fundam. Informaticae.
[9] James C. Corbett,et al. Evaluating Deadlock Detection Methods for Concurrent Software , 1996, IEEE Trans. Software Eng..
[10] Kenneth L. McMillan,et al. Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.
[11] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[12] Eike Best. Partial order verification with PEP , 1996, Partial Order Methods in Verification.
[13] Victor W. Marek,et al. Autoepistemic logic , 1991, JACM.
[14] Melvin Fitting,et al. First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.
[15] Marienburger Platz. Partial Order Veriication with Pep , 1996 .
[16] Patrik Simons,et al. Extending the Stable Model Semantics with More Expressive Rules , 1999, LPNMR.
[17] Mogens Nielsen,et al. Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.
[18] Kenneth L. McMillan,et al. A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..