An Automata - Based Approach for Subsumption w . r . t . General
نویسنده
چکیده
Selbstständigkeitserklärung Hiermit erkläre ich, dass ich diese Arbeit selbstständig erstellt und keine an-deren als die angegebenen Hilfsmittel benutzt habe.
منابع مشابه
Efficient Büchi Universality Checking
The complementation of Büchi automata, required for checking automata universality, remains one of the outstanding automata-theoretic challenges in formal verification. Early constructions using a Ramsey-based argument have been supplanted by rank-based constructions with exponentially better bounds. The best rank-based algorithm for Büchi universality, by Doyen and Raskin, employs a subsumptio...
متن کاملSimulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing
There are two main classes of methods for checking universality and language inclusion of Büchi-automata: Rank-based methods and Ramsey-based methods. While rank-based methods have a better worst-case complexity, Ramsey-based methods have been shown to be quite competitive in practice [9, 8]. It was shown in [9] (for universality checking) that a simple subsumption technique, which avoids explo...
متن کاملChair for Automata Theory LTCS – Report SAT Encoding of Unification in ELH R + w . r . t . Cycle - Restricted
Unification in Description Logics has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. For the Description Logic EL, which is used to define several large biomedical ontologies, unification is NP-complete. An NP unification algorithm for EL based on a translation into propositional satisfiability (SAT) has recently been presented. In thi...
متن کاملBL-general fuzzy automata and minimal realization: Based on the associated categories
The present paper is an attempt to study the minimal BL-general fuzzy automata which realizes the given fuzzy behavior. Of two methods applied for construction of such automaton presented here, one has been based on Myhill-Nerode's theory while the other has been based on derivatives of the given fuzzy behavior. Meanwhile, the categories of BL-general fuzzy automata and fuzzy behavior, along wi...
متن کاملAalborg Universitet Multi - Core Emptiness Checking of Timed Büchi Automata using Inclusion Abstraction
This paper contributes to the multi-core model checking of timed automata (TA) with respect to liveness properties, by investigating checking of TA Büchi emptiness under the very coarse inclusion abstraction or zone subsumption, an open problem in this field. We show that in general Büchi emptiness is not preserved under this abstraction, but some other structural properties are preserved. Base...
متن کامل