Filters








4,263 Hits in 3.4 sec

Learning One-Clock Timed Automata [chapter]

Jie An, Mingshuai Chen, Bohua Zhan, Naijun Zhan, Miaomiao Zhang
2020 Lecture Notes in Computer Science  
We present an algorithm for active learning of deterministic timed automata with a single clock.  ...  The algorithm is within the framework of Angluin's L * algorithm and inspired by existing work on the active learning of symbolic automata.  ...  A passive learning algorithm for timed automata with one clock was further proposed in [39, 40] .  ... 
doi:10.1007/978-3-030-45190-5_25 fatcat:np3bpm3fzjch5oeowjrwos6l3m

Learning One-Clock Timed Automata [article]

Jie An, Mingshuai Chen, Bohua Zhan, Naijun Zhan, Miaomiao Zhang
2020 arXiv   pre-print
We present an algorithm for active learning of deterministic timed automata with a single clock.  ...  The algorithm is within the framework of Angluin's L^* algorithm and inspired by existing work on the active learning of symbolic automata.  ...  A passive learning algorithm for timed automata with one clock was further proposed in [38, 39] .  ... 
arXiv:1910.10680v3 fatcat:mhunf4uw6zdxnmhy3mb32c7mnq

Statistical Models Of Network Traffic

Barath Kumar, Oliver Niggemann, Juergen Jasperneite
2010 Zenodo  
But one bottleneck often prevents the introduction of these ideas: Manual modeling is a non-trivial, time-consuming task.  ...  Automatically deriving models by observing and analyzing running systems is one possible way to amend this bottleneck.  ...  It has only one clock that represents the time delay between two consecutive events in terms of relative time (unlike other timed automata which have finite number of clocks and clock guards for each transition  ... 
doi:10.5281/zenodo.1055518 fatcat:rdkst7haazal3m437ysl5qzpma

Learning Timed Automata via Genetic Programming [article]

Martin Tappler, Bernhard K. Aichernig, Kim Guldstrand Larsen, Florian Lorber
2019 arXiv   pre-print
In this paper, we present a method for learning timed automata, finite state machines extended with real-valued clocks.  ...  Current work focuses on learning variations of finite state machines. However, most techniques consider discrete time.  ...  Timed Automata Timed automata are finite automata enriched with realvalued variables called clocks [9] .  ... 
arXiv:1808.07744v3 fatcat:x4hxcuortfcsjdi7mxuxz35moa

Inference of Timed Transition Systems

Olga Grinchtein, Bengt Jonsson, Martin Leucker
2005 Electronical Notes in Theoretical Computer Science  
We extend Angluin's algorithm for on-line learning of regular languages to the setting of timed transition systems.  ...  More specifically, we describe a procedure for inferring systems that can be described by event-recording automata by asking a sequence of membership queries (does the system accept a given timed word?  ...  Conclusion In this paper, we presented a technique for learning timed transitions systems based on their representation as event-recording automata (ERA).  ... 
doi:10.1016/j.entcs.2005.02.062 fatcat:c6ibadx2undxbme4hpt2tqun3y

Learning of event-recording automata

Olga Grinchtein, Bengt Jonsson, Martin Leucker
2010 Theoretical Computer Science  
Since timed automata can freely use an arbitrary number of clocks, we restrict our attention to systems that can be described by deterministic event-recording automata (DERAs).  ...  We extend Angluin's algorithm for on-line learning of regular languages to the setting of timed systems.  ...  The only other work on learning of timed systems we are aware is by Verwer et al. [34] , who present an algorithm for learning of timed automata with one clock which is reset at every transition.  ... 
doi:10.1016/j.tcs.2010.07.008 fatcat:5bpietfzznhv5ahhoaayu6jfl4

Learning of Event-Recording Automata [chapter]

Olga Grinchtein, Bengt Jonsson, Martin Leucker
2004 Lecture Notes in Computer Science  
Since timed automata can freely use an arbitrary number of clocks, we restrict our attention to systems that can be described by deterministic event-recording automata (DERAs).  ...  We extend Angluin's algorithm for on-line learning of regular languages to the setting of timed systems.  ...  The only other work on learning of timed systems we are aware is by Verwer et al. [34] , who present an algorithm for learning of timed automata with one clock which is reset at every transition.  ... 
doi:10.1007/978-3-540-30206-3_26 fatcat:ztpcqrszbfagvmh3ckolkgzcjq

Polynomial Distinguishability of Timed Automata [chapter]

Sicco Verwer, Mathijs de Weerdt, Cees Witteveen
2008 Lecture Notes in Computer Science  
Last but not least, we prove that deterministic timed automata with one clock are polynomially distinguishable, which makes them very likely to be efficiently identifiable in the limit.  ...  We study the complexity of identifying (learning) timed automata in the limit from data. Timed automata are finite state models that model time explicitly, i.e., using numbers.  ...  Acknowledgement We would like to thank Pieter Adriaans for the helpful comments on an early draft of this paper.  ... 
doi:10.1007/978-3-540-88009-7_19 fatcat:ui7x2vogtrdrdn65rp2gzutoau

Towards Model-Based Support For Regression Testing

Anna Gujgiczer, Márton Elekes, Oszkár Semeráth, András Vörös
2017 Zenodo  
In this paper we introduce a model-based technique to make regression testing more efficient by focusing on the user-defined properties of the system-under-test.  ...  ACKNOWLEDGMENT This work was partially supported by the MTA-BME Lendület Research Group on Cyber-Physical Systems and theÚNKP-16-1-I.  ...  The input interface of this chess clock contains four buttons (Start, Mode, White and Black) and the output interface consists of three displays (Main, White time, Black time). B.  ... 
doi:10.5281/zenodo.291893 fatcat:fcjmtuwlardwhjfvoxn4ptxkgy

An Efficient Algorithm for Learning Event-Recording Automata [chapter]

Shang-Wei Lin, Étienne André, Jin Song Dong, Jun Sun, Yang Liu
2011 Lecture Notes in Computer Science  
In this work, we propose an efficient polynomial time learning algorithm, TL * , for timed regular language accepted by event-recording automata.  ...  Given an unknown timed regular language, TL * first learns a DFA accepting the untimed version of the timed language, and then passively refines the DFA by adding time constraints.  ...  This work benefited from the discussions via e-mails with Olga Grinchtein, one of the authors of [7, 8] .  ... 
doi:10.1007/978-3-642-24372-1_35 fatcat:vplzk3wufjcx5a4w6t5mnvuj6u

Utilization of Timed Automata as a Verification Tool for Security Protocols

Ahmet Koltuksuz, Burcu Kulahcioglu, Murat Ozkan
2010 2010 Fourth International Conference on Secure Software Integration and Reliability Improvement Companion  
One of the application areas of timed automata is the verification of security protocols which are known to be time sensitive.  ...  Timed Automata is an extension to the automatatheoretic approach for the modeling of real time systems that introduces time into the classical automata.  ...  Timed automata is proposed as an extension to the automata-theoretic approach, which is extended with clock variables.  ... 
doi:10.1109/ssiri-c.2010.27 dblp:conf/ssiri/KoltuksuzKO10 fatcat:ldbgb26ytzelznjxflgaair7na

One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit [chapter]

Sicco Verwer, Mathijs de Weerdt, Cees Witteveen
2009 Lecture Notes in Computer Science  
We study the complexity of identifying (learning) timed automata in the limit from data.  ...  In this paper, we show this is also sufficient: we provide an algorithm that identifies one-clock deterministic timed automata efficiently in the limit.  ...  ., identifying one-clock deterministic timed automata, we focus on the case where the TAs are deterministic and contain at most a single clock.  ... 
doi:10.1007/978-3-642-00982-2_63 fatcat:kybqln6cijgjtcszmjsqwn6mre

Interval Approach to Parallel Timed Systems Verification [chapter]

Yuri G. Karpov, Dmitry Sotnikov
2003 Lecture Notes in Computer Science  
While the approach can be used for any timed automaton (see section 3) we will first demonstrate it on a simplified class of timed automata, which we call 'interval automata': a.  ...  Now all we need to construct G A is to learn how to update the inter-event intervals once a transition is taken and one (or more) automaton changes its location.  ... 
doi:10.1007/978-3-540-45145-7_9 fatcat:brbqakazhnctbllwlk2n2skwxu

Inference of Event-Recording Automata Using Timed Decision Trees [chapter]

Olga Grinchtein, Bengt Jonsson, Paul Pettersson
2006 Lecture Notes in Computer Science  
One of the most popular model for timed system is timed automata.  ...  Since timed automata can freely use an arbitrary number of clocks, we restrict our attention to systems that can be described by event-recording automata (DERAs).  ...  Verwer et. al [VdWW06] present an algorithm for passive learning of timed automata with one clock which is reset at every transition.  ... 
doi:10.1007/11817949_29 fatcat:z2b73y6q5ncxbgfa6ccatrs3g4

Modeling User Behaviour By Planning

Alfredo Milani, Silvia Suriani
2008 Zenodo  
A general technique for transforming a timed finite state automata description of the behaviour into a numerical parameter planning model is introduced.  ...  The behaviour of users of web interactive systems can be described in term of a planning domain encapsulating the timed actions patterns representing the intended user profile.  ...  , transition table for the automata, each transition e∈E is a 5-ple e=<s,s',a,Λ,δ> representing a transition from state s to state s' on input symbol a which can occur at a certain time τ when clock  ... 
doi:10.5281/zenodo.1071501 fatcat:eb2wr3pkrjfitpjv3dpzslrigu
« Previous Showing results 1 — 15 out of 4,263 results