Nested Weighted Automata

Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties...

Celý popis

Podrobná bibliografia

Vydané v:	2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science s. 725 - 737
Hlavní autori:	Chatterjee, Krishnendu, Henzinger, Thomas A., Otop, Jan
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.07.2015
Predmet:	Automata Complexity theory Limit-average value functions Model measuring Monitoring Nested Automata Quantitative properties Robustness Semantics Time factors Weighted Automata
ISSN:	1043-6871
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!