The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Theoretical Computer Science
On the interpretability of arithmetic in temporal logic
Theoretical Computer Science
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal logic (vol. 1): mathematical foundations and computational aspects
Reasoning about infinite computations
Information and Computation
An access control model supporting periodicity constraints and temporal reasoning
ACM Transactions on Database Systems (TODS)
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
Theoretical Computer Science
Timed automata with periodic clock constraints
Journal of Automata, Languages and Combinatorics
Introduction to constraint databases
Introduction to constraint databases
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Temporal Logic with Forgettable Past
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Supporting Periodic Authorizations and Temporal Reasoning in Database Access Control
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Deciding Properties of Integral Relational Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
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
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Presburger liveness verification of discrete timed automata
Theoretical Computer Science
On the Verification Problem of Nonregular Properties for Nonregular Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A Logical Approach to Represent and Reason about Calendars
TIME '02 Proceedings of the Ninth International Symposium on Temporal Representation and Reasoning (TIME'02)
Representing Periodic Temporal Information with Automata
TIME '01 Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME'01)
Precise interprocedural analysis through linear algebra
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
NEXP TIME-complete description logics with concrete domains
ACM Transactions on Computational Logic (TOCL)
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Temporal Logic with Predicate "-Abstraction
TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
Representing and Reasoning about Temporal Granularities
Journal of Logic and Computation
Verification of qualitative constraints
CONCUR 2005 - Concurrency Theory
LTL Over integer periodicity constraints
Theoretical Computer Science
Compact and tractable automaton-based representations of time granularities
Theoretical Computer Science
Interval-based temporal reasoning with general TBoxes
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A tableau algorithm for description logics with concrete domains and GCIs
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Parameterized Complexity
LTL Over integer periodicity constraints
Theoretical Computer Science
An automata-theoretic approach to constraint LTL
Information and Computation
Verification of qualitative Z constraints
Theoretical Computer Science
Impartial Anticipation in Runtime-Verification
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Towards a unifying approach to representing and querying temporal data in description logics
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Hi-index | 5.23 |
Periodicity constraints are used in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. In the paper, we introduce the logic PLTLmod, an extension of Linear-Time Temporal Logic LTL with past-time operators whose atomic formulae are defined from a first-order constraint language dealing with periodicity. Although the underlying constraint language is a fragment of Presburger arithmetic shown to admit a PSPACE-complete satisfiability problem, we establish that PLTLmod model-checking and satisfiability problems remain in PSPACE as plain LTL (full Presburger LTL is known to be highly undecidable). This is particularly interesting for dealing with periodicity constraints since the language of PLTLmod has a language more concise than existing languages and the temporalization of our first-order language of periodicity constraints has the same worst case complexity as the underlying constraint language. Finally, we show examples of introduction the quantification in the logical language that provide to PLTLmod, EXPSPACE-Complete problems. As another application, we establish that the equivalence problem for extended single-string automata, known to express the equality of time granularities, is PSPACE-complete by designing a reduction from QBF and by using our results for PLTLmod.