Search

• < Previous
• 1
• Next >

---

Analyzing Timed Systems Using Tree Automata

S. Akshay ; Paul Gastin ; Shankara Narayanan Krishna.

Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract properties, such as state reachability. We propose a new&nbsp;[&hellip;]

---

On Robustness for the Skolem, Positivity and Ultimate Positivity Problems

S. Akshay ; Hugo Bazille ; Blaise Genest ; Mihir Vahanwala.

The Skolem problem is a long-standing open problem in linear dynamical systems: can a linear recurrence sequence (LRS) ever reach 0 from a given initial configuration? Similarly, the positivity problem asks whether the LRS stays positive from an initial configuration. Deciding Skolem (or positivity)&nbsp;[&hellip;]

---

Simulations for Event-Clock Automata

S Akshay ; Paul Gastin ; R Govind ; B Srivathsan.

Event-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and are practically useful to capture timed specifications. However, unlike for timed automata, there exist no implementations for checking&nbsp;[&hellip;]

---