Comparator automata in quantitative verification
The notion of comparison between system runs is fundamental in formal verification. This concept is implicitly present in the verification of qualitative systems, and is more pronounced in the verification of quantitative systems. In this work, we identify a novel mode of comparison in quantitative...
Main Authors: | Suguman Bansal, Swarat Chaudhuri, Moshe Y. Vardi |
---|---|
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/5050/pdf |
Similar Items
-
Inferring Symbolic Automata
by: Dana Fisman, et al.
Published: (2023-04-01) -
Logic and Branching Automata
by: Bedon Nicolas
Published: (2015-10-01) -
Automata theory in nominal sets
by: Mikołaj Bojańczyk, et al.
Published: (2014-08-01) -
Cost Preserving Bisimulations for Probabilistic Automata
by: Andrea Turrini, et al.
Published: (2014-12-01) -
Partially Ordered Automata and Piecewise Testability
by: Tomáš Masopust, et al.
Published: (2021-05-01)