Cargando…
Timed Automata Relaxation for Reachability
Timed automata (TA) have shown to be a suitable formalism for modeling real-time systems. Moreover, modern model-checking tools allow a designer to check whether a TA complies with the system specification. However, the exact timing constraints of the system are often uncertain during the design pha...
Autores principales: | Bendík, Jaroslav, Sencan, Ahmet, Gol, Ebru Aydin, Černá, Ivana |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7979188/ http://dx.doi.org/10.1007/978-3-030-72016-2_16 |
Ejemplares similares
-
Verified Certification of Reachability Checking for Timed Automata
por: Wimmer, Simon, et al.
Publicado: (2020) -
MUST: Minimal Unsatisfiable Subsets Enumeration Tool
por: Bendík, Jaroslav, et al.
Publicado: (2020) -
AVR: Abstractly Verifying Reachability
por: Goel, Aman, et al.
Publicado: (2020) -
Directed Reachability for Infinite-State Systems
por: Blondin, Michael, et al.
Publicado: (2021) -
Carnot efficiency is reachable in an irreversible process
por: Lee, Jae Sung, et al.
Publicado: (2017)