Results 1  10
of
30
Are Timed Automata Updatable?
, 2000
"... In classical timed automata, as de ned by Alur and Dill [AD90, AD94] and widely since studied, the only operation allowed to modify the clocks is the reset operation. For instance, a clock can neither be set to a nonnull constant value, nor be set to the value of another clock, nor, in a nondeterm ..."
Abstract

Cited by 42 (10 self)
 Add to MetaCart
In classical timed automata, as de ned by Alur and Dill [AD90, AD94] and widely since studied, the only operation allowed to modify the clocks is the reset operation. For instance, a clock can neither be set to a nonnull constant value, nor be set to the value of another clock, nor, in a nondeterministic way, to some value lower or higher than a given constant. In this paper we study in details such updates which can be very useful for modelization purposes. We characterise in a thin way the frontier between decidable and undecidable. Our main contributions are the following:  We exhibit many classes of updates for which emptiness is undecidable. A surprising result is that these classes depend on the clock constraints that are used diagonalfree or not whereas it is well known that these two kinds of constraints are equivalent for classical timed automata.  We propose a generalization of the region automaton proposed by Alur and Dill to handle with larger classes of updates. ...
Static guard analysis in timed automata verification
 In TACAS
, 2003
"... Abstract. By definition Timed Automata have an infinite statespace, thus for verification purposes, an exact finite abstraction is required. We propose a locationbased finite zone abstraction, which computes an abstraction based on the relevant guards for a particular state of the model (as opposed ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
Abstract. By definition Timed Automata have an infinite statespace, thus for verification purposes, an exact finite abstraction is required. We propose a locationbased finite zone abstraction, which computes an abstraction based on the relevant guards for a particular state of the model (as opposed to all guards). We show that the locationbased zone abstraction is sound and complete with respect to location reachability; that it generalises activeclock reduction, in the sense that an inactive clock has no relevant guards at all; that it enlarges the class of timed automata, that can be verified. We generalise the new abstraction to the case of networks of timed automata, and experimentally demonstrate a potentially exponential speedup compared to the usual abstraction. 1
Folk theorems on the determinization and minimization of timed automata
 In Proceedings of FORMATS 03
, 2003
"... wwwverimag.imag.fr Abstract. Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not algorithmically solvable, if we require not just a yes/no answer, but also a witness. Mini ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
wwwverimag.imag.fr Abstract. Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not algorithmically solvable, if we require not just a yes/no answer, but also a witness. Minimizing the “resources ” of a TA (number of clocks or size of constants) are also unsolvable problems. Proofs are provided as simple reductions from the universality problem. These proofs are not applicable to the corresponding decision problems, the decidability of which remains open. 1
A survey on continuous time computations
 New Computational Paradigms
"... Abstract. We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing resu ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Abstract. We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing results, and point to relevant references in the literature. 1
A KLEENE/BÜCHILIKE THEOREM FOR CLOCK LANGUAGES
, 2002
"... We propose in this paper a generalization of the famous Kleene/Büchi's theorem on formal languages, one of the cornerstones of theoretical computer science, to the timed model of clock languages. These languages extend the now classical timed languages introduced by Alur and Dill as a suitable ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
We propose in this paper a generalization of the famous Kleene/Büchi's theorem on formal languages, one of the cornerstones of theoretical computer science, to the timed model of clock languages. These languages extend the now classical timed languages introduced by Alur and Dill as a suitable model for realtime systems. As a corollary of our main result, we get a simple algebraic characterization of timed languages recognized by (updatable) timed automata.
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
, 2006
"... Timed Petri nets and timed automata are two standard models for the analysis of realtime systems. In this paper, we prove that they are incomparable for the timed language equivalence. Thus we propose an extension of timed Petri nets with readarcs (RATdPN), whose coverability problem is decidabl ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Timed Petri nets and timed automata are two standard models for the analysis of realtime systems. In this paper, we prove that they are incomparable for the timed language equivalence. Thus we propose an extension of timed Petri nets with readarcs (RATdPN), whose coverability problem is decidable. We also show that this model unifies timed Petri nets and timed automata. Then, we establish numerous expressiveness results and prove that zeno behaviours discriminate between several subclasses of RATdPNs. This has surprising consequences on timed automata, for instance on the power of nondeterministic clock resets.
When are timed automata weakly timed bisimilar to time Petri nets?
 25TH CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2005), HYDERABAD, INDIA LNCS
, 2005
"... In this paper, we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly included in the class of TA. It is thus natural to try and identify the subclass T A wtb of TA equivalent to some TPN for t ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
In this paper, we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly included in the class of TA. It is thus natural to try and identify the subclass T A wtb of TA equivalent to some TPN for the weak timed bisimulation relation. We give a characterization of this subclass and we show that the membership problem and the reachability problem for T A wtb are PSPACEcomplete. Furthermore we show that for a TA in T A wtb with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.
Model Checking Timed Automata
"... Currently, formal verification of reactive, critical or embedded systems is a crucial problem, and automatic verification, more specifically model checking, has been widely developed during the last 20 years (see [CLA 99, SCH 01] for surveys). In this approach, we build a formal model M (e.g. an aut ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Currently, formal verification of reactive, critical or embedded systems is a crucial problem, and automatic verification, more specifically model checking, has been widely developed during the last 20 years (see [CLA 99, SCH 01] for surveys). In this approach, we build a formal model M (e.g. an automaton, Petri net, etc.) describing
Timed P Automata
 MECBIC 2008
, 2008
"... To study systems whose dynamics changes with time, an extension of timed P systems is introduced in which evolution rules may vary with time. The proposed model is a timed automaton with a discrete time domain and in which each state is a timed P system. A result on expressive power and on features ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
To study systems whose dynamics changes with time, an extension of timed P systems is introduced in which evolution rules may vary with time. The proposed model is a timed automaton with a discrete time domain and in which each state is a timed P system. A result on expressive power and on features of the formalism sufficient for full expressiveness is proved and, as an application example, the model of an ecological system is given.