Filters








253 Hits in 2.5 sec

A determinizable class of timed automata [chapter]

Rajeev Alur, Limor Fix, Thomas A. Henzinger
1994 Lecture Notes in Computer Science  
WVe now show tha.t the event-clock automata, form a, determinizable subiclass of the timed automata. Theorem 1 (Determinization).  ...  A Determinizable Class of Timed Automata loin sysL~erns t~o everit.nrcuirii rig ai Lorrnala., which lerads Lo anl algorhittnr it~iir or checýkirig ir t.wo 1.1 iTId I .ra isii)n ri yaLernis h ave I.hte  ... 
doi:10.1007/3-540-58179-0_39 fatcat:ntr522vuofheji2zzskhdhkixi

Event-clock automata: a determinizable class of timed automata

Rajeev Alur, Limor Fix, Thomas A. Henzinger
1999 Theoretical Computer Science  
The class of event-recording automata is, on one hand, expressive enough to model (finite) timed transition systems and, on the other hand, determinizable and closed under all boolean operations.  ...  We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a.  ...  In this paper, we obtain a determinizable class of timed automata by restricting the use of clocks.  ... 
doi:10.1016/s0304-3975(97)00173-4 fatcat:xtvmzivdmjfflnmnnjl4f3i4v4

A game approach to determinize timed automata

Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen
2014 Formal methods in system design  
However, not all timed automata can be determinized, and determinizability itself is undecidable.  ...  Timed automata are frequently used to model real-time systems. Their determinization is a key issue for several validation problems.  ...  Following the same ideas, we explain how to naturally extend the class of event-clock timed automata into a class determinizable by our game-based approach.  ... 
doi:10.1007/s10703-014-0220-1 fatcat:74kr4obbvvcjpclba4extvmafa

A Game Approach to Determinize Timed Automata [chapter]

Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen
2011 Lecture Notes in Computer Science  
However, not all timed automata can be determinized, and determinizability itself is undecidable.  ...  Timed automata are frequently used to model real-time systems. Their determinization is a key issue for several validation problems.  ...  Following the same ideas, we explain how to naturally extend the class of event-clock timed automata into a class determinizable by our game-based approach.  ... 
doi:10.1007/978-3-642-19805-2_17 fatcat:6v4nqyezjrhrfbqf4by65tc4iq

On the Determinization of Timed Systems [chapter]

Patricia Bouyer, Samy Jaziri, Nicolas Markey
2017 Lecture Notes in Computer Science  
We give a condition for determinizability of automata over a timed domain without changing the timed domain, which allows us to recover several known determinizable classes of timed systems, such as strongly-non-zeno  ...  We introduce a new formalism called automata over a timed domain which provides an adequate framework for the determinization of timed systems.  ...  It is proved in [BBBB09] that the class of strongly-non-Zeno timed automata is determinizable.  ... 
doi:10.1007/978-3-319-65765-3_2 fatcat:wmmoj5glf5h2piz3b7qpq7futq

A Logical Characterization for Dense-Time Visibly Pushdown Automata [chapter]

Devendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade, Ashutosh Trivedi
2016 Lecture Notes in Computer Science  
We present MSO logic characterization of these automata and prove the decidability of the emptiness problem for these automata paving way for verification problem for dense-timed pushdown automata against  ...  against visibly pushdown automata specification and timed automata implementation against event-clock timed automata specification, respectively.  ...  Event-clock automata [3] are a determinizable subclass of timed automata that enjoy a nice set of closure properties: they are closed under union, intersection, complementation, determinization, and  ... 
doi:10.1007/978-3-319-30000-9_7 fatcat:e5a345g5fbbapkyriexzp2wnke

When Are Timed Automata Determinizable? [chapter]

Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye
2009 Lecture Notes in Computer Science  
The boundedness condition is satisfied by several subclasses of timed automata, some of them were known to be determinizable (eventclock timed automata, automata with integer resets), but some others were  ...  As a corollary of those constructions, we get for those classes the decidability of the universality and of the inclusion problems, and compute their complexities (the inclusion problem is for instance  ...  Some classes of timed automata are determinizable Automata satisfying the p-assumption (TA p ).  ... 
doi:10.1007/978-3-642-02930-1_4 fatcat:zvqksx6grfapln2kdngmnvbpsu

On Delay and Regret Determinization of Max-Plus Automata [article]

Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez,, Jean-François Raskin
2017 arXiv   pre-print
Decidability of the determinization problem for weighted automata over the semiring (Z∪-∞, , +), WA for short, is a long-standing open question.  ...  A WA N is k-delay determinizable if there exists a deterministic automaton D that defines the same function as N and for all words α in the language of N, the accepting run of D on α is always at most  ...  However, there are classes C for which a WA is approximately C-determinizable if and only if it is C-determinizable, making approximate determinization much less interesting for such classes.  ... 
arXiv:1701.02903v2 fatcat:fe7au55g35c3toncr5urp6kkq4

On delay and regret determinization of max-plus automata

Emmanuel Filiot, Ismael Jecker, Nathan Lhote, Guillermo A. Perez, Jean-Francois Raskin
2017 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)  
Decidability of the determinization problem for weighted automata over the semiring (Z∪{−∞}, max, +), WA for short, is a long-standing open question.  ...  A WA N is k-delay determinizable if there exists a deterministic automaton D that defines the same function as N and for all words α in the language of N , the accepting run of D on α is always at most  ...  (A second example of a bounded-delay determinizable automaton is shown in Fig. 2.) Second, we consider the class Hom of so-called homomorphic DWA.  ... 
doi:10.1109/lics.2017.8005096 dblp:conf/lics/FiliotJLPR17 fatcat:labvfd5ghrdsji3n4n4ao4ueqe

Quantitative Languages Defined by Functional Automata [chapter]

Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin
2012 Lecture Notes in Computer Science  
The results on functionality and determinizability are expressed for the more general class of functional group automata.  ...  Ratio automata do not fit within this general scheme and different techniques are required to decide functionality. ACM CCS: [Theory of computation]: Formal languages and automata theory.  ...  Acknowledgement We are very grateful to the anonymous referees for their valuable comments on preliminary versions of this paper.  ... 
doi:10.1007/978-3-642-32940-1_11 fatcat:cpnr6veurbcwfclhikf347zcc4

Undecidable Problems About Timed Automata [chapter]

Olivier Finkel
2006 Lecture Notes in Computer Science  
In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a timed regular language is timed regular.  ...  We show that the problem of the minimization of the number of clocks of a timed automaton is undecidable. It is also undecidable whether the shuffle of two timed regular languages is timed regular.  ...  Thanks to the anonymous referees for useful comments on a preliminary version of this paper.  ... 
doi:10.1007/11867340_14 fatcat:iveibc2i7jcfjejunt2ciebdo4

Off-line test selection with test purposes for non-deterministic timed automata

Nathalie Bertrand, Thierry Jéron, Amélie Stainer, Moez Krichen, Parosh Abdulla
2012 Logical Methods in Computer Science  
In this context, a first problem is the determinization of TAIOs, which is necessary to foresee next enabled actions after an observable trace, but is in general impossible because not all timed automata  ...  Properties of test cases are then analyzed with respect to the precision of the approximate determinization: when determinization is exact, which is the case on known determinizable classes, in addition  ...  A Model of Open Timed Automata with Inputs/Outputs Timed automata (TAs) [1] is a usual model for time constrained systems.  ... 
doi:10.2168/lmcs-8(4:8)2012 fatcat:vkakl7v43zb3fggt76jhe2mjni

Quantitative Languages Defined by Functional Automata

Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin, Orna Kupferman
2015 Logical Methods in Computer Science  
The results on functionality and determinizability are expressed for the more general class of functional group automata.  ...  In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges and the ratio between rewards and costs.  ...  Acknowledgement We are very grateful to the anonymous referees for their valuable comments on preliminary versions of this paper.  ... 
doi:10.2168/lmcs-11(3:14)2015 fatcat:d3uocaeonzgqnfns7w26hpkm44

Rigorous Approximated Determinization of Weighted Automata

Benjamin Aminof, Orna Kupferman, Robby Lampert
2011 2011 IEEE 26th Annual Symposium on Logic in Computer Science  
Formally, for all words w ∈ Σ * , the value of w in A ′ is at least its value in A and at most t times its value in A.  ...  Applications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing.  ...  In Section IV we discuss tdeterminizability and the class of WFAs that our algorithm t-determinizes.  ... 
doi:10.1109/lics.2011.50 dblp:conf/lics/AminofKL11 fatcat:z47qyvyc7faepkhrqxqsjpvaqa

Durational Actions Timed Automata: Determinization and Expressiveness

Ilham Kitouni, Hiba Hachichi, Kenza Bouarroudj, Djamel-Eddine Saidouni
2012 International Journal of Applied Information Systems  
Then, we compare a durational actions timed automata to event recording automata, which is a determinizable sub class of the classical timed automata.  ...  In this paper we present durational actions timed automata, DATA*, as a sub class of timed automata.  ...  Second, discuss T.A class which considers duration of actions. An interesting quest has been done to find determinizable and Boolean closed sub-classes of timed automata.  ... 
doi:10.5120/ijais12-450609 fatcat:sl3sxwfoajee5lyyfthdbnntdm
« Previous Showing results 1 — 15 out of 253 results