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;]

---

Asynchronous wreath product and cascade decompositions for concurrent behaviours

Bharat Adsul ; Paul Gastin ; Saptarshi Sarkar ; Pascal Weil.

We develop new algebraic tools to reason about concurrent behaviours modelled as languages of Mazurkiewicz traces and asynchronous automata. These tools reflect the distributed nature of traces and the underlying causality and concurrency between events, and can be said to support true concurrency.&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;]

---