Time window temporal logic
Copyright policy )Time window temporal logic
This paper introduces time window temporal logic (TWTL), a rich expressivity language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks, which are typically seen in robotics and control applications. This paper also discusses the relaxation of TWTL formulae with respect to deadlines of tasks. Efficient automata-based frameworks to solve synthesis, verification and learning problems are also presented. The key ingredient to the presented solution is an algorithm to translate a TWTL formula to an annotated finite state automaton that encodes all possible temporal relaxations of the specification. Case studies illustrating the expressivity of the logic and the proposed algorithms are included.
- Boston College United States
- Boston University United States
theory & methods, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Specification and verification (program logics, model checking, etc.), Formal Languages and Automata Theory (cs.FL), Controller synthesis, Transition complexity, Mathematical sciences, Temporal logic, Computer Science - Formal Languages and Automata Theory, Formal languages and automata, unambiguous languages, Temporal relaxation, Automata, Specifications, Unambiguous languages, Timed temporal logic, Computation theory & mathematics, Construction, controller synthesis, Verification, temporal relaxation, Computer science, 004, Logic in Computer Science (cs.LO), Constraints, Information and computing sciences, timed temporal logic, Finite state automata, Science & technology, verification, finite state automata, Algorithms
theory & methods, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Specification and verification (program logics, model checking, etc.), Formal Languages and Automata Theory (cs.FL), Controller synthesis, Transition complexity, Mathematical sciences, Temporal logic, Computer Science - Formal Languages and Automata Theory, Formal languages and automata, unambiguous languages, Temporal relaxation, Automata, Specifications, Unambiguous languages, Timed temporal logic, Computation theory & mathematics, Construction, controller synthesis, Verification, temporal relaxation, Computer science, 004, Logic in Computer Science (cs.LO), Constraints, Information and computing sciences, timed temporal logic, Finite state automata, Science & technology, verification, finite state automata, Algorithms
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).47 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!