نتایج جستجو برای: timed automata

تعداد نتایج: 33410  

Journal: :Theoretical Computer Science 2003

2016
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 technique to analyze such timed systems using finite tree automata instead of finite word automata. Th...

1997
Vineet Gupta Thomas A. Henzinger Radha Jagadeesan

We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighboring trajectories also; and if a robust timed automaton rejects a trajectory, then it must reject neighboring trajectories also. We show that the emptiness problem for robust timed automata is still decidable, by modifying...

2009
Marcin Jurdzinski Marta Z. Kwiatkowska Gethin Norman Ashutosh Trivedi

Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavely-priced probabilistic timed automata for arbitrary initial states. We prove that these problems are EXPTIME-complete for probabilistic timed automata with two or more clocks and PTIME-com...

2009
Marcin Jurdziński Marta Z. Kwiatkowska Gethin Norman Ashutosh Trivedi

Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavely-priced probabilistic timed automata for arbitrary initial states. We prove that these problems are EXPTIME-complete for probabilistic timed automata with two or more clocks and PTIME-com...

Journal: :Theoretical Computer Science 2003

Journal: :IFAC-PapersOnLine 2018

Journal: :Theoretical Computer Science 2006

Journal: :Logical Methods in Computer Science 2012

2010
Ashutosh Trivedi Dominik Wojtczak

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 real-valued variables called clocks. Recursive timed automata are finite collections of timed automata extended with special states that correspond to (potentially recursive) invocations of other timed automata from their...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید