1 citations · 1 across the 7 of their papers we have counts for
10 papers · 1 filter
Complementing Emerson-Lei Elevator Automata (Technical Report)
Ondrej Alexaj, Vojtěch Havlena, Ondřej Lengál +2
Büchi elevator automata naturally appear in several areas of formal methods as a structural expressibly-equivalent subclass of Büchi automata where every strongly connected compone…
Extending QuAK with Nested Quantitative Automata
Thomas A. Henzinger, Nicolas Mazzocchi, N. Ege Saraç +1
Quantitative automata (QAs) extend finite-state automata on infinite words with weighted transitions to specify quantitative system properties. However, their finite weight sets ru…
Quantitative Language Automata
Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi +1
A quantitative word automaton (QWA) defines a function from infinite words to values. For example, every infinite run of a limit-average QWA A obtains a mean payoff, and every word…
Automating the Analysis of Quantitative Automata with QuAK
Marek Chalupa, Thomas A. Henzinger, Nicolas Mazzocchi +1
Quantitative automata model beyond-boolean aspects of systems: every execution is mapped to a real number by incorporating weighted transitions and value functions that generalize…
QuAK: Quantitative Automata Kit
Marek Chalupa, Thomas A. Henzinger, Nicolas Mazzocchi +1
System behaviors are traditionally evaluated through binary classifications of correctness, which do not suffice for properties involving quantitative aspects of systems and execut…
Safety and Liveness of Quantitative Properties and Automata
Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi +1
Safety and liveness stand as fundamental concepts in formal languages, playing a key role in verification. The safety-liveness classification of boolean properties characterizes wh…