Timed Automata Robustness Analysis via Model Checking
Timed automata (TA) have been widely adopted as a suitable formalism to model time-critical systems. Furthermore, contemporary model-checking tools allow the designer to check whether a TA complies with a system specification. However, the exact timing constants are often uncertain during the design...
Main Authors: | Jaroslav Bendík, Ahmet Sencan, Ebru Aydin Gol, Ivana Černá |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2022-07-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/8375/pdf |
Similar Items
-
Model Checking Flat Freeze LTL on One-Counter Automata
by: Antonia Lechner, et al.
Published: (2018-12-01) -
Logic and Branching Automata
by: Bedon Nicolas
Published: (2015-10-01) -
Inferring Symbolic Automata
by: Dana Fisman, et al.
Published: (2023-04-01) -
Comparator automata in quantitative verification
by: Suguman Bansal, et al.
Published: (2022-07-01) -
Automata theory in nominal sets
by: Mikołaj Bojańczyk, et al.
Published: (2014-08-01)