A survey of timed automata for the development of real-time systems
Timed automata are a popular formalism to model real-time systems. They were introduced
two decades ago to support formal verification. Since then they have also been used for …
two decades ago to support formal verification. Since then they have also been used for …
Interprocedural analysis of asynchronous programs
R Jhala, R Majumdar - ACM SIGPLAN Notices, 2007 - dl.acm.org
An asynchronous program is one that contains procedure calls which are not immediately
executed from the callsite, but stored and" dispatched" in a non-deterministic order by an …
executed from the callsite, but stored and" dispatched" in a non-deterministic order by an …
Dense-timed pushdown automata
PA Abdulla, MF Atig, J Stenman - 2012 27th Annual IEEE …, 2012 - ieeexplore.ieee.org
We propose a model that captures the behavior of real-time recursive systems. To that end,
we introduce dense-timed pushdown automata that extend the classical models of …
we introduce dense-timed pushdown automata that extend the classical models of …
Recursive timed automata
A Trivedi, D Wojtczak - … on Automated Technology for Verification and …, 2010 - Springer
We study recursive timed automata that extend timed automata with recursion. Timed
automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of …
automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of …
Time-bounded verification
We study the decidability and complexity of verification problems for timed automata over
time intervals of fixed, bounded length. One of our main results is that time-bounded …
time intervals of fixed, bounded length. One of our main results is that time-bounded …
Decidability results for well-structured transition systems with auxiliary storage
R Chadha, M Viswanathan - International Conference on Concurrency …, 2007 - Springer
We consider the problem of verifying the safety of well-structured transition systems (WSTS)
with auxiliary storage. WSTSs with storage are automata that have (possibly) infinitely many …
with auxiliary storage. WSTSs with storage are automata that have (possibly) infinitely many …
Towards a theory of time-bounded verification
J Ouaknine, J Worrell - International Colloquium on Automata, Languages …, 2010 - Springer
We propose a theory of time-bounded verification for real-time systems, in which verification
queries are phrased over time intervals of fixed, bounded duration. We argue that this theory …
queries are phrased over time intervals of fixed, bounded duration. We argue that this theory …
The minimal cost reachability problem in priced timed pushdown systems
PA Abdulla, MF Atig, J Stenman - … , LATA 2012, A Coruña, Spain, March 5 …, 2012 - Springer
This paper introduces the model of priced timed pushdown systems as an extension of
discrete-timed pushdown systems with a cost model that assigns multidimensional costs to …
discrete-timed pushdown systems with a cost model that assigns multidimensional costs to …
[PDF][PDF] Timed automata for the development of real-time systems
Timed automata are a popular formalism to model real-time systems. They were introduced
two decades ago to support formal verification. Since then they have also been used for …
two decades ago to support formal verification. Since then they have also been used for …
Event-clock visibly pushdown automata
N Van Tang, M Ogawa - International Conference on Current Trends in …, 2009 - Springer
We introduce the class of event-clock visibly pushdown automata (ECVPAs) as an extension
of event-clock automata. The class of ECVPAs, on one hand, can model simple real-time …
of event-clock automata. The class of ECVPAs, on one hand, can model simple real-time …