Sven Schewe

Frontiers Comput. Sci., 2022

Alternating Good-for-MDP Automata.

[BibT_eX]

[DOI]

CoRR, 2022

EPMC Gets Knowledge in Multi-agent Systems.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2022

History-Deterministic Timed Automata Are Not Determinizable.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 16th International Conference, 2022

Recursive Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Hidden 1-Counter Markov Models and How to Learn Them.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

SMPG: Secure Multi Party Computation on Graph Databases.

[BibT_eX]

[DOI]

Nouf Al-Juaid

Alexei Lisitsa

Proceedings of the 8th International Conference on Information Systems Security and Privacy, 2022

Natural Colors of Infinite Words.

[BibT_eX]

[DOI]

Rüdiger Ehlers

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Reinforcement Learning with Guarantees that Hold for Ever.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Industrial Critical Systems, 2022

Enhancing Adversarial Training with Second-Order Statistics of Weights.

[BibT_eX]

[DOI]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

Alternating Good-for-MDPs Automata.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2022

An Impossibility Result in Automata-Theoretic Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2022

Quantifying the Importance of Latent Features in Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Artificial Intelligence Safety 2022 (SafeAI 2022) co-located with the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI2022), 2022

2021

Maximum rooted connected expansion.

[BibT_eX]

[DOI]

Vassilis Zissimopoulos

Theor. Comput. Sci., 2021

Editorial - Special issue on Concurrency Theory (CONCUR 2018).

[BibT_eX]

[DOI]

Lijun Zhang

J. Comput. Syst. Sci., 2021

Reliability Assessment and Safety Arguments for Machine Learning Components in Assuring Learning-Enabled Autonomous Systems.

[BibT_eX]

[DOI]

CoRR, 2021

Mungojerrie: Reinforcement Learning of Linear-Time Objectives.

[BibT_eX]

[DOI]

CoRR, 2021

Priority Promotion with Parysian Flair.

[BibT_eX]

[DOI]

CoRR, 2021

Abstraction and Symbolic Execution of Deep Neural Networks with Bayesian Approximation of Hidden Features.

[BibT_eX]

[DOI]

CoRR, 2021

Assessing the Reliability of Deep Learning Classifiers Through Robustness Evaluation and Operational Profiles.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Artificial Intelligence Safety 2021 co-located with the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI 2021), 2021

Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2021

Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods - 24th International Symposium, 2021

Detecting Operational Adversarial Examples for Reliable Deep Learning.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2021

Model-Free Reinforcement Learning for Branching Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

ω-Automata.

[BibT_eX]

[DOI]

Thomas Wilke

Proceedings of the Handbook of Automata Theory., 2021

2020

Fast two-robot disk evacuation with wireless communication.

[BibT_eX]

[DOI]

Ioannis Lamprou

Russell Martin

Theor. Comput. Sci., 2020

Reward Shaping for Reinforcement Learning with Omega-Regular Objectives.

[BibT_eX]

[DOI]

CoRR, 2020

Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

How does Weight Correlation Affect Generalisation Ability of Deep Neural Networks?

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Minimising Good-For-Games Automata Is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Model-Free Reinforcement Learning for Stochastic Parity Games.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Concurrency Theory, 2020

Faithful and Effective Reward Schemes for Model-Free Reinforcement Learning of Omega-Regular Objectives.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2020

2019

Special issue on Temporal Representation and Reasoning (TIME 2017).

[BibT_eX]

[DOI]

Thomas Schneider

Jef Wijsen

Theor. Comput. Sci., 2019

Eternally dominating large grids.

[BibT_eX]

[DOI]

Ioannis Lamprou

Russell Martin

Theor. Comput. Sci., 2019

An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2019

Parity Games with Weights.

[BibT_eX]

[DOI]

Alexander Weinert

Martin Zimmermann

Log. Methods Comput. Sci., 2019

Good-for-MDPs Automata.

[BibT_eX]

[DOI]

CoRR, 2019

Improving the complexity of Parys' recursive algorithm.

[BibT_eX]

[DOI]

Karoliina Lehtinen

CoRR, 2019

Omega-Regular Objectives in Model-Free Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

Limit reachability for model-free reinforcement learning of ω-regular objectives.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Workshop on Symbolic-Numeric methods for Reasoning about CPS and IoT, 2019

2018

Buying Optimal Payoffs in Bi-Matrix Games.

[BibT_eX]

[DOI]

Games, 2018

Learning to Complement Büchi Automata.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

Incremental Verification of Parametric and Reconfigurable Markov Chains.

[BibT_eX]

[DOI]

Paul Gainer

Ernst Moritz Hahn

Proceedings of the Quantitative Evaluation of Systems - 15th International Conference, 2018

Accelerated Model Checking of Parametric Markov Chains.

[BibT_eX]

[DOI]

Paul Gainer

Ernst Moritz Hahn

Proceedings of the Automated Technology for Verification and Analysis, 2018

2017

Solving parity games in big steps.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

CTL* synthesis via LTL synthesis.

[BibT_eX]

[DOI]

Roderick Bloem

Ayrat Khalimov

Proceedings of the Proceedings Sixth Workshop on Synthesis, 2017

Model-checking iterated games.

[BibT_eX]

[DOI]

Chung-Hao Huang

Farn Wang

Acta Informatica, 2017

Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

A hot method for synthesising cool controllers.

[BibT_eX]

[DOI]

Idress Husien

Nicolas Berthier

Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017

An ordered approach to solving parity games in quasi polynomial time and quasi linear space.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017

PranCS: A Protocol and Discrete Controller Synthesis Tool.

[BibT_eX]

[DOI]

Idress Husien

Nicolas Berthier

Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2017

MDPs with energy-parity objectives.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Optimal Control for Multi-mode Systems with Discrete Costs.

[BibT_eX]

[DOI]

Mahmoud A. A. Mousa

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2017

Perpetually Dominating Large Grids.

[BibT_eX]

[DOI]

Ioannis Lamprou

Russell Martin

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

A Game-Theoretic Foundation for the Maximum Software Resilience against Dense Errors.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 2016

Controlling loosely cooperating processes.

[BibT_eX]

[DOI]

Anca Muscholl

Theor. Comput. Sci., 2016

Efficient approximation of optimal control for continuous-time Markov games.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Optimal Control for Simple Linear Hybrid Systems.

[BibT_eX]

[DOI]

Mahmoud A. A. Mousa

Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning, 2016

Complementing Semi-deterministic Büchi Automata.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Program Generation Using Simulated Annealing and Model Checking.

[BibT_eX]

[DOI]

Idress Husien

Proceedings of the Software Engineering and Formal Methods - 14th International Conference, 2016

Incentive Stackelberg Mean-Payoff Games.

[BibT_eX]

[DOI]

Ashutosh Trivedi

Sai Krishna Deepak Maram

Bharath Kumar Padarthi

Proceedings of the Software Engineering and Formal Methods - 14th International Conference, 2016

A Simple Algorithm for Solving Qualitative Probabilistic Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015

An Extension of ATL with Strategy Interaction.

[BibT_eX]

[DOI]

Farn Wang

Chung-Hao Huang

ACM Trans. Program. Lang. Syst., 2015

Complexity of node coverage games.

[BibT_eX]

[DOI]

Farn Wang

Jung-Hsuan Wu

Theor. Comput. Sci., 2015

Synthesis of succinct systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

Making the Best of Limited Memory in Multi-Player Discounted Sum Games.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Sixth International Symposium on Games, 2015

Local and global fairness in concurrent systems.

[BibT_eX]

[DOI]

Alon Brook

Proceedings of the 13. ACM/IEEE International Conference on Formal Methods and Models for Codesign, 2015

Symmetric Strategy Improvement.

[BibT_eX]

[DOI]

Ashutosh Trivedi

Shankara Narayanan Krishna

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Bounded-rate multi-mode systems based motion planning.

[BibT_eX]

[DOI]

Devendra Bhave

Sagar Jha

Ashutosh Trivedi

Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 2015

Knowledge = Observation + Memory + Computation.

[BibT_eX]

[DOI]

Blaise Genest

Proceedings of the Foundations of Software Science and Computation Structures, 2015

Lazy Probabilistic Model Checking without Determinisation.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Concurrency Theory, 2015

It Pays to Pay in Bi-Matrix Games: a Rational Explanation for Bribery.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014

Distributed synthesis is simply undecidable.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Editorial: special issue on synthesis.

[BibT_eX]

[DOI]

Acta Informatica, 2014

Quantitative Verification in Rational Environments.

[BibT_eX]

[DOI]

Proceedings of the 21st International Symposium on Temporal Representation and Reasoning, 2014

Tight Bounds for Complementing Parity Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Determinising Parity Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

iscasMc: A Web-Based Probabilistic Model Checker.

[BibT_eX]

[DOI]

Proceedings of the FM 2014: Formal Methods, 2014

Distributed Control Synthesis.

[BibT_eX]

[DOI]

Proceedings of the HOWARD-60: A Festschrift on the Occasion of Howard Barringer's 60th Birthday, 2014

2013

Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Combined model checking for temporal, probabilistic, and real-time logics.

[BibT_eX]

[DOI]

Savas Konur

Michael Fisher

Theor. Comput. Sci., 2013

Bounded synthesis.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2013

Time and Space Results for Parity Games with Bounded Treewidth

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2013

Coverage Games for Testing Nondeterministic Systems.

[BibT_eX]

[DOI]

CoRR, 2013

Lazy Determinisation for Quantitative Model Checking.

[BibT_eX]

[DOI]

CoRR, 2013

The benefit of law-making power.

[BibT_eX]

[DOI]

CoRR, 2013

Simplifying Description Logic Ontologies.

[BibT_eX]

[DOI]

Nadeschda Nikitina

Proceedings of the Semantic Web - ISWC 2013, 2013

Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge.

[BibT_eX]

[DOI]

Anca Muscholl

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Multiplayer Cost Games with Simple Nash Equilibria.

[BibT_eX]

[DOI]

Thomas Brihaye

Julie De Pril

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

More is Sometimes Less: Succinctness in EL.

[BibT_eX]

[DOI]

Nadeschda Nikitina

Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

2012

Rapid Recovery for Systems with Scarce Faults

[BibT_eX]

[DOI]

Proceedings of the Proceedings Third International Symposium on Games, 2012

Time and Parallelizability Results for Parity Games with Bounded Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Playing Optimally on Timed Automata with Random Delays.

[BibT_eX]

[DOI]

Nathalie Bertrand

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2012

Bounded Satisfiability for PCTL.

[BibT_eX]

[DOI]

Nathalie Bertrand

Proceedings of the Computer Science Logic (CSL'12), 2012

Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2012

2011

Practical Distributed Control Synthesis

[BibT_eX]

[DOI]

Proceedings of the Proceedings 13th International Workshop on Verification of Infinite-State Systems, 2011

Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games.

[BibT_eX]

[DOI]

Acta Informatica, 2011

Synthesising Classic and Interval Temporal Logic.

[BibT_eX]

[DOI]

Cong Tian

Proceedings of the Eighteenth International Symposium on Temporal Representation and Reasoning, 2011

Synthesis of Distributed Control through Knowledge Accumulation.

[BibT_eX]

[DOI]

Gal Katz

Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

The Buck Stops Here: Order, Chance, and Coordination in Distributed Control.

[BibT_eX]

[DOI]

Gal Katz

Proceedings of the Automated Technology for Verification and Analysis, 2011

2010

Synthese Verteilter Systeme (Synthesis of Distributed Systems).

[BibT_eX]

[DOI]

it Inf. Technol., 2010

Synthesising certificates in networks of timed automata.

[BibT_eX]

[DOI]

Hans-Jörg Peter

IET Softw., 2010

Efficient Approximation of Optimal Control for Markov Games

[BibT_eX]

[DOI]

Lijun Zhang

CoRR, 2010

Minimisation of Deterministic Parity and Buchi Automata and Relative Minimisation of Deterministic Finite Automata

[BibT_eX]

[DOI]

CoRR, 2010

Optimal Time-Abstract Schedulers for CTMDPs and Markov Games

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages, 2010

Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Coordination Logic.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009

Towards the Verification of Pervasive Systems.

[BibT_eX]

[DOI]

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2009

Büchi Complementation Made Tight.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

From Parity and Payoff Games to Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Tighter Bounds for the Determinisation of Büchi Automata.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2009

Software Synthesis is Hard - and Simple.

[BibT_eX]

[DOI]

Proceedings of the Software Synthesis, 06.12. - 11.12.2009, 2009

2008

RESY: Requirement Synthesis for Compositional Model Checking.

[BibT_eX]

[DOI]

Hans-Jörg Peter

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Synthesizing Certificates in Networks of Timed Automata.

[BibT_eX]

[DOI]

Hans-Jörg Peter

Proceedings of the 29th IEEE Real-Time Systems Symposium, 2008

ATL* Satisfiability Is 2EXPTIME-Complete.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Synthese Verteilter Systeme [Synthesis of Distributed Systems].

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2008, 2008

An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

Synthesis of distributed systems.

[BibT_eX]

[DOI]

PhD thesis, 2008

2007

Semi-automatic Distributed Synthesis.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Distributed Synthesis for Alternating-Time Logics.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2007

2006

Synthesis of Asynchronous Systems.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2006

Automatic Synthesis of Assumptions for Compositional Model Checking.

[BibT_eX]

[DOI]

Matthias Brill

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2006

Satisfiability and Finite Model Property for the Alternating-Time <i>mu</i>-Calculus.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Synthesis for Probabilistic Environments.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2006

Selective Approaches for Solving Weak Games.

[BibT_eX]

[DOI]

Malte Helmert

Robert Mattmüller

Proceedings of the Automated Technology for Verification and Analysis, 2006

2005

Uniform Distributed Synthesis.

[BibT_eX]

[DOI]