Files in this item



application/pdfEfficient Monitoring of ω-languages.pdf (284kB)
(no description provided)PDF


Title:Efficient Monitoring of ω-languages
Author(s):d'Amorim, Marcelo; Rosu, Grigore
Subject(s):Formal systems
Abstract:We present a technique for generating efficient monitors for Omega-regular-languages. We show how Buchi automata can be reduced in size and transformed into special, statistically optimal nondeterministic finite state machines, called binary transition tree finite state machines (BTT-FSMs), which recognize precisely the minimal bad prefixes of the original omega-regular-language. The presented technique is implemented as part of a larger monitoring framework and is available for download.
Issue Date:2005-03
Genre:Technical Report
Other Identifier(s):UIUCDCS-R-2005-2530
Rights Information:You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).
Date Available in IDEALS:2009-04-17

This item appears in the following Collection(s)

Item Statistics