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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science S. 725 - 737
Hauptverfasser:	Chatterjee, Krishnendu, Henzinger, Thomas A., Otop, Jan
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.07.2015
Schlagworte:	Automata Complexity theory Limit-average value functions Model measuring Monitoring Nested Automata Quantitative properties Robustness Semantics Time factors Weighted Automata
ISSN:	1043-6871
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!