Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Preferred answer sets for extended logic programs
Artificial Intelligence
Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Efficient Model Checking Using Tabled Resolution
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
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
A decidable mu-calculus: Preliminary report
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
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
| Hi-index | 0.00 |
We formally characterize alternating fixedp oints of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferred stable model of a logic program, and define a mapping that associates a normal logic program with a boolean equation system such that the solution to the equation system can be "readoff" the preferredstable model of the logic program. We also show that the preferredmo del cannot be calculateda-p osteriori (i.e. compute stable models and choose the preferredone) but rather must be computedin an intertwinedfashion with the stable model itself. The mapping reveals a natural relationship between the evaluation of alternating fixedp oints in boolean equation systems and the Gelfond-Lifschitz transformation usedin stable-model computation.For alternation-free boolean equation systems, we show that the logic programs we derive are stratified, while for formulas with alternation, the corresponding programs are non-stratified. Consequently, our mapping of boolean equation systems to logic programs preserves the computational complexity of evaluating the solutions of special classes of equation systems (e.g., linear-time for the alternation-free systems, exponential for systems with alternating fixed points).