Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Proceedings of the eleventh international conference on Logic programming
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Fundamenta Informaticae - Special issue on Petri nets
Model checking
Proceedings of the 1999 international conference on Logic programming
Extending the Smodels system with cardinality and weight constraints
Logic-based artificial intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Improving the Encoding of LTL Model Checking into SAT
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Place or Transition Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
prod 3.2: An Advanced Tool for Efficient Reachability Analysis
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
XMC: A Logic-Programming-Based Verification Toolset
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Deadlock Checking Using Net Unfoldings
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Model Checking Abstract State Machines with Answer Set Programming
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Symbolic Step Encodings for Object Based Communicating State Machines
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Here's the Beef: Answer Set Programming !
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Justifications for logic programs under answer set semantics
Theory and Practice of Logic Programming
SAT-based answer set programming
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Fast SAT-based answer set solver
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Credulous resolution for answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Logic programs with abstract constraint atoms: The role of computations
Artificial Intelligence
Logic programs with abstract constraint atoms: the role of computations
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A translational approach to constraint answer set solving
Theory and Practice of Logic Programming
Logic programming for finding models in the logics of knowledge and its applications: A case study
Theory and Practice of Logic Programming
Coala: a compiler from action languages to ASP
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Verifying business process compliance by reasoning about actions
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Potassco: The Potsdam Answer Set Solving Collection
AI Communications - Answer Set Programming
Symmetry-breaking answer set solving
AI Communications - Answer Set Programming
Effectively reasoning about infinite sets in answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Combining answer set programming and prolog: the ASP-PROLOG system
Logic programming, knowledge representation, and nonmonotonic reasoning
Efficient scenario verification for hybrid automata
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Answer set programming: a declarative approach to solving search problems
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Model checking abstract state machines with answer set programming
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proving and explaining the unfeasibility of message sequence charts for hybrid systems
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Solving alternating boolean equation systems in answer set programming
INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming
Model checking of hybrid systems using shallow synchronization
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Canonical transition set semantics for petri nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Exploiting step semantics for efficient bounded model checking of asynchronous systems
Science of Computer Programming
Model Checking Abstract State Machines with Answer Set Programming
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
SMT-based scenario verification for hybrid systems
Formal Methods in System Design
Temporal deontic action logic for the verification of compliance to norms in ASP
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Law
| Hi-index | 0.00 |
In this paper, bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous systems a generalisation of communicating automata, 1-safe Petri nets, are used. It is shown how a 1-safe Petri net and a requirement on the behaviour of the net can be translated into a logic program such that the bounded model checking problem for the net can be solved by computing stable models of the corresponding program. The use of the stable model semantics leads to compact encodings of bounded reachability and deadlock detection tasks as well as the more general problem of bounded model checking of linear temporal logic. Correctness proofs of the devised translations are given, and some experimental results using the translation and the Smodels system are presented.