default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th GandALF 2017: Rome, Italy
- Patricia Bouyer, Andrea Orlandini, Pierluigi San Pietro:
Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2017, Roma, Italy, 20-22 September 2017. EPTCS 256, 2017 - Aleksandar S. Dimovski
:
Probabilistic Analysis Based On Symbolic Game Semantics and Model Counting. 1-15 - Lisa Hutschenreiter, Christel Baier, Joachim Klein:
Parametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination. 16-30 - Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron:
On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions. 31-45 - Stéphane Le Roux, Érik Martin-Dorel, Jan-Georg Smaus:
An Existence Theorem of Nash Equilibrium in Coq and Isabelle. 46-60 - Domenico Cantone, Alfio Giarlotta, Stephen Watson:
The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence. 61-75 - Karoliina Lehtinen:
The descriptive complexity of modal mu model-checking parity games. 76-90 - Tobias Denkinger:
Approximation of weighted automata with storage. 91-105 - Manfred Droste, Temur Kutsia, George Rahonis, Wolfgang Schreiner:
MK-fuzzy Automata and MSO Logics. 106-120 - Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games. 121-135 - Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux:
Dynamics and Coalitions in Sequential Games. 136-150 - Martin Zimmermann:
Finite-state Strategies in Delay Games. 151-165 - John Christopher McCabe-Dansted, Mark Reynolds:
A Parallel Linear Temporal Logic Tableau. 166-179 - David Müller, Salomon Sickert:
LTL to Deterministic Emerson-Lei Automata. 180-194 - Stefano Tonetta:
Linear-time Temporal Logic with Event Freezing Functions. 195-209 - Antti Kuusisto, Fabian Reiter:
Emptiness Problems for Distributed Automata. 210-222 - Dario Della Monica, Angelo Montanari, Pietro Sala:
Beyond ωBS-regular Languages: ωT-regular Expressions and Counter-Check Automata. 223-237 - Raúl Pardo, Gerardo Schneider:
Model Checking Social Network Models. 238-252 - Simon Busard, Charles Pecheur:
A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability. 253-267 - Laura Bozzelli, Aniello Murano:
On the Complexity of ATL and ATL* Module Checking. 268-282 - Andrei Sandler, Olga Tveretina:
ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems. 283-296
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-03-08 00:53 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:
