## An Improved On-the-fly Tableau Construction For a Real-Time Temporal Logic (2003)

Venue: | In International Conference on Computer Aided Verification |

Citations: | 8 - 1 self |

### BibTeX

@INPROCEEDINGS{Geilen03animproved,

author = {Marc Geilen},

title = {An Improved On-the-fly Tableau Construction For a Real-Time Temporal Logic},

booktitle = {In International Conference on Computer Aided Verification},

year = {2003},

pages = {276--290},

publisher = {Springer}

}

### OpenURL

### Abstract

Temporal logic is popular for specifying correctness properties of reactive systems. Real-time temporal logics add the ability to express quantitative timing aspects. Tableau constructions are algorithms that translate a temporal logic formula into a finite-state automaton that accepts precisely all the models of the formula. On-the-fly versions of tableau-constructions enable their practical application for modelchecking.

### Citations

1963 | A theory of timed automata - Alur, Dill - 1994 |

1202 |
The temporal logic of programs
- Pnueli
- 1977
(Show Context)
Citation Context ...always left-closed and right-open. In this paper we present a non-trivial extension to this tableau construction for the same logic fragment, that lifts this constraint. 1 Introduction Temporal logic =-=[13]-=- is a popular formalism for expressing properties of reactive systems. Finite state models of such programs can be analysed automatically with model checking procedures. Temporal logics exist in diffe... |

583 |
An automata-theoretic approach to automatic program verification
- Vardi, Wolper
- 1986
(Show Context)
Citation Context ...truction is an algorithm that translates a temporal logic formula into a finite-state automaton that accepts precisely all the models of the formula. The automata-theoretic approach to model checking =-=[12, 14] e-=-mploys tableau algorithms to turn a temporal formula into an observer of a system’s behaviours. For practical applications, tableau constructions are being improved and optimised (e.g., [5, 6, 9]). ... |

491 | UPPAAL in a nutshell - Larsen, Pettersson, et al. - 1997 |

268 | Simple on-the-fly automatic verification of linear temporal logic - Gerth, Peled, et al. - 1995 |

235 |
Checking that finite state concurrent programs satisfy their linear specification
- Lichtenstein, Pnueli
- 1985
(Show Context)
Citation Context ...truction is an algorithm that translates a temporal logic formula into a finite-state automaton that accepts precisely all the models of the formula. The automata-theoretic approach to model checking =-=[12, 14] e-=-mploys tableau algorithms to turn a temporal formula into an observer of a system’s behaviours. For practical applications, tableau constructions are being improved and optimised (e.g., [5, 6, 9]). ... |

202 | The benefits of relaxing punctuality
- Alur, Feder, et al.
- 1996
(Show Context)
Citation Context ... states. In the real-time domain, tableau constructions have been developed for various logics and their complexities have been studied [2, 10]. For dense time linear temporal logic the algorithms of =-=[2, 4] a-=-nd [8] are (to the best of the author’s knowledge) the only existing tableau constructions to date. [2, 4] being aimed at establishing a theoretical connection between temporal logic and timed autom... |

87 |
Techniques for Automatic Verification of RealTime Systems
- Alur
- 1991
(Show Context)
Citation Context ...e current state are separated from the constraints on the future states. In the real-time domain, tableau constructions have been developed for various logics and their complexities have been studied =-=[2, 10]. -=-For dense time linear temporal logic the algorithms of [2, 4] and [8] are (to the best of the author’s knowledge) the only existing tableau constructions to date. [2, 4] being aimed at establishing ... |

61 | Improved Automata Generation for Linear Temporal Logic - Daniele, Giunchiglia, et al. - 1999 |

57 | Optimizing Büchi automata
- Etessami, Holzmann
- 2000
(Show Context)
Citation Context ...ing [12, 14] employs tableau algorithms to turn a temporal formula into an observer of a system’s behaviours. For practical applications, tableau constructions are being improved and optimised (e.g.=-=, [5, 6, 9]-=-). An important improvement has been the development of on-the-fly versions of tableau constructions. Such onthe-fly tableau constructions are based on a normal form for temporal formulas in which the... |

44 | Model checking via reachability testing for timed automata
- Aceto, Burgueno, et al.
- 1998
(Show Context)
Citation Context ...structions to date. [2, 4] being aimed at establishing a theoretical connection between temporal logic and timed automata and [8] a first attempt at a practical algorithm suitable for model checking. =-=[1]-=- describes the construction of so-called testing automata from formulas in a safety modal logic for the Uppaal tool. The logic is a restricted variant of a real-time extension of Hennessy-Milner logic... |

40 | It’s about time: Real-time logics reviewed
- Henzinger
- 1998
(Show Context)
Citation Context ...e current state are separated from the constraints on the future states. In the real-time domain, tableau constructions have been developed for various logics and their complexities have been studied =-=[2, 10]. -=-For dense time linear temporal logic the algorithms of [2, 4] and [8] are (to the best of the author’s knowledge) the only existing tableau constructions to date. [2, 4] being aimed at establishing ... |

23 |
Formal Techniques for Verification of Complex Real-Time Systems
- Geilen
- 2002
(Show Context)
Citation Context ... it |=ν Ψ, then there is some term 〈it, TS, Now, Next〉 ∈ NF (it, Ψ) such that ¯ρ it |= TS(ν) Now, and ¯ρ it |= TS(ν) ○Next. Proofs have been left out due to space limitations. Details=-= can be found in [7]. 5 Tabl-=-eau construction The tableau automaton of an Mitl≤ formula ϕ is computed as follows. (With it ∈ {s, o}, we use it to denote o if it = s and s if it = o.) Definition 6. Let ϕ be a basic Mitl≤ f... |