Filters








7,202 Hits in 5.1 sec

On Timed Automata with Input-Determined Guards [chapter]

Deepak D'Souza, Nicolas Tabareau
2004 Lecture Notes in Computer Science  
We finally use this framework to show that the real-time logic MITL of Alur et al [2] is expressively complete with respect to an MSO corresponding to an appropriate input-determined operator.  ...  We consider a general notion of timed automata with inputdetermined guards and show that they admit a robust logical framework along the lines of [6], in terms of a monadic second order logic characterisation  ...  Timed automata which use guards based on a set of input determined operators are what we call input determined automata.  ... 
doi:10.1007/978-3-540-30206-3_7 fatcat:m2gzdlesajckpkkwcavkyj75ri

On timed automata with input-determined guards [article]

Deepak D'Souza, Nicolas Tabareau
2006 arXiv   pre-print
We consider a general notion of timed automata with input-determined guards and show that they admit a robust logical framework along the lines of [D 'Souza03], in terms of a monadic second order logic  ...  We finally use this framework to show that the real-time logic MITL of Alur et al is expressively complete with respect to an MSO corresponding to an appropriate input-determined operator.  ...  Timed automata which use guards based on a set of input determined operators are what we call input determined automata.  ... 
arXiv:cs/0601096v1 fatcat:qejv5ruadnc7zd432qvumxoxnq

On Continuous Timed Automata with Input-Determined Guards [chapter]

Fabrice Chevalier, Deepak D'Souza, Pavithra Prabhakar
2006 Lecture Notes in Computer Science  
We consider a general class of timed automata parameterized by a set of "input-determined" operators, in a continuous time setting.  ...  Further, we consider natural timed temporal logics based on these operators, and show that they are expressively equivalent to the first-order fragment of the corresponding MSO logics.  ...  Unlike the explicit clock based guards of timed automata, an input-determined guard is based on a distance operator whose value is completely determined by the input timed word and a time point in it.  ... 
doi:10.1007/11944836_34 fatcat:qhf3pxxowvhmrd6ekd54fcbucy

System Testing of Timing Requirements Based on Use Cases and Timed Automata

Chunhui Wang, Fabrizio Pastore, Lionel Briand
2017 2017 IEEE International Conference on Software Testing, Verification and Validation (ICST)  
Inspired by engineering practice in an automotive software development context, we rely on an analyzable form of use case specifications and augment such functional descriptions with timed automata, capturing  ...  timing requirements, following a methodology aiming at minimizing modeling overhead.  ...  approaches based on timed automata.  ... 
doi:10.1109/icst.2017.34 dblp:conf/icst/WangPB17 fatcat:dugcfkd5xravxivaq6orvzrity

A Learning Automata Based Dynamic Guard Channel Scheme [chapter]

Hamid Beigy, Mohammadreza Meybodi
2002 Lecture Notes in Computer Science  
In this paper, the performance evaluation of the CDMA system with complex spreading, imperfect channel estimation, multiple-access near/far interference, and serial/parallel concatenate block coding scheme  ...  Since the parameters of network traffics are unknown and time varying, the optimal number of guard channels is not known and varies with time.  ...  Learning Automata The automata approach to learning involves the determination of an optimal action from a set of allowable actions.  ... 
doi:10.1007/3-540-36087-5_75 fatcat:r7cgdte4d5cnrbzzenjqgo2d4q

From Mtl to Deterministic Timed Automata [chapter]

Dejan Ničković, Nir Piterman
2010 Lecture Notes in Computer Science  
Our construction is based on separation of the continuous time monitoring of the input sequence and discrete predictions regarding the future.  ...  This leads to a doubly exponential construction from MTL to deterministic timed automata, compared with triply exponential using existing approaches.  ...  As monitoring is usually concerned only with finite input sequences, a simple determinization, based on the subset construction, suffices.  ... 
doi:10.1007/978-3-642-15297-9_13 fatcat:ui425nru7zf25eyxhld7m4didy

Qualitative Analysis of State/Event Fault Trees Based on Interface Automata

Gaofeng He, Bingfeng Xu
2021 International Journal of Safety and Security Engineering  
Based on the proposed guarded interface automata and the weak bisimilarity operation, the semantics of SEFT can be precisely determined.  ...  Firstly, we propose the concept of guarded interface automata by adding guards on interface automata transitions. Based on this model, we can describe the triggers and guards of SEFT simultaneously.  ...  Based on interface automata [9] , GIA adds guards on transitions and can precisely describe the triggers and guards of transitions.  ... 
doi:10.18280/ijsse.110606 fatcat:psbwyi2u75ddpnrruf34gonkwq

Towards generation of adaptive test cases from partial models of determinized timed automata

Bernhard K. Aichernig, Florian Lorber
2015 2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW)  
Unfortunately, there is one drawback in using timed automata for test-case generation: if they contain non-determinism or silent transitions, the problem of language inclusion between timed automata becomes  ...  In recent work, we developed and implemented a technique to determinize timed automata up to a certain depth k.  ...  PRELIMINARIES In this paper we consider timed automata with inputs and outputs (TAIOs).  ... 
doi:10.1109/icstw.2015.7107409 dblp:conf/icst/AichernigL15 fatcat:a2svn36jsrcgdblc7klyomoy2i

Combining Black-Box and White-Box Techniques for Learning Register Automata [chapter]

Falk Howar, Bengt Jonsson, Frits Vaandrager
2019 Lecture Notes in Computer Science  
Recently, various techniques have been employed to extend automata learning to extended automata models, which combine control flow with guards and assignments to data variables.  ...  In this paper, we explore some directions for future research on how black-box model learning can be enhanced using white-box information extraction methods, with the aim to maintain the benefits of dynamic  ...  for learning timed automata [36] models which cannot in general be determinized.  ... 
doi:10.1007/978-3-319-91908-9_26 fatcat:jqjz3fm5ivbdni62vt2mukjmle

Adding Dense-Timed Stack to Integer Reset Timed Automata [chapter]

Devendra Bhave, Shibashis Guha
2017 Lecture Notes in Computer Science  
We propose dtIRVPA as a class of timed automata with a dense-timed stack.  ...  Integer reset timed automata (IRTA) are known to be a determinizable subclass of timed automata, but it is not known whether they are input-determined, i.e., the clock values are completely determined  ...  Then we show that strict IRTA are input-determined automata. Definition 1.  ... 
doi:10.1007/978-3-319-67089-8_2 fatcat:rj2b3wr37zf7rdjfsw5secr5ha

CHARDA: Causal Hybrid Automata Recovery via Dynamic Analysis

Adam Summerville, Joseph Osborn, Michael Mateas
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
causes of each transition.CHARDA is easily extended with different classes of model templates, fitting methods, or predicates.In our experiments on a complex videogame character, CHARDA successfully discovers  ...  a reasonable over-approximation of the character's true behaviors.Our results also compare favorably against recent work in automatically learning probabilistic timed automata in an aircraft domain: CHARDA  ...  predicates describing facts in external theories such as collision (e.g., the character was touching an object with appearance A at time t on one side or another).  ... 
doi:10.24963/ijcai.2017/390 dblp:conf/ijcai/SummervilleOM17 fatcat:hnf5ztimc5fkrkut6xzg7wvgke

CHARDA: Causal Hybrid Automata Recovery via Dynamic Analysis [article]

Adam Summerville, Joseph Osborn, Michael Mateas
2017 arXiv   pre-print
Our results also compare favorably against recent work in automatically learning probabilistic timed automata in an aircraft domain: CHARDA exactly learns the modes of these simpler automata.  ...  CHARDA is easily extended with different classes of model templates, fitting methods, or predicates.  ...  predicates describing facts in external theories such as collision (e.g., the character was touching an object with appearance A at time t on one side or another).  ... 
arXiv:1707.03336v1 fatcat:gbxygb7dhnatbhmpntf2vhcoxq

A Framework for Identification and Validation of Affine Hybrid Automata from Input-Output Traces

Xiaodong Yang, Omar Ali Beg, Matthew Kenigsberg, Taylor T Johnson
2022 ACM Transactions on Cyber-Physical Systems  
In this paper, we propose and evaluate a framework for inferring and validating models of deterministic hybrid systems with linear ordinary differential equations (ODEs) from input/output execution traces  ...  However, for realistic systems, especially industrial ones, identifying hybrid automata is challenging, due in part to inferring hybrid interactions, which involves inference of both continuous behaviors  ...  Overview of the framework proposed in this paper to learn hybrid automata with linear (affine) ODEs, guards, invariants, and resets from time-series data (traces). Fig. 2 .  ... 
doi:10.1145/3470455 fatcat:eb6wpsfsgzemtkj4ujt4svmfga

A Event Occurrence Rules based Compact Modeling Formalism for a Class of Discrete Event Systems

V. CHANDRA, R. Kumar
2002 Mathematical and Computer Modelling of Dynamical Systems  
Under the new modeling formalism the size of the system model is polynomial in the number of signals; whereas the number of states in the commonly used automata models is exponential in the number of signals  ...  An automaton transitions from one state to another in response to the execution of an event provided a certain guard condition is satisfied. Such automata with guards are known as extended automata.  ...  For this, we may include certain "timed guards" along with the "untimed guards" in any rule. Consider for example the "untimed rule" for an event σ with the untimed guard condition G σ : G σ ⇒ σ.  ... 
doi:10.1076/mcmd.8.1.49.8338 fatcat:yow3cokcj5guznct44d42lanwa

Challenges and Tool Implementation of Hybrid Rapidly-Exploring Random Trees [chapter]

Stanley Bak, Sergiy Bogomolov, Thomas A. Henzinger, Aviral Kumar
2017 Lecture Notes in Computer Science  
In particular, we focus on handling non-determinism, which arises due to discrete transitions. We introduce the notion of important points to account for this phenomena.  ...  We showcase our ideas using heater and navigation benchmarks. 6 G − → G (qi,qj ) , where G (qi,qj ) ⊆ X qi is the guard condition associated with (q i , q j ) ∈ E -J maps discrete transitions to reset  ...  Non-determinism Handling We recall that hybrid automata exhibit non-determinism due to discrete mode switches.  ... 
doi:10.1007/978-3-319-63501-9_6 fatcat:qsub72mjkrdkjmftbles5uccye
« Previous Showing results 1 — 15 out of 7,202 results