Mixed Nash Equilibria in Concurrent Terminal-Reward Games. - Patricia Bouyer; Nicolas Markey; Daniel Stan (FSTTCS, 2014)

Reachability in Networks of Register Protocols under Stochastic Schedulers. - Patricia Bouyer; Nicolas Markey; Mickael Randour; Arnaud Sangnier; Daniel Stan (ICALP, 2016)

Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games. - Patricia Bouyer; Nicolas Markey; Daniel Stan (GandALF, 2016)

Randomized strategies in concurrent games. (Stratégies randomisées dans les jeux concurrents). - Daniel Stan (2017)

Syntactic Partial Order Compression for Probabilistic Reachability. - Gereon Fox; Daniel Stan; Holger Hermanns (VMCAI, 2019)

Regular Model Checking Approach to Knowledge Reasoning over Parameterized Systems. - Daniel Stan; Anthony W. Lin (AAMAS, 2021)

Learning Union of Integer Hypercubes with Queries - (with Applications to Monadic Decomposition). - Oliver Markgraf; Daniel Stan; Anthony W. Lin (CAV (2), 2021)

Regular Model Checking Approach to Knowledge Reasoning over Parameterized Systems (technical report). - Daniel Stan; Anthony Widjaja Lin (CoRR, 2021)

Learning Union of Integer Hypercubes with Queries (Technical Report). - Oliver Markgraf; Daniel Stan; Anthony W. Lin (CoRR, 2021)

Concurrent Stochastic Lossy Channel Games. - Daniel Stan; Muhammad Najib; Anthony Widjaja Lin; Parosh Aziz Abdulla (CSL, 2024)

SAT-Based Learning of Computation Tree Logic. - Adrien Pommellet; Daniel Stan; Simon Scatton (IJCAR (1), 2024)

sfHornStr: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses. - Hongjian Jiang; Anthony W. Lin; Oliver Markgraf; Philipp Rümmer; Daniel Stan (CAV (1), 2025)

HornStr: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses(Technical Report). - Hongjian Jiang; Anthony W. Lin; Oliver Markgraf; Philipp Rümmer; Daniel Stan (CoRR, 2025)