Abstract
Given a timed Buechi automaton G, we present a simplified procedure for computing the untimed language accepted by G, provided certain restrictions are made on the queries along the edges of G. The untimed language accepted by G is given as the language accepted by a Muller automaton. This finite automaton has fewer states than the Buechi automaton Untime(G) defined by Alur and Dill. Essentially in order to test acceptance of a word by G is only necessary to consider clock valuations that map all clocks to integers. Associated properties of the defined good sets of clock valuations are given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.