Fairness
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
On &ohgr;-automata and temporal logic
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Formal Methods in System Design
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Verification by Augmented abstraction: the automata---theoretic view
Journal of Computer and System Sciences
Introduction to Algorithms
Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Algebre de machines et logique temporelle
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
On-the-Fly Verification of Linear Temporal Logic
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Model checking: a tutorial overview
Modeling and verification of parallel processes
SPOT: An Extensible Model Checking Library Using Transition-Based Generalized Büchi Automata
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Automata-theoretic model checking revisited
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
The Büchi complementation saga
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
On-the-fly emptiness checks for generalized büchi automata
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
State/event-based LTL model checking under parametric generalized fairness
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Model checking LTLR formulas under localized fairness
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
| Hi-index | 0.00 |
In the automata theoretic approach to model checking, checking a state-space S against a linear-time property φ can be done in O(|S |×2O(|φ |)) time. When model checking under n strong fairness hypotheses expressed as a Generalized Büchi automaton, this complexity becomes O(|S |×2O(|φ | + n )). Here we describe an algorithm to check the emptiness of Streett automata, which allows model checking under n strong fairness hypotheses in O(|S |×2O(|φ |)×n ). We focus on transition-based Streett automata, because it allows us to express strong fairness hypotheses by injecting Streett acceptance conditions into the state-space without any blowup.