Handbook of theoretical computer science (vol. B)
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Model checking
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
On Model Checking Durational Kripke Structures
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Systems and Software Verification: Model-Checking Techniques and Tools
Systems and Software Verification: Model-Checking Techniques and Tools
Modeling and querying biomolecular interaction networks
Theoretical Computer Science - Special issue: Computational systems biology
Efficient temporal-logic query checking for presburger systems
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Efficient Compliance Checking Using BPMN-Q and Temporal Logic
BPM '08 Proceedings of the 6th International Conference on Business Process Management
On the distributivity of LTL specifications
ACM Transactions on Computational Logic (TOCL)
Finding state solutions to temporal logic queries
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Variants of LTL query checking
HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
| Hi-index | 0.00 |
Temporal query checking is an extension of temporal model checking where one asks what propositional formulae can be inserted in a temporal query (a temporal formula with a placeholder) so that the resulting formula is satisfied in the model at hand.We study the problem of computing all minimal solutions to a temporal query without restricting to so-called "valid" queries (queries guaranteed to have a unique minimal solution). While this problem is intractable in general, we show that deciding uniqueness of the minimal solution (and computing it) can be done in polynomial-time.