Cargando…
Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities
Clock-dependent probabilistic timed automata extend classical timed automata with discrete probabilistic choice, where the probabilities are allowed to depend on the exact values of the clocks. Previous work has shown that the quantitative reachability problem for clock-dependent probabilistic timed...
Autor principal: | Sproston, Jeremy |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7281910/ http://dx.doi.org/10.1007/978-3-030-50086-3_9 |
Ejemplares similares
-
Learning One-Clock Timed Automata
por: An, Jie, et al.
Publicado: (2020) -
The clockwork universe. German clocks and automata 1550–1650
por: Lawrence, Christopher
Publicado: (1982) -
Fastbus database and initialisation
por: Botterill, David R
Publicado: (1988) -
Bounded Model Checking for Metric Temporal Logic Properties of Timed Automata with Digital Clocks †
por: Zbrzezny, Agnieszka M., et al.
Publicado: (2022) -
Programmed initialisation of complex data collection and control systems
por: Rimmer, Elsie Margaret
Publicado: (1988)