𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Verification of Asynchronous Circuits using Timed Automata

✍ Scribed by Marius Bozga; Hou Jianmin; Oded Maler; Sergio Yovine

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
162 KB
Volume
65
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Real-Time Systems || Verification Using
Real-Time Systems || Verification Using Timed Automata
✍ Cheng, Albert M. K. πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley & Sons, Inc. βš– 192 KB πŸ‘ 2 views

Finite automata and temporal logics have been used extensively to formally verify qualitative properties of concurrent systems. The properties include deadlock-or livelock-freedom, the eventual occurrence of an event, and the satisfaction of a predicate. The need to reason with absolute time is unne

Presburger liveness verification of disc
Presburger liveness verification of discrete timed automata
✍ Zhe Dang; Pierluigi San Pietro; Richard A. Kemmerer πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 259 KB

Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on conΓΏgurations are allowed. While the general problem of checking a temporal logic such as TPTL augmented with Presburger