Emptiness Of Alternating Tree Automata Using Games With Imperfect Information

Autor: Fijalkow, Nathanaël, Pinchinat, Sophie, Serre, Olivier

Publikováno v: 33rd International Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS 2013)
33rd International Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS 2013), 2013, Guwahati, India. pp.13, ⟨10.4230/LIPIcs.FSTTCS.2013.299⟩

International audience; We consider the emptiness problem for alternating tree automata, with two acceptance semantics: classical (all branches are accepted) and qualitative (almost all branches are accepted). For the classical semantics, the usual t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d9816a23c1b3a4cacc031cff2ceb84e9
https://inria.hal.science/hal-01260682v2/file/FPS13.pdf

New Algorithms and Data Structures for the Emptiness Problem of Alternating Automata / Nouveaux algorithmes et structures de données pour le problème du vide des automates alternants

Autor: Maquet, Nicolas P. P.

This work studies new algorithms and data structures that are useful in the context of program verification. As computers have become more and more ubiquitous in our modern societies, an increasingly large number of computer-based systems are conside

Externí odkaz: http://theses.ulb.ac.be/ETD-db/collection/available/ULBetd-02162011-105751/

Emptiness of Linear Weak Alternating Automata

Autor: Merz, Stephan, Sezgin, Ali

Publikováno v: [Intern report] A03-R-503 || merz03c, 2003, 14 p

Rapport interne.; The automata-theoretic approach to model checking requires two basic ingredients: a translation from logic to automata, and an algorithm for checking language emptiness. LTL model checking has traditionally been based on (generalize

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::70b17572d5b4305a4ab608a58e21ccb9
https://hal.inria.fr/inria-00107750

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.