default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd GandALF 2012: Naples, Italy
- Marco Faella, Aniello Murano:
Proceedings Third International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2012, Napoli, Italy, September 6-8, 2012. EPTCS 96, 2012 - Marta Capiluppi, Roberto Segala
:
Modelling Implicit Communication in Multi-Agent Systems with Hybrid Input/Output Automata. 1-14 - Chung-Hao Huang, Doron A. Peled, Sven Schewe, Farn Wang:
Rapid Recovery for Systems with Scarce Faults. 15-28 - Pavol Cerný, Martin Chmelik, Thomas A. Henzinger, Arjun Radhakrishna:
Interface Simulation Distances. 29-42 - Martin Lange, Étienne Lozes, Manuel Vargas Guzmán:
Model-Checking Process Equivalences. 43-56 - Yang Cai, Ting Zhang:
Can Nondeterminism Help Complementation? 57-70 - Stephan Barth, Martin Hofmann:
Learn with SAT to Minimize Büchi Automata. 71-84 - Alessandro Solimando, Giorgio Delzanno, Giovanna Guerrini:
Automata-based Static Analysis of XML Document Adaptation. 85-98 - Aleksandar S. Dimovski:
Symbolic Representation of Algorithmic Game Semantics. 99-112 - Julian Gutierrez, Felix Klaedtke, Martin Lange:
The μ-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity. 113-126 - Ricardo Almeida, Sabine Broda, Nelma Moreira:
Deciding KAT and Hoare Logic with Derivatives. 127-140 - Jakub Michaliszyn, Jan Otop, Piotr Witkowski:
Satisfiability vs. Finite Satisfiability in Elementary Modal Logics. 141-154 - Davide Bresolin, Dario Della Monica, Angelo Montanari, Pietro Sala, Guido Sciavicco:
Interval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture. 155-168 - Daniel Neider, Roman Rabinovich, Martin Zimmermann:
Down the Borel Hierarchy: Solving Muller Games via Safety Games. 169-182 - Wladimir Fridman, Martin Zimmermann:
Playing Pushdown Parity Games in a Hurry. 183-196 - Felix Canavoi, Erich Grädel, Roman Rabinovich:
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs. 197-209 - Pawel Parys:
Higher-Order Pushdown Systems with Data. 210-223 - Domenico Cantone, Cristiano Longo:
A decidable quantified fragment of set theory with ordered pairs and some undecidable extensions. 224-237 - Alex Kruckman, Sasha Rubin, John Sheridan, Ben Zax:
A Myhill-Nerode theorem for automata with advice. 238-246 - Szczepan Hummel:
Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones. 247-260
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-13 00:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
