The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Theoretical Computer Science
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about infinite computations
Information and Computation
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
Deciding Properties of Integral Relational Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
An Automata-Theoretic Approach to Constraint LTL
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Calendars, Time Granularities, and Automata
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
On the Verification Problem of Nonregular Properties for Nonregular Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
NEXP TIME-complete description logics with concrete domains
ACM Transactions on Computational Logic (TOCL)
Analysis of modular arithmetic
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
LTL Over integer periodicity constraints
Theoretical Computer Science
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
An automata-theoretic approach to constraint LTL
Information and Computation
Verification of qualitative Z constraints
Theoretical Computer Science
An Automata-based Approach for CTL*; With Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Completeness of the bounded satisfiability problem for constraint LTL
RP'11 Proceedings of the 5th international conference on Reachability problems
Branching-time temporal logic extended with qualitative presburger constraints
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in MediaObjects/InlineFigure2.png. The constraint language includes periodicity constraints, comparison constraints of the form x = y and x