Sven Schewe

According to our database1, Sven Schewe
  • authored at least 105 papers between 2005 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Solving parity games in big steps.
J. Comput. Syst. Sci., 2017

CTL* synthesis via LTL synthesis.
CoRR, 2017

Optimal Control for Multi-Mode Systems with Discrete Costs.
CoRR, 2017

MDPs with Energy-Parity Objectives.
CoRR, 2017

An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space.
CoRR, 2017

Model-checking iterated games.
Acta Inf., 2017

Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

A hot method for synthesising cool controllers.
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.
Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, 2017

PranCS: A Protocol and Discrete Controller Synthesis Tool.
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2017

MDPs with energy-parity objectives.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Optimal Control for Multi-mode Systems with Discrete Costs.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2017

Perpetually Dominating Large Grids.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
A Game-Theoretic Foundation for the Maximum Software Resilience against Dense Errors.
IEEE Trans. Software Eng., 2016

Controlling loosely cooperating processes.
Theor. Comput. Sci., 2016

Efficient approximation of optimal control for continuous-time Markov games.
Inf. Comput., 2016

Perpetually Dominating Large Grids.
CoRR, 2016

Fast Two-Robot Disk Evacuation with Wireless Communication.
CoRR, 2016

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

Fast Two-Robot Disk Evacuation with Wireless Communication.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Optimal Control for Simple Linear Hybrid Systems.
Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning, 2016

Complementing Semi-deterministic Büchi Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Program Generation Using Simulated Annealing and Model Checking.
Proceedings of the Software Engineering and Formal Methods - 14th International Conference, 2016

Incentive Stackelberg Mean-Payoff Games.
Proceedings of the Software Engineering and Formal Methods - 14th International Conference, 2016

A Simple Algorithm for Solving Qualitative Probabilistic Parity Games.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
An Extension of ATL with Strategy Interaction.
ACM Trans. Program. Lang. Syst., 2015

Complexity of node coverage games.
Theor. Comput. Sci., 2015

Synthesis of succinct systems.
J. Comput. Syst. Sci., 2015

Symmetric Strategy Improvement.
CoRR, 2015

Making the Best of Limited Memory in Multi-Player Discounted Sum Games.
Proceedings of the Proceedings Sixth International Symposium on Games, 2015

Incentive Stackelberg Mean-payoff Games.
CoRR, 2015

Local and global fairness in concurrent systems.
Proceedings of the 13. ACM/IEEE International Conference on Formal Methods and Models for Codesign, 2015

Symmetric Strategy Improvement.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Bounded-rate multi-mode systems based motion planning.
Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 2015

Knowledge = Observation + Memory + Computation.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

Lazy Probabilistic Model Checking without Determinisation.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

It Pays to Pay in Bi-Matrix Games: a Rational Explanation for Bribery.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Distributed synthesis is simply undecidable.
Inf. Process. Lett., 2014

Tight Bounds for Complementing Parity Automata.
CoRR, 2014

Determinising Parity Automata.
CoRR, 2014

Bounded-Rate Multi-Mode Systems Based Motion Planning.
CoRR, 2014

Editorial: special issue on synthesis.
Acta Inf., 2014

Quantitative Verification in Rational Environments.
Proceedings of the 21st International Symposium on Temporal Representation and Reasoning, 2014

Tight Bounds for Complementing Parity Automata.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Determinising Parity Automata.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

iscasMc: A Web-Based Probabilistic Model Checker.
Proceedings of the FM 2014: Formal Methods, 2014

Distributed Control Synthesis.
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.
Theor. Comput. Sci., 2013

Combined model checking for temporal, probabilistic, and real-time logics.
Theor. Comput. Sci., 2013

Bounded synthesis.
STTT, 2013

Time and Space Results for Parity Games with Bounded Treewidth
Logical Methods in Computer Science, 2013

Coverage Games for Testing Nondeterministic Systems.
CoRR, 2013

Lazy Determinisation for Quantitative Model Checking.
CoRR, 2013

The benefit of law-making power.
CoRR, 2013

Model-Checking Iterated Games.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Simplifying Description Logic Ontologies.
Proceedings of the Semantic Web - ISWC 2013, 2013

Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Multiplayer Cost Games with Simple Nash Equilibria.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

More is Sometimes Less: Succinctness in EL.
Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

2012
Multiplayer Cost Games with Simple Nash Equilibria
CoRR, 2012

Rapid Recovery for Systems with Scarce Faults
Proceedings of the Proceedings Third International Symposium on Games, 2012

Bounded Satisfiability for PCTL
CoRR, 2012

Synthesis of Succinct Systems
CoRR, 2012

Time and Parallelizability Results for Parity Games with Bounded Treewidth.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Playing Optimally on Timed Automata with Random Delays.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2012

Bounded Satisfiability for PCTL.
Proceedings of the Computer Science Logic (CSL'12), 2012

Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2012

Synthesis of Succinct Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2012

2011
Practical Distributed Control Synthesis
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.
Acta Inf., 2011

Synthesising Classic and Interval Temporal Logic.
Proceedings of the Eighteenth International Symposium on Temporal Representation and Reasoning, 2011

Efficient Approximation of Optimal Control for Continuous-Time Markov Games.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Synthesis of Distributed Control through Knowledge Accumulation.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

The Buck Stops Here: Order, Chance, and Coordination in Distributed Control.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
Synthese Verteilter Systeme (Synthesis of Distributed Systems).
it - Information Technology, 2010

Synthesising certificates in networks of timed automata.
IET Software, 2010

Efficient Approximation of Optimal Control for Markov Games
CoRR, 2010

Minimisation of Deterministic Parity and Buchi Automata and Relative Minimisation of Deterministic Finite Automata
CoRR, 2010

Optimal Time-Abstract Schedulers for CTMDPs and Markov Games
Proceedings of the Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages, 2010

Finite Optimal Control for Time-Bounded Reachability in CTMDPs and Continuous-Time Markov Games
CoRR, 2010

Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

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

2009
Towards the Verification of Pervasive Systems.
ECEASST, 2009

Büchi complementation made tight
CoRR, 2009

Büchi Complementation Made Tight.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

From Parity and Payoff Games to Linear Programming.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Tighter Bounds for the Determinisation of Büchi Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Software Synthesis is Hard - and Simple.
Proceedings of the Software Synthesis, 06.12. - 11.12.2009, 2009

2008
RESY: Requirement Synthesis for Compositional Model Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Synthesizing Certificates in Networks of Timed Automata.
Proceedings of the 29th IEEE Real-Time Systems Symposium, 2008

ATL* Satisfiability Is 2EXPTIME-Complete.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Synthesis of Distributed Systems.
Proceedings of the Ausgezeichnete Informatikdissertationen 2008, 2008

An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

Synthesis of distributed systems.
PhD thesis, 2008

2007
Semi-automatic Distributed Synthesis.
Int. J. Found. Comput. Sci., 2007

Solving Parity Games in Big Steps.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Bounded Synthesis.
Proceedings of the Automated Technology for Verification and Analysis, 2007

Distributed Synthesis for Alternating-Time Logics.
Proceedings of the Automated Technology for Verification and Analysis, 2007

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

Automatic Synthesis of Assumptions for Compositional Model Checking.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2006

Satisfiability and Finite Model Property for the Alternating-Time mu-Calculus.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Synthesis for Probabilistic Environments.
Proceedings of the Automated Technology for Verification and Analysis, 2006

Selective Approaches for Solving Weak Games.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
Uniform Distributed Synthesis.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Semi-automatic Distributed Synthesis.
Proceedings of the Automated Technology for Verification and Analysis, 2005


  Loading...