Timed automata are state-machine-like structures used to model real-time systems. Since
their invention in the early 1990s, a number of often subtly differing variants have appeared …

We show that max-plus polyhedra are usable as a data structure in reachability analysis of
timed automata. Drawing inspiration from the extensive work that has been done on …

This paper presents a method for abstracting continuous dynamical systems by timed
automata. The abstraction is based on partitioning the state space of a dynamical system …

In tabletop storytelling, a 3D animated story is presented to the viewer as a hologram on a
given plane in reality such as a tabletop. Every 3D animated story can be presented in …

To enable formal verification of a dynamical system, given by a set of differential equations, it
is abstracted by a finite state model. This allows for application of methods for model …

The electronic devices that we interact with on a daily basis have become ubiquitous and
have infiltrated many aspects of our life. Thinking about the future, it can be expected that …

The goal of model checking is verifying that a system adheres to its specification. The model
checking tool UPPAAL verifies Timed Automata and returns diagnostic traces to help users …

This article aims at providing a concise and precise Travellers Guide, Phrase Book or
Reference Manual to the timed automata modeling formalism introduced by Alur and Dill [8 …

This article aims at providing a concise and precise Traveler's Guide, Phrase Book or
Reference Manual to the timed automata modeling formalism introduced by Alur and Dill [7 …

We describe how to use max-plus algebra for model checking. We provide conversions from
zone constraints to max-plus algebra. We give efficient algorithms for the basic operations …