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

Full description

Saved in:

Bibliographic Details
Published in:	2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 725 - 737
Main Authors:	Chatterjee, Krishnendu, Henzinger, Thomas A., Otop, Jan
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.07.2015
Subjects:	Automata Complexity theory Limit-average value functions Model measuring Monitoring Nested Automata Quantitative properties Robustness Semantics Time factors Weighted Automata
ISSN:	1043-6871
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!