Cargando…
Learning One-Clock Timed Automata
We present an algorithm for active learning of deterministic timed automata with a single clock. The algorithm is within the framework of Angluin’s [Formula: see text] algorithm and inspired by existing work on the active learning of symbolic automata. Due to the need of guessing for each transition...
Autores principales: | An, Jie, Chen, Mingshuai, Zhan, Bohua, Zhan, Naijun, Zhang, Miaomiao |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7439748/ http://dx.doi.org/10.1007/978-3-030-45190-5_25 |
Ejemplares similares
-
Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities
por: Sproston, Jeremy
Publicado: (2020) -
Unbounded-Time Safety Verification of Stochastic Differential Dynamics
por: Feng, Shenghua, et al.
Publicado: (2020) -
The clockwork universe. German clocks and automata 1550–1650
por: Lawrence, Christopher
Publicado: (1982) -
Bounded Model Checking for Metric Temporal Logic Properties of Timed Automata with Digital Clocks †
por: Zbrzezny, Agnieszka M., et al.
Publicado: (2022) -
Indecision and delays are the parents of failure—taming them algorithmically by synthesizing delay-resilient control
por: Chen, Mingshuai, et al.
Publicado: (2020)