...linear-time temporal logic (ltl) is known as one of the most useful logics for verifying concurrent systems, and infinitary
logic (il) is known as an...semantical way, which is based on kripke semantics. the cut-elimination theorems for (some sequent calculi
for) ltl, an infinitary linear-time temporal logic ilt
...we associate a temporal logic xtl
with each class
of (regular) tree languages and provide both an algebraic and a game-theoretic characterization of the expressive power of
the logic xtl(
...focus game is applied to propositional projection temporal logic with infinite models (pptl) for the satisfi- ability and model...which sub-formulas are defined for pptl formulas. accordingly, focus game g(r) is constructed for checking the satisfiability of pptl...
...expressive equivalence with respect to temporal logics, transfer from component automata to temporalized ones. then, we exploit the cor- respondence between temporalized logics and automata to reduce the task of finding the temporal logic counterparts of the given theories of time granularity to the easier one of finding temporalized automata counterparts of them....
...class of combined automata, called temporalized automata, which can be proved to be the automata-theoretic counterpart of temporalized logics, and show that relevant properties...expressive equivalence with respect to temporal logics, transfer from component automata to temporalized ones. then, we exploit the correspondence between temporalized logics and automata to reduce the...
...succinctness. yet, unlike the case for linear time logics, no canonical temporal logic of branching time was agreed upon. we offer an explanation for the multiplicity of temporal logics over branching time and provide...
...vocated as a better representation for reactive program ab- stractions generated by automatic techniques such as predi- cate abstraction. indeed, for the same cost, model checking...to model checking by a temporal- logic formula transformation, which generalizes a trans- formation for propositional logic known assemantic min- imization in...
...open systems with interval based temporal logics, alternating interval based temporal logics are
proposed by introducing concurrent game structures (cgs) to propositional projection temporal logic (pptl) and propositional
interval temporal logic (pitl). further, examples are given...
...temporal logics are a well investigated formalism for the specification, verification, and synthesis of reactive systems.
within this family, alternating temporal logic, atl
*, has been introduced as a useful generalization of classical linear- and branching-time temporal logics by allowing temporal
operators to be indexed by...