Professor Sven Schewe Dr.

Head of AI Section Computer Science

+44 (0)151 795 0396
Work email Sven.Schewe@liverpool.ac.uk
Personal Websitehttp://www.csc.liv.ac.uk/~sven/

Publications

Filter the publication list

Filter list by type

Show all
Journal article
Conference paper
Chapter
Other

2024

Omega-Regular Decision Processes (Conference Paper)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (n.d.). Omega-Regular Decision Processes. In Proceedings of the AAAI Conference on Artificial Intelligence Vol. 38 (pp. 21125-21133). Association for the Advancement of Artificial Intelligence (AAAI). doi:10.1609/aaai.v38i19.30105

DOI: 10.1609/aaai.v38i19.30105

Semantic flowers for good-for-games and deterministic automata (Journal article)

Dell'Erba, D., Schewe, S., Tang, Q., & Zhanabekova, T. (2024). Semantic flowers for good-for-games and deterministic automata. Information Processing Letters, 185, 106468. doi:10.1016/j.ipl.2023.106468

DOI: 10.1016/j.ipl.2023.106468

2023

An Objective Improvement Approach to Solving Discounted Payoff Games (Preprint)

An Objective Improvement Approach to Solving Discounted Payoff Games (Conference Paper)

Dell'Erba, D., Dumas, A., & Schewe, S. (n.d.). An Objective Improvement Approach to Solving Discounted Payoff Games. In Electronic Proceedings in Theoretical Computer Science Vol. 390 (pp. 203-219). Open Publishing Association. doi:10.4204/eptcs.390.13

DOI: 10.4204/eptcs.390.13

Omega-Regular Reward Machines (Chapter)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2023). Omega-Regular Reward Machines. In Frontiers in Artificial Intelligence and Applications. IOS Press. doi:10.3233/faia230368

DOI: 10.3233/faia230368

Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata (Conference Paper)

Li, Y., Schewe, S., & Vardi, M. Y. (2023). Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 279. doi:10.4230/LIPIcs.CONCUR.2023.37

DOI: 10.4230/LIPIcs.CONCUR.2023.37

Deciding What Is Good-For-MDPs (Conference Paper)

Schewe, S., Tang, Q., & Zhanabekova, T. (2023). Deciding What Is Good-For-MDPs. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 279. doi:10.4230/LIPIcs.CONCUR.2023.35

DOI: 10.4230/LIPIcs.CONCUR.2023.35

On the Succinctness of Good-for-MDPs Automata (Preprint)

A novel family of finite automata for recognizing and learning $ω$-regular languages (Preprint)

Robust Bayesian Abstraction of Neural Networks (Conference Paper)

Alshareef, A., Berthier, N., Schewe, S., & Huang, X. (2023). Robust Bayesian Abstraction of Neural Networks. In 2023 International Conference on Machine Learning and Cybernetics (ICMLC). IEEE. doi:10.1109/icmlc58545.2023.10327954

DOI: 10.1109/icmlc58545.2023.10327954

Multi-objective ω-Regular Reinforcement Learning (Journal article)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2023). Multi-objective ω-Regular Reinforcement Learning. FORMAL ASPECTS OF COMPUTING, 35(2). doi:10.1145/3605950

DOI: 10.1145/3605950

Singly Exponential Translation of Alternating Weak Büchi Automata to Unambiguous Büchi Automata (Preprint)

History-deterministic Timed Automata (Preprint)

A Novel Family of Finite Automata for Recognizing and Learning $$\omega $$-Regular Languages (Chapter)

Li, Y., Schewe, S., & Tang, Q. (2023). A Novel Family of Finite Automata for Recognizing and Learning $$\omega $$-Regular Languages. In Automated Technology for Verification and Analysis (pp. 53-73). Springer Nature Switzerland. doi:10.1007/978-3-031-45329-8_3

DOI: 10.1007/978-3-031-45329-8_3

Mungojerrie: Linear-Time Objectives in Model-Free Reinforcement Learning (Chapter)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2023). Mungojerrie: Linear-Time Objectives in Model-Free Reinforcement Learning. In Tools and Algorithms for the Construction and Analysis of Systems (pp. 527-545). Springer Nature Switzerland. doi:10.1007/978-3-031-30823-9_27

DOI: 10.1007/978-3-031-30823-9_27

Secure Joint Querying Over Federated Graph Databases Utilising SMPC Protocols (Conference Paper)

Al-Juaid, N., Lisitsa, A., & Schewe, S. (2023). Secure Joint Querying Over Federated Graph Databases Utilising SMPC Protocols. In Proceedings of the 9th International Conference on Information Systems Security and Privacy. SCITEPRESS - Science and Technology Publications. doi:10.5220/0011798900003405

DOI: 10.5220/0011798900003405

Weight-based Semantic Testing Approach for Deep Neural Networks (Conference Paper)

Alshareef, A., Berthier, N., Schewe, S., & Huang, X. (2023). Weight-based Semantic Testing Approach for Deep Neural Networks. In CEUR Workshop Proceedings Vol. 3505.

2022

Natural Colors of Infinite Words (Conference Paper)

Ehlers, R., & Schewe, S. (2022). Natural Colors of Infinite Words. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 250. doi:10.4230/LIPIcs.FSTTCS.2022.36

DOI: 10.4230/LIPIcs.FSTTCS.2022.36

An Impossibility Result in Automata-Theoretic Reinforcement Learning (Conference Paper)

Hahn, E. M., Trivedi, A., Perez, M., Somenzi, F., Schewe, S., & Wojtczak, D. (2022). An Impossibility Result in Automata-Theoretic Reinforcement Learning. In ATVA22.

History-Deterministic Timed Automata Are Not Determinizable (Conference Paper)

Bose, S., Henzinger, T. A., Lehtinen, K., Schewe, S., & Totzke, P. (2022). History-Deterministic Timed Automata Are Not Determinizable. In Unknown Conference (pp. 67-76). Springer International Publishing. doi:10.1007/978-3-031-19135-0_5

DOI: 10.1007/978-3-031-19135-0_5

Smaller progress measures and separating automata for parity games (Journal article)

Dell'Erba, D., & Schewe, S. (n.d.). Smaller progress measures and separating automata for parity games. Frontiers in Computer Science, 4. doi:10.3389/fcomp.2022.936903

DOI: 10.3389/fcomp.2022.936903

Weight Expansion: A New Perspective on Dropout and Generalization (Journal article)

Jin, G., Yi, X., Yang, P., Zhang, L., Schewe, S., & Huang, X. (2022). Weight Expansion: A New Perspective on Dropout and Generalization. Transactions on Machine Learning Research.

Reinforcement Learning with Guarantees That Hold for Ever (Conference Paper)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2022). Reinforcement Learning with Guarantees That Hold for Ever. In Proceedings of FMICS’22.

Alternating Good-for-MDP Automata (Preprint)

Deciding What is Good-for-MDPs (Preprint)

EPMC Gets Knowledge in Multi-Agent Systems (Conference Paper)

Fu, C., Hahn, E. -M., Li, Y., Schewe, S., Sun, M., Turrini, A., & Zhang, L. (2022). EPMC Gets Knowledge in Multi-Agent Systems. In International Conference on Verification, Model Checking, and Abstract Interpretation.

A Recursive Approach to Solving Parity Games in Quasipolynomial Time (Journal article)

Lehtinen, K., Parys, P., Schewe, S., & Wojtczak, D. (n.d.). A Recursive Approach to Solving Parity Games in Quasipolynomial Time. Logical Methods in Computer Science, Volume 18, Issue 1. doi:10.46298/lmcs-18(1:8)2022

DOI: 10.46298/lmcs-18(1:8)2022

Alternating Good-for-MDP Automata (Preprint)

Alternating Good-for-MDPs Automata (Chapter)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2022). Alternating Good-for-MDPs Automata. In Automated Technology for Verification and Analysis (pp. 303-319). Springer International Publishing. doi:10.1007/978-3-031-19992-9_19

DOI: 10.1007/978-3-031-19992-9_19

Enhancing Adversarial Training with Second-Order Statistics of Weights (Conference Paper)

Jin, G., Yi, X., Huang, W., Schewe, S., & Huang, X. (2022). Enhancing Adversarial Training with Second-Order Statistics of Weights. In 2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2022) (pp. 15252-15262). doi:10.1109/CVPR52688.2022.01484

DOI: 10.1109/CVPR52688.2022.01484

Hidden 1-Counter Markov Models and How to Learn Them (Conference Paper)

Kurucan, M., Özbaltan, M., Schewe, S., & Wojtczak, D. (2022). Hidden 1-Counter Markov Models and How to Learn Them. In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization. doi:10.24963/ijcai.2022/673

DOI: 10.24963/ijcai.2022/673

Quantifying the Importance of Latent Features in Neural Networks (Conference Paper)

Alshareef, A., Berthier, N., Schewe, S., & Huang, X. (2022). Quantifying the Importance of Latent Features in Neural Networks. In CEUR Workshop Proceedings Vol. 3087.

Recursive Reinforcement Learning (Conference Paper)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2022). Recursive Reinforcement Learning. In Advances in Neural Information Processing Systems Vol. 35.

SMPG: Secure Multi Party Computation on Graph Databases (Conference Paper)

Aljuaid, N., Lisitsa, A., & Schewe, S. (2021). SMPG: Secure Multi Party Computation on Graph Databases. In PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON INFORMATION SYSTEMS SECURITY AND PRIVACY (ICISSP) (pp. 463-471). doi:10.5220/0010876200003120

DOI: 10.5220/0010876200003120

SMPG: Secure Multi Party Computation on Graph Databases. (Conference Paper)

Al-Juaid, N., Lisitsa, A., & Schewe, S. (2022). SMPG: Secure Multi Party Computation on Graph Databases.. In P. Mori, G. Lenzini, & S. Furnell (Eds.), ICISSP (pp. 463-471). SCITEPRESS. Retrieved from http://www.informatik.uni-trier.de/~ley/db/conf/icissp/icissp2022.html

2021

Reliability Assessment and Safety Arguments for Machine Learning Components in System Assurance (Journal article)

Dong, Y., Huang, W., Bharti, V., Cox, V., Banks, A., Wang, S., . . . Huang, X. (2023). Reliability Assessment and Safety Arguments for Machine Learning Components in System Assurance. ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 22(3). doi:10.1145/3570918

DOI: 10.1145/3570918

Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives (Conference Paper)

Hahn, E. -M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2021). Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives. In Lecture Notes in Computer Science Vol. 13047 (pp. 142-159). Springer Nature. doi:10.1007/978-3-030-90870-6

DOI: 10.1007/978-3-030-90870-6

ω-Automata (Chapter)

Schewe, S., & Wilke, T. (2021). ω-Automata. In Handbook of Automata Theory (pp. 189-234). EMS Press. doi:10.4171/automata-1/6

DOI: 10.4171/automata-1/6

Editorial - Special issue on Concurrency Theory (CONCUR 2018) (Journal article)

Schewe, S., & Zhang, L. (2021). Editorial - Special issue on Concurrency Theory (CONCUR 2018). JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 119, 19-20. doi:10.1016/j.jcss.2021.02.001

DOI: 10.1016/j.jcss.2021.02.001

Model-Free Reinforcement Learning for Branching Markov Decision Processes (Conference Paper)

Hahn, E. -M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2021). Model-Free Reinforcement Learning for Branching Markov Decision Processes. In Lecture Notes in Computer Science Vol. 12507 (pp. 651-673). Springer Nature. doi:10.1007/978-3-030-81688-9\_30

DOI: 10.1007/978-3-030-81688-9\_30

Model-Free Reinforcement Learning for Branching Markov Decision Processes (Journal article)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2021). Model-Free Reinforcement Learning for Branching Markov Decision Processes. COMPUTER AIDED VERIFICATION, PT II, CAV 2021, 12760, 651-673. doi:10.1007/978-3-030-81688-9_30

DOI: 10.1007/978-3-030-81688-9_30

Maximum rooted connected expansion. (Conference Paper)

Lamprou, I., Martin, R., Schewe, S., Sigalas, I., & Zissimopoulos, V. (2021). Maximum rooted connected expansion.. In Theor. Comput. Sci. Vol. 873 (pp. 25-37). doi:10.1016/j.tcs.2021.04.022

DOI: 10.1016/j.tcs.2021.04.022

Assessing the Reliability of Deep Learning Classifiers Through Robustness Evaluation and Operational Profiles (Conference Paper)

Zhao, X., Huang, W., Banks, A., Cox, V., Flynn, D., Schewe, S., & Huang, X. (2021). Assessing the Reliability of Deep Learning Classifiers Through Robustness Evaluation and Operational Profiles. Retrieved from http://arxiv.org/abs/2106.01258v1

Priority Promotion with Parysian Flair (Preprint)

Detecting Operational Adversarial Examples for Reliable Deep Learning (Conference Paper)

Zhao, X., Huang, W., Schewe, S., Dong, Y., & Huang, X. (2021). Detecting Operational Adversarial Examples for Reliable Deep Learning. In 51ST ANNUAL IEEE/IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS - SUPPLEMENTAL VOL (DSN 2021) (pp. 5-6). doi:10.1109/DSN-S52858.2021.00013

DOI: 10.1109/DSN-S52858.2021.00013

Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP (Conference Paper)

Totzke, P., Schewe, S., & Wojtczak, D. (2021). Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. In Lecture Notes in Computer Science Vol. 12650 (pp. 427-447). Luxembourg: Springer Nature.

Abstraction and Symbolic Execution of Deep Neural Networks with Bayesian Approximation of Hidden Features (Preprint)

Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP (Journal article)

Mayr, R., Schewe, S., Totzke, P., & Wojtczak, D. (2021). Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2021, 12650, 427-447. doi:10.1007/978-3-030-71995-1_22

DOI: 10.1007/978-3-030-71995-1_22

Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant (Journal article)

Faraggi, A. E., Percival, B., Schewe, S., & Wojtczak, D. (2021). Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant. PHYSICS LETTERS B, 816. doi:10.1016/j.physletb.2021.136187

DOI: 10.1016/j.physletb.2021.136187

Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives (Chapter)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2021). Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives. In Unknown Book (Vol. 13047, pp. 142-159). doi:10.1007/978-3-030-90870-6_8

DOI: 10.1007/978-3-030-90870-6_8

2020

Fast two-robot disk evacuation with wireless communication. (Journal article)

Lamprou, I., Martin, R., & Schewe, S. (2020). Fast two-robot disk evacuation with wireless communication.. Theoretical Computer Science, 846, 38-60. doi:10.1016/j.tcs.2020.09.019

DOI: 10.1016/j.tcs.2020.09.019

Minimising good-for-games automata is NP-complete (Conference Paper)

Schewe, S. (2020). Minimising good-for-games automata is NP-complete. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 182. doi:10.4230/LIPIcs.FSTTCS.2020.56

DOI: 10.4230/LIPIcs.FSTTCS.2020.56

How does Weight Correlation Affect the Generalisation Ability of Deep Neural Networks (Conference Paper)

Jin, G., Yi, X., Zhang, L., Zhang, L., Schewe, S., & Huang, X. (2020). How does Weight Correlation Affect the Generalisation Ability of Deep Neural Networks. Retrieved from http://arxiv.org/abs/2010.05983v3

Model-free reinforcement learning for stochastic parity games (Conference Paper)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2020). Model-free reinforcement learning for stochastic parity games. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 171 (pp. 211-2116). doi:10.4230/LIPIcs.CONCUR.2020.21

DOI: 10.4230/LIPIcs.CONCUR.2020.21

Reward Shaping for Reinforcement Learning with Omega-Regular Objectives (Journal article)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2020). Reward Shaping for Reinforcement Learning with Omega-Regular Objectives. Retrieved from http://arxiv.org/abs/2001.05977v1

Faithful and Effective Reward Schemes for Model-Free Reinforcement Learning of Omega-Regular Objectives (Conference Paper)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2020). Faithful and Effective Reward Schemes for Model-Free Reinforcement Learning of Omega-Regular Objectives. In AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS (ATVA 2020) Vol. 12302 (pp. 108-124). doi:10.1007/978-3-030-59152-6_6

DOI: 10.1007/978-3-030-59152-6_6

Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning (Conference Paper)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2020). Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning. In Unknown Conference (pp. 306-323). Springer International Publishing. doi:10.1007/978-3-030-45190-5_17

DOI: 10.1007/978-3-030-45190-5_17

2019

Special issue on Temporal Representation and Reasoning (TIME 2017) (Journal article)

Schewe, S., Schneider, T., & Wijsen, J. (2019). Special issue on Temporal Representation and Reasoning (TIME 2017). THEORETICAL COMPUTER SCIENCE, 797, 1. doi:10.1016/j.tcs.2019.10.036

DOI: 10.1016/j.tcs.2019.10.036

Parity Games with Weights (Journal article)

Schewe, S., Weinert, A., & Zimmermann, M. (2019). Parity Games with Weights. Logical Methods in Computer Science, 15(03), 50 pages. doi:10.23638/LMCS-15(3:20)2019

DOI: 10.23638/LMCS-15(3:20)2019

An Ordered Approach to Solving Parity Games in Quasi-Polynomial Time and Quasi-Linear Space (Journal article)

Fearnley, J. S., Jain, S., De Keijzer, B., Schewe, S., Stephan, F., & Wojtczak, D. K. (2019). An Ordered Approach to Solving Parity Games in Quasi-Polynomial Time and Quasi-Linear Space. International Journal on Software Tools for Technology Transfer, 21(3), 325-349. doi:10.1007/s10009-019-00509-3

DOI: 10.1007/s10009-019-00509-3

Improving the complexity of Parys' recursive algorithm (Internet publication)

Lehtinen, K., Schewe, S., & Wojtczak, D. (2019). Improving the complexity of Parys' recursive algorithm. Retrieved from http://arxiv.org/abs/1904.11810v4

Limit Reachability for Model-Free Reinforcement Learning of ω-Regular Objectives (Conference Paper)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. (2019). Limit Reachability for Model-Free Reinforcement Learning of ω-Regular Objectives. In PROCEEDINGS OF THE 5TH INTERNATIONAL WORKSHOP ON SYMBOLIC-NUMERIC METHODS FOR REASONING ABOUT CPS AND IOT (SNR 2019) (pp. 16-18). doi:10.1145/3313149.3313369

DOI: 10.1145/3313149.3313369

Omega-Regular Objectives in Model-Free Reinforcement Learning (Conference Paper)

Hahn, E. M., Perez, M., Schewe, S., Somenzi, F., Trivedi, A., & Wojtczak, D. K. (2019). Omega-Regular Objectives in Model-Free Reinforcement Learning. In Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2019. Lecture Notes in Computer Science Vol. 11427 (pp. 395-412). Prague, Czech Republic. doi:10.1007/978-3-030-17462-0_27

DOI: 10.1007/978-3-030-17462-0_27

2018

Accelerated Model Checking of Parametric Markov Chains (Conference Paper)

Schewe, S., Gainer, P., & Hahn, E. M. (2018). Accelerated Model Checking of Parametric Markov Chains. In International Symposium on Automated Technology for Verification and Analysis. Los Angeles.

Parity Games with Weights (Conference Paper)

Schewe, S., Weinert, A., & Zimmermann, M. (2018). Parity Games with Weights. In CSL 2018.

Preface (Conference Paper)

Schewe, S., & Zhang, L. (2018). Preface. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 118. doi:10.4230/LIPIcs.CONCUR.2018.0

DOI: 10.4230/LIPIcs.CONCUR.2018.0

Maximum Rooted Connected Expansion (Journal article)

Lamprou, I., Martin, R., Schewe, S., Sigalas, I., & Zissimopoulos, V. (2018). Maximum Rooted Connected Expansion. Retrieved from http://arxiv.org/abs/1806.09549v1

Parity Games with Weights (Conference Paper)

Schewe, S., Weinert, A., & Zimmermann, M. (2018). Parity Games with Weights. In August Vol. 23 (pp. 2019). Retrieved from http://dx.doi.org/10.23638/LMCS-15(3:20)2019

Incremental Verification of Parametric and Reconfigurable Markov Chains (Conference Paper)

Gainer, P., Hahn, E. M., & Schewe, S. (2018). Incremental Verification of Parametric and Reconfigurable Markov Chains. In QUANTITATIVE EVALUATION OF SYSTEMS, QEST 2018 Vol. 11024 (pp. 140-156). doi:10.1007/978-3-319-99154-2_9

DOI: 10.1007/978-3-319-99154-2_9

Learning to Complement Buchi Automata (Conference Paper)

Li, Y., Turrini, A., Zhang, L., & Schewe, S. (2018). Learning to Complement Buchi Automata. In VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION (VMCAI 2018) Vol. 10747 (pp. 313-335). doi:10.1007/978-3-319-73721-8_15

DOI: 10.1007/978-3-319-73721-8_15

2017

CTL* synthesis via LTL synthesis (Conference Paper)

Bloem, R., Schewe, S., & Khalimov, A. (2017). CTL* synthesis via LTL synthesis. In D. Fisman, & S. Jacobs (Eds.), Electronic Proceedings in Theoretical Computer Science Vol. 260 (pp. 4-22). doi:10.4204/EPTCS.260.4

DOI: 10.4204/EPTCS.260.4

Model-checking iterated games (Journal article)

Huang, C. -H., Schewe, S., & Wang, F. (2017). Model-checking iterated games. ACTA INFORMATICA, 54(7), 625-654. doi:10.1007/s00236-016-0277-y

DOI: 10.1007/s00236-016-0277-y

PranCS: A protocol and discrete controller synthesis tool (Conference Paper)

Husien, I., Schewe, S., & Berthier, N. (2017). PranCS: A protocol and discrete controller synthesis tool. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 10606 LNCS (pp. 337-349). doi:10.1007/978-3-319-69483-2_20

DOI: 10.1007/978-3-319-69483-2_20

Preface (Conference Paper)

Schewe, S., Schneider, T., & Wijsen, J. (2017). Preface. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 90.

MDPs with energy-parity objectives (Conference Paper)

Mayr, R., Schewe, S., Totzke, P., & Wojtczak, D. (2017). MDPs with energy-parity objectives. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017 (pp. 1-12). Reykjavik, Iceland. doi:10.1109/LICS.2017.8005131

DOI: 10.1109/LICS.2017.8005131

A Hot Method for Synthesising Cool Controllers (Conference Paper)

Husien, I., Berthier, N., & Schewe, S. (2017). A Hot Method for Synthesising Cool Controllers. In SPIN'17: PROCEEDINGS OF THE 24TH ACM SIGSOFT INTERNATIONAL SPIN SYMPOSIUM ON MODEL CHECKING OF SOFTWARE (pp. 122-131). doi:10.1145/3092282.3092299

DOI: 10.1145/3092282.3092299

An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space (Conference Paper)

Fearnley, J., Jain, S., Schewe, S., Stephan, F., & Wojtczak, D. (2017). An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space. In SPIN'17: PROCEEDINGS OF THE 24TH ACM SIGSOFT INTERNATIONAL SPIN SYMPOSIUM ON MODEL CHECKING OF SOFTWARE (pp. 112-121). doi:10.1145/3092282.3092286

DOI: 10.1145/3092282.3092286

Optimal Control for Multi-Mode Systems with Discrete Costs (Conference Paper)

Mousa, M. A. A., Schewe, S., & Wojtczak, D. (2017). Optimal Control for Multi-Mode Systems with Discrete Costs. Retrieved from http://arxiv.org/abs/1706.09886v1

An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space. (Journal article)

Fearnley, J., Jain, S., Schewe, S., Stephan, F., & Wojtczak, D. (2017). An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space.. CoRR, abs/1703.01296.

Solving parity games in big steps (Journal article)

Schewe, S. (2017). Solving parity games in big steps. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 84, 243-262. doi:10.1016/j.jcss.2016.10.002

DOI: 10.1016/j.jcss.2016.10.002

Optimal control for multi-mode systems with discrete costs (Conference Paper)

Mousa, M. A. A., Schewe, S., & Wojtczak, D. (2017). Optimal Control for Multi-mode Systems with Discrete Costs. In FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS (FORMATS 2017) Vol. 10419 (pp. 77-96). doi:10.1007/978-3-319-65765-3_5

DOI: 10.1007/978-3-319-65765-3_5

Perpetually Dominating Large Grids (Conference Paper)

Lamprou, I., Martin, R. A., & Schewe, S. (2017, May 24). Perpetually Dominating Large Grids. In 10th International Conference on Algorithms and Complexity. Athens, Greece. Retrieved from https://link.springer.com/chapter/10.1007/978-3-319-57586-5_33

2016

Optimal Control for Simple Linear Hybrid Systems (Conference Paper)

Mousa, M. A. A., Schewe, S., & Wojtczak, D. (2016). Optimal Control for Simple Linear Hybrid Systems. In PROCEEDINGS 23RD INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING - TIME 2016 (pp. 12-20). doi:10.1109/TIME.2016.9

DOI: 10.1109/TIME.2016.9

Perpetually Dominating Large Grids (Journal article)

Lamprou, I., Martin, R., & Schewe, S. (2017). Perpetually Dominating Large Grids. ALGORITHMS AND COMPLEXITY (CIAC 2017), 10236, 393-404. doi:10.1007/978-3-319-57586-5_33

DOI: 10.1007/978-3-319-57586-5_33

Fast Two-Robot Disk Evacuation with Wireless Communication (Conference Paper)

Martin, R. A., Lamprou, I., & Schewe, S. (2016). Fast Two-Robot Disk Evacuation with Wireless Communication. In Lecture Notes in Computer Science. Paris, France: Springer Verlag (Germany): LNCS.

Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Conference Paper)

Hahn, E. M., Schewe, S., Turrini, A., & Zhang, L. (2017). Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games. In VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, VMCAI 2017 Vol. 10145 (pp. 266-287). doi:10.1007/978-3-319-52234-0_15

DOI: 10.1007/978-3-319-52234-0_15

A Game-Theoretic Foundation for the Maximum Software Resilience against Dense Errors (Journal article)

Huang, C. -H., Peled, D. A., Schewe, S., & Wang, F. (2016). A Game-Theoretic Foundation for the Maximum Software Resilience against Dense Errors. IEEE Transactions on Software Engineering, 42(7), 605-622. doi:10.1109/TSE.2015.2510001

DOI: 10.1109/TSE.2015.2510001

Fast Two-Robot Disk Evacuation with Wireless Communication (Journal article)

Lamprou, I., Martin, R., & Schewe, S. (2016). Fast Two-Robot Disk Evacuation with Wireless Communication. Retrieved from http://arxiv.org/abs/1604.04217v1

Efficient approximation of optimal control for continuous-time Markov games (Journal article)

Fearnley, J., Rabe, M. N., Schewe, S., & Zhang, L. (2016). Efficient approximation of optimal control for continuous-time Markov games. INFORMATION AND COMPUTATION, 247, 106-129. doi:10.1016/j.ic.2015.12.002

DOI: 10.1016/j.ic.2015.12.002

Controlling loosely cooperating processes (Journal article)

Muscholl, A., & Schewe, S. (2016). Controlling loosely cooperating processes. THEORETICAL COMPUTER SCIENCE, 611, 136-141. doi:10.1016/j.tcs.2015.07.044

DOI: 10.1016/j.tcs.2015.07.044

A Simple Algorithm for Solving Qualitative Probabilistic Parity Games (Conference Paper)

Hahn, E. M., Schewe, S., Turrini, A., & Zhang, L. (2016). A Simple Algorithm for Solving Qualitative Probabilistic Parity Games. In COMPUTER AIDED VERIFICATION: 28TH INTERNATIONAL CONFERENCE, CAV 2016, PT II Vol. 9780 (pp. 291-311). Toronto, ON, Canada. doi:10.1007/978-3-319-41540-6_16

DOI: 10.1007/978-3-319-41540-6_16

Complementing Semi-deterministic Buchi Automata (Conference Paper)

Blahoudek, F., Heizmann, M., Schewe, S., Strejcek, J., & Tsai, M. -H. (2016). Complementing Semi-deterministic Buchi Automata. In TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS (TACAS 2016) Vol. 9636 (pp. 770-787). doi:10.1007/978-3-662-49674-9_49

DOI: 10.1007/978-3-662-49674-9_49

Incentive Stackelberg Mean-Payoff Games (Conference Paper)

Gupta, A., Schewe, S., Trivedi, A., Deepak, M. S. K., & Padarthi, B. K. (2016). Incentive Stackelberg Mean-Payoff Games. In SOFTWARE ENGINEERING AND FORMAL METHODS: 14TH INTERNATIONAL CONFERENCE, SEFM 2016 Vol. 9763 (pp. 304-320). doi:10.1007/978-3-319-41591-8_21

DOI: 10.1007/978-3-319-41591-8_21

Program Generation Using Simulated Annealing and Model Checking (Conference Paper)

Husien, I., & Schewe, S. (2016). Program Generation Using Simulated Annealing and Model Checking. In SOFTWARE ENGINEERING AND FORMAL METHODS: 14TH INTERNATIONAL CONFERENCE, SEFM 2016 Vol. 9763 (pp. 155-171). doi:10.1007/978-3-319-41591-8_11

DOI: 10.1007/978-3-319-41591-8_11

2015

Local and Global Fairness in Concurrent Systems (Conference Paper)

Brook, A., Peled, D., & Schewe, S. (2015). Local and Global Fairness in Concurrent Systems. In 2015 ACM/IEEE INTERNATIONAL CONFERENCE ON FORMAL METHODS AND MODELS FOR CODESIGN (MEMOCODE) (pp. 2-9). Retrieved from https://www.webofscience.com/

Synthesis of succinct systems (Journal article)

Fearnley, J., Peled, D., & Schewe, S. (2015). Synthesis of succinct systems. Journal of Computer and System Sciences, 81(7), 1171-1193. doi:10.1016/j.jcss.2015.02.005

DOI: 10.1016/j.jcss.2015.02.005

Lazy probabilistic model checking without determinisation (Chapter)

Hahn, E. M., Li, G., Schewe, S., Turrini, A., & Zhang, L. (2015). Lazy probabilistic model checking without determinisation. In Unknown Book (Vol. 42, pp. 354-367). doi:10.4230/LIPIcs.CONCUR.2015.354

DOI: 10.4230/LIPIcs.CONCUR.2015.354

An Extension of ATL with Strategy Interaction (Journal article)

Wang, F., Schewe, S., & Huang, C. -H. (2015). An Extension of ATL with Strategy Interaction. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 37(3). doi:10.1145/2734117

DOI: 10.1145/2734117

Bounded-rate multi-mode systems based motion planning (Chapter)

Bhave, D., Jha, S., Krishna, S. N., Schewe, S., & Trivedi, A. (2015). Bounded-rate multi-mode systems based motion planning. ACM. doi:10.1145/2728606.2728616

DOI: 10.1145/2728606.2728616

Complexity of node coverage games (Journal article)

Wang, F., Schewe, S., & Wu, J. -H. (2015). Complexity of node coverage games. THEORETICAL COMPUTER SCIENCE, 576, 45-60. doi:10.1016/j.tcs.2015.02.002

DOI: 10.1016/j.tcs.2015.02.002

It Pays to Pay in Bi-Matrix Games - a Rational Explanation for Bribery (Chapter)

Gupta, A., & Schewe, S. (2015). It Pays to Pay in Bi-Matrix Games - a Rational Explanation for Bribery. In Unknown Book (pp. 1361-1369). Retrieved from https://www.webofscience.com/

Knowledge = Observation plus Memory plus Computation (Chapter)

Genest, B., Peled, D., & Schewe, S. (2015). Knowledge = Observation plus Memory plus Computation. In Unknown Book (Vol. 9034, pp. 215-229). doi:10.1007/978-3-662-46678-0_14

DOI: 10.1007/978-3-662-46678-0_14

Symmetric Strategy Improvement (Chapter)

Schewe, S., Trivedi, A., & Varghese, T. (2015). Symmetric Strategy Improvement. In Automata, Languages, and Programming (Vol. 9135, pp. 388-400). Springer. doi:10.1007/978-3-662-47666-6_31

DOI: 10.1007/978-3-662-47666-6_31

2014

Quantitative Verification in Rational Environments (Chapter)

Gupta, A., & Schewe, S. (2014). Quantitative Verification in Rational Environments. In Unknown Book (pp. 123-131). doi:10.1109/TIME.2014.9

DOI: 10.1109/TIME.2014.9

Making the Best of Limited Memory in Multi-Player Discounted Sum Games (Conference Paper)

Gupta, A., Schewe, S., & Wojtczak, D. (2015). Making the Best of Limited Memory in Multi-Player Discounted Sum Games. In ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE (pp. 16-30). doi:10.4204/EPTCS.193.2

DOI: 10.4204/EPTCS.193.2

Distributed synthesis is simply undecidable (Journal article)

Schewe, S. (2014). Distributed synthesis is simply undecidable. INFORMATION PROCESSING LETTERS, 114(4), 203-207. doi:10.1016/j.ipl.2013.11.012

DOI: 10.1016/j.ipl.2013.11.012

Distributed Control Synthesis (Chapter)

Peled, D., & Schewe, S. (n.d.). Distributed Control Synthesis. EasyChair. doi:10.29007/4wwx

DOI: 10.29007/4wwx

Determinising Parity Automata (Chapter)

Schewe, S., & Varghese, T. (2014). Determinising Parity Automata. In Unknown Book (Vol. 8634, pp. 486-498). Retrieved from https://www.webofscience.com/

Editorial: special issue on synthesis (Journal article)

Peled, D., & Schewe, S. (2014). Editorial: special issue on synthesis. ACTA INFORMATICA, 51(3-4), 127-128. doi:10.1007/s00236-014-0198-6

DOI: 10.1007/s00236-014-0198-6

ISCASMC: A Web-Based Probabilistic Model Checker (Conference Paper)

Hahn, E. M., Li, Y., Schewe, S., Turrini, A., & Zhang, L. (2014). ISCASMC: A Web-Based Probabilistic Model Checker. In FM 2014: FORMAL METHODS Vol. 8442 (pp. 312-317). Retrieved from https://www.webofscience.com/

Tight Bounds for Complementing Parity Automata (Chapter)

Schewe, S., & Varghese, T. (2014). Tight Bounds for Complementing Parity Automata. In Unknown Book (Vol. 8634, pp. 499-510). Retrieved from https://www.webofscience.com/

2013

More is sometimes less: Succinctness in EL (Conference Paper)

Nikitina, N., & Schewe, S. (2013). More is sometimes less: Succinctness in EL. In CEUR Workshop Proceedings Vol. 1014 (pp. 403-414).

Multiplayer Cost Games with Simple Nash Equilibria (Conference Paper)

Brihaye, T., De Pril, J., & Schewe, S. (2013). Multiplayer Cost Games with Simple Nash Equilibria. In Unknown Conference (pp. 59-73). Springer Berlin Heidelberg. doi:10.1007/978-3-642-35722-0_5

DOI: 10.1007/978-3-642-35722-0_5

Simplifying Description Logic Ontologies (Conference Paper)

Nikitina, N., & Schewe, S. (2013). Simplifying Description Logic Ontologies. In SEMANTIC WEB - ISWC 2013, PART I Vol. 8218 (pp. 411-426). Retrieved from https://www.webofscience.com/

Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge (Conference Paper)

Muscholl, A., & Schewe, S. (2013). Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013 Vol. 8087 (pp. 691-703). Retrieved from https://www.webofscience.com/

Bounded synthesis (Journal article)

Finkbeiner, B., & Schewe, S. (2013). Bounded synthesis. International Journal on Software Tools for Technology Transfer, 15(5-6), 519-539. doi:10.1007/s10009-012-0228-z

DOI: 10.1007/s10009-012-0228-z

Combined model checking for temporal, probabilistic, and real-time logics (Journal article)

Konur, S., Fisher, M., & Schewe, S. (2013). Combined model checking for temporal, probabilistic, and real-time logics. THEORETICAL COMPUTER SCIENCE, 503, 61-88. doi:10.1016/j.tcs.2013.07.012

DOI: 10.1016/j.tcs.2013.07.012

TIME AND PARALLELIZABILITY RESULTS FOR PARITY GAMES WITH BOUNDED TREE AND DAG WIDTH (Journal article)

Fearnley, J., & Schewe, S. (2013). TIME AND PARALLELIZABILITY RESULTS FOR PARITY GAMES WITH BOUNDED TREE AND DAG WIDTH. LOGICAL METHODS IN COMPUTER SCIENCE, 9(2). doi:10.2168/LMCS-9(2:06)2013

DOI: 10.2168/LMCS-9(2:06)2013

Model-Checking Iterated Games (Conference Paper)

Huang, C. -H., Schewe, S., & Wang, F. (2013). Model-Checking Iterated Games. In TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2013 Vol. 7795 (pp. 154-168). Retrieved from https://www.webofscience.com/

Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games (Journal article)

Rabe, M. N., & Schewe, S. (2013). Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games. THEORETICAL COMPUTER SCIENCE, 467, 53-67. doi:10.1016/j.tcs.2012.10.001

DOI: 10.1016/j.tcs.2012.10.001

2012

Synthesis of Succinct Systems (Journal article)

Fearnley, J., Peled, D., & Schewe, S. (2012). Synthesis of Succinct Systems. Unknown Journal, 208-222. doi:10.1007/978-3-642-33386-6_18

DOI: 10.1007/978-3-642-33386-6_18

Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata (Chapter)

Schewe, S., & Varghese, T. (2012). Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata. In Automated Technology for Verification and Analysis (pp. 42-56). Springer Berlin Heidelberg. doi:10.1007/978-3-642-33386-6_5

DOI: 10.1007/978-3-642-33386-6_5

Rapid Recovery for Systems with Scarce Faults (Conference Paper)

Huang, C. -H., Peled, D., Schewe, S., & Wang, F. (2012). Rapid Recovery for Systems with Scarce Faults. In EPTCS 96, 2012, pp. 15-28. Retrieved from http://dx.doi.org/10.4204/EPTCS.96.2

Playing Optimally on Timed Automata with Random Delays (Chapter)

Bertrand, N., & Schewe, S. (2012). Playing Optimally on Timed Automata with Random Delays. In Lecture Notes in Computer Science (pp. 43-58). Springer Berlin Heidelberg. doi:10.1007/978-3-642-33365-1_5

DOI: 10.1007/978-3-642-33365-1_5

Proceedings First Workshop on Synthesis (Conference Paper)

Peled, D., & Schewe, S. (2012). Proceedings First Workshop on Synthesis. In EPTCS 84, 2012. Retrieved from http://dx.doi.org/10.4204/EPTCS.84

Bounded Satisfiability for PCTL (Conference Paper)

Bertrand, N., Fearnley, J., & Schewe, S. (2012). Bounded Satisfiability for PCTL. Retrieved from http://arxiv.org/abs/1204.0469v1

Synthesis of Succinct Systems (Conference Paper)

Fearnley, J., Peled, D., & Schewe, S. (2012). Synthesis of Succinct Systems. Retrieved from http://arxiv.org/abs/1202.5449v2

Formal Modeling and Analysis of Timed Systems (Conference Paper)

Jurdziński, M., & Ničković, D. (Eds.) (2012). Formal Modeling and Analysis of Timed Systems. In . Springer Berlin Heidelberg. doi:10.1007/978-3-642-33365-1

DOI: 10.1007/978-3-642-33365-1

Time and Parallelizability Results for Parity Games with Bounded Treewidth (Conference Paper)

Fearnley, J., & Schewe, S. (2012). Time and Parallelizability Results for Parity Games with Bounded Treewidth. In AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012, PT II Vol. 7392 (pp. 189-200). Retrieved from https://www.webofscience.com/

2011

Efficient approximation of optimal control for continuous-time Markov games (Conference Paper)

Fearnley, J., Rabe, M., Schewe, S., & Zhang, L. (2011). Efficient approximation of optimal control for continuous-time Markov games. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 13 (pp. 399-410). doi:10.4230/LIPIcs.FSTTCS.2011.399

DOI: 10.4230/LIPIcs.FSTTCS.2011.399

Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width (Journal article)

Fearnley, J., & Schewe, S. (2011). Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width. Logical Methods in Computer Science, Volume 9, Issue 2 (June 18, 2013) lmcs:791. Retrieved from http://dx.doi.org/10.2168/LMCS-9(2:6)2013

Synthesising Classic and Interval Temporal Logic (Conference Paper)

Schewe, S., & Tian, C. (2011). Synthesising Classic and Interval Temporal Logic. In 2011 Eighteenth International Symposium on Temporal Representation and Reasoning. IEEE. doi:10.1109/time.2011.19

DOI: 10.1109/time.2011.19

Practical Distributed Control Synthesis (Conference Paper)

Peled, D., & Schewe, S. (2011). Practical Distributed Control Synthesis. In EPTCS 73, 2011, pp. 2-17. Retrieved from http://dx.doi.org/10.4204/EPTCS.73.2

The Buck Stops Here: Order, Chance, and Coordination in Distributed Control (Chapter)

Katz, G., Peled, D., & Schewe, S. (2011). The Buck Stops Here: Order, Chance, and Coordination in Distributed Control. In Automated Technology for Verification and Analysis (pp. 422-431). Springer Berlin Heidelberg. doi:10.1007/978-3-642-24372-1_31

DOI: 10.1007/978-3-642-24372-1_31

Synthesis of Distributed Control through Knowledge Accumulation (Chapter)

Katz, G., Peled, D., & Schewe, S. (2011). Synthesis of Distributed Control through Knowledge Accumulation. In Computer Aided Verification (pp. 510-525). Springer Berlin Heidelberg. doi:10.1007/978-3-642-22110-1_41

DOI: 10.1007/978-3-642-22110-1_41

Automated Technology for Verification and Analysis (Conference Paper)

Bultan, T., & Hsiung, P. -A. (Eds.) (2011). Automated Technology for Verification and Analysis. In . Springer Berlin Heidelberg. doi:10.1007/978-3-642-24372-1

DOI: 10.1007/978-3-642-24372-1

Computer Aided Verification (Conference Paper)

Gopalakrishnan, G., & Qadeer, S. (Eds.) (2011). Computer Aided Verification. In . Springer Berlin Heidelberg. doi:10.1007/978-3-642-22110-1

DOI: 10.1007/978-3-642-22110-1

2010

Beyond Hyper-Minimisation-Minimising DBAs and DPAs is NP-Complete (Conference Paper)

Schewe, S. (2010). Beyond Hyper-Minimisation-Minimising DBAs and DPAs is NP-Complete. In IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010) Vol. 8 (pp. 400-411). doi:10.4230/LIPIcs.FSTTCS.2010.400

DOI: 10.4230/LIPIcs.FSTTCS.2010.400

Efficient Approximation of Optimal Control for Markov Games (Journal article)

Fearnley, J., Rabe, M., Schewe, S., & Zhang, L. (2010). Efficient Approximation of Optimal Control for Markov Games. Retrieved from http://arxiv.org/abs/1011.0397v2

Coordination Logic (Conference Paper)

Finkbeiner, B., & Schewe, S. (2010). Coordination Logic. In COMPUTER SCIENCE LOGIC Vol. 6247 (pp. 305-+). Retrieved from https://www.webofscience.com/

Optimal Time-Abstract Schedulers for CTMDPs and Markov Games (Journal article)

Rabe, M., & Schewe, S. (2010). Optimal Time-Abstract Schedulers for CTMDPs and Markov Games. EPTCS 28, 2010, pp. 144-158. Retrieved from http://dx.doi.org/10.4204/EPTCS.28.10

Synthesising certificates in networks of timed automata (Journal article)

Finkbeiner, B., Peter, H. -J., & Schewe, S. (2010). Synthesising certificates in networks of timed automata. IET SOFTWARE, 4(3), 222-235. doi:10.1049/iet-sen.2009.0047

DOI: 10.1049/iet-sen.2009.0047

Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games (Journal article)

Rabe, M. N., & Schewe, S. (2011). Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games. ACTA INFORMATICA, 48(5-6), 291-315. doi:10.1007/s00236-011-0140-0

DOI: 10.1007/s00236-011-0140-0

Synthese Verteilter SystemeSynthesis of Distributed Systems (Journal article)

Schewe, S. (2010). Synthese Verteilter SystemeSynthesis of Distributed Systems. itit, 52(2), 120-124. doi:10.1524/itit.2010.0581

DOI: 10.1524/itit.2010.0581

Synthesis of Distributed Systems (Thesis / Dissertation)

Schewe, S. (2010). Synthesis of Distributed Systems.

DOI: 10.1524/itit.2010.0581

Software Synthesis is Hard - and Simple (Conference Paper)

Schewe, S. (2010). Software Synthesis is Hard - and Simple. In Dagstuhl Seminar Proceedings Vol. 9501.

(Conference Paper)

Di Pierro, A., & Norman, G. (Eds.) (n.d.). Unknown Title. In Unknown Conference Vol. 28. Open Publishing Association. doi:10.4204/eptcs.28

DOI: 10.4204/eptcs.28

2009

Buchi complementation made tight (Conference Paper)

Schewe, S. (2009). Buchi complementation made tight. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 3 (pp. 661-672).

Tighter Bounds for the Determinisation of Buchi Automata (Conference Paper)

Schewe, S. (2009). Tighter Bounds for the Determinisation of Buchi Automata. In FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS Vol. 5504 (pp. 167-181). Retrieved from https://www.webofscience.com/

From Parity and Payoff Games to Linear Programming (Conference Paper)

Schewe, S. (2009). From Parity and Payoff Games to Linear Programming. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009 Vol. 5734 (pp. 675-686). Retrieved from https://www.webofscience.com/

Synthese Verteilter Systeme (Conference Paper)

Schewe, S. (2009). Synthese Verteilter Systeme. In Kolloquium zum GI Dissertationspreis. Bonn: GI.

Towards the verification of pervasive systems (Journal article)

Arapinis, M., Calder, M., Denis, L., Fisher, M., Gray, P., Konur, S., . . . Yasmin, R. (2009). Towards the verification of pervasive systems. Electronic Communications of the EASST, 22. doi:10.14279/tuj.eceasst.22.315.312

DOI: 10.14279/tuj.eceasst.22.315.312

2008

An optimal strategy improvement algorithm for solving parity and payoff games (Conference Paper)

Schewe, S. (2008). An optimal strategy improvement algorithm for solving parity and payoff games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 5213 LNCS (pp. 369-384). doi:10.1007/978-3-540-87531-427

DOI: 10.1007/978-3-540-87531-427

Synthesizing Certificates in Networks of Timed Automata (Conference Paper)

Finkbeiner, B., Peter, H. -J., & Schewe, S. (2008). Synthesizing Certificates in Networks of Timed Automata. In RTSS: 2008 REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS (pp. 183-+). doi:10.1109/RTSS.2008.46

DOI: 10.1109/RTSS.2008.46

ATL* satisfiability is 2EXPTIME-complete (Conference Paper)

Schewe, S. (2008). ATL* satisfiability is 2EXPTIME-complete. In AUTOMATA, LANGUAGES AND PROGRAMMING, PT 2, PROCEEDINGS Vol. 5126 (pp. 373-385). Retrieved from https://www.webofscience.com/

RESY: Requirement synthesis for compositional model checking (Conference Paper)

Finkbeiner, B., Peter, H. -J., & Schewe, S. (2008). RESY: Requirement synthesis for compositional model checking. In TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS Vol. 4963 (pp. 463-466). Retrieved from https://www.webofscience.com/

An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games (Conference Paper)

Schewe, S. (n.d.). An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games. In Unknown Conference (pp. 369-384). Springer Berlin Heidelberg. doi:10.1007/978-3-540-87531-4_27

DOI: 10.1007/978-3-540-87531-4_27

2007

SMT-based synthesis of distributed systems (Conference Paper)

Finkbeiner, B., & Schewe, S. (2007). SMT-based synthesis of distributed systems. In Proceedings of the second workshop on Automated formal methods. ACM. doi:10.1145/1345169.1345178

DOI: 10.1145/1345169.1345178

Semi-automatic distributed synthesis (Journal article)

Schewe, S., & Finkbeiner, B. (2007). Semi-automatic distributed synthesis. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 18(1), 113-138. doi:10.1142/S0129054107004590

DOI: 10.1142/S0129054107004590

Bounded synthesis (Conference Paper)

Schewe, S., & Finkbeiner, B. (2007). Bounded synthesis. In AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS Vol. 4762 (pp. 474-+). Retrieved from https://www.webofscience.com/

Distributed synthesis for alternating-time logics (Conference Paper)

Schewe, S., & Finkbeiner, B. (2007). Distributed synthesis for alternating-time logics. In AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS Vol. 4762 (pp. 268-+). Retrieved from https://www.webofscience.com/

Solving parity games in big steps (Conference Paper)

Schewe, S. (2007). Solving parity games in big steps. In FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS Vol. 4855 (pp. 449-460). Retrieved from https://www.webofscience.com/

Synthesis of asynchronous systems (Conference Paper)

Schewe, S., & Finkbeiner, B. (2007). Synthesis of asynchronous systems. In LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION Vol. 4407 (pp. 127-+). doi:10.1007/978-3-540-71410-1_10

DOI: 10.1007/978-3-540-71410-1_10

2006

Automatic synthesis of assumptions for compositional model checking (Conference Paper)

Finkbeiner, B., Schewe, S., & Brill, M. (2006). Automatic synthesis of assumptions for compositional model checking. In FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2006 Vol. 4229 (pp. 143-158). Retrieved from https://www.webofscience.com/

Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus (Conference Paper)

Schewe, S., & Finkbeiner, B. (2006). Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus. In Unknown Conference (pp. 591-605). Springer Berlin Heidelberg. doi:10.1007/11874683_39

DOI: 10.1007/11874683_39

Selective approaches for solving weak games (Conference Paper)

Helmert, M., Mattmueller, R., & Schewe, S. (2006). Selective approaches for solving weak games. In AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS Vol. 4218 (pp. 200-214). Retrieved from https://www.webofscience.com/

Synthesis for probabilistic environments (Conference Paper)

Schewe, S. (2006). Synthesis for probabilistic environments. In AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS Vol. 4218 (pp. 245-259). Retrieved from https://www.webofscience.com/

2005

Semi-automatic distributed synthesis (Conference Paper)

Finkbeiner, B., & Schewe, S. (2005). Semi-automatic distributed synthesis. In AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS Vol. 3707 (pp. 263-277). Retrieved from https://www.webofscience.com/

Uniform Distributed Synthesis (Conference Paper)

Finkbeiner, B., & Schewe, S. (n.d.). Uniform Distributed Synthesis. In 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05). IEEE. doi:10.1109/lics.2005.53

DOI: 10.1109/lics.2005.53