default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnne-Kathrin Schmuck
Person information
- affiliation: Max-Planck Institute for Software Systems, Kaiserslautern, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Anne-Kathrin Schmuck
, Philippe Heim, Rayna Dimitrova, Satya Prakash Nayak:
Localized Attractor Computations for Infinite-State Games. CAV (3) 2024: 135-158- [c32]Daniel Hausmann, Nir Piterman, Irmak Saglam, Anne-Kathrin Schmuck:
Fair ømega-Regular Games. FoSSaCS (1) 2024: 13-33 - [c31]Ashwani Anand, Anne-Kathrin Schmuck, Satya Prakash Nayak:
Contract-Based Distributed Logical Controller Synthesis. HSCC 2024: 11:1-11:11 - [c30]Ameneh Nejati, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Context-triggered Games for Reactive Synthesis over Stochastic Systems via Control Barrier Certificates. HSCC 2024: 21:1-21:12 - [c29]Satya Prakash Nayak, Anne-Kathrin Schmuck:
Most General Winning Secure Equilibria Synthesis in Graph Games. TACAS (3) 2024: 173-193 - [c28]Anne-Kathrin Schmuck, K. S. Thejaswini, Irmak Saglam, Satya Prakash Nayak:
Solving Two-Player Games Under Progress Assumptions. VMCAI (1) 2024: 208-231 - [i25]Satya Prakash Nayak, Anne-Kathrin Schmuck:
Most General Winning Secure Equilibria Synthesis in Graph Games. CoRR abs/2401.09957 (2024) - [i24]Anne-Kathrin Schmuck, Philippe Heim, Rayna Dimitrova, Satya Prakash Nayak:
Localized Attractor Computations for Infinite-State Games (Full Version). CoRR abs/2405.09281 (2024) - 2023
- [j8]Rupak Majumdar, Anne-Kathrin Schmuck:
Supervisory Controller Synthesis for Nonterminating Processes Is an Obliging Game. IEEE Trans. Autom. Control. 68(1): 385-392 (2023) - [j7]Tamajit Banerjee, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, Sadegh Soudjani:
Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness. TheoretiCS 2 (2023) - [c27]Rupak Majumdar, Kaushik Mallik, Mateusz Rychlicki, Anne-Kathrin Schmuck, Sadegh Soudjani:
A Flexible Toolchain for Symbolic Rabin Games under Fair and Stochastic Uncertainties. CAV (3) 2023: 3-15 - [c26]Ashwani Anand, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Synthesizing Permissive Winning Strategy Templates for Parity Games. CAV (1) 2023: 436-458 - [c25]Irmak Saglam, Anne-Kathrin Schmuck:
Solving Odd-Fair Parity Games. FSTTCS 2023: 34:1-34:24 - [c24]Mehrdad Zareian, Anne-Kathrin Schmuck:
Lazy Synthesis of Symbolic Output-Feedback Controllers for State-Based Safety Specifications. HSCC 2023: 9:1-9:7 - [c23]Lucas Neves Egidio, Satya Prakash Nayak, Matteo Della Rossa, Anne-Kathrin Schmuck, Raphaël M. Jungers:
Poster Abstract: Towards Seamless Reactivity of Hybrid Control. HSCC 2023: 27:1-27:2 - [c22]Rupak Majumdar, Kaushik Mallik, Mateusz Rychlicki, Anne-Kathrin Schmuck, Sadegh Soudjani:
Poster Abstract: A Toolchain for Accelerated Symbolic Control. HSCC 2023: 28:1-28:2 - [c21]Ashwani Anand, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Poster Abstract: Permissiveness for Strategy Adaptation. HSCC 2023: 29:1-29:2 - [c20]Ashwani Anand, Kaushik Mallik, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Computing Adequately Permissive Assumptions for Synthesis. TACAS (2) 2023: 211-228 - [i23]Ashwani Anand, Kaushik Mallik, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Computing Adequately Permissive Assumptions for Synthesis. CoRR abs/2301.07563 (2023) - [i22]Satya Prakash Nayak, Lucas Neves Egidio, Matteo Della Rossa, Anne-Kathrin Schmuck, Raphaël M. Jungers:
Context-triggered Abstraction-based Control Design. CoRR abs/2305.03399 (2023) - [i21]Ashwani Anand, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Synthesizing Permissive Winning Strategy Templates for Parity Games. CoRR abs/2305.14026 (2023) - [i20]Ashwani Anand, Satya Prakash Nayak, Anne-Kathrin Schmuck:
Contract-Based Distributed Synthesis in Two-Objective Parity Games. CoRR abs/2307.06212 (2023) - [i19]Irmak Saglam, Anne-Kathrin Schmuck:
Solving Odd-Fair Parity Games. CoRR abs/2307.13396 (2023) - [i18]Anne-Kathrin Schmuck, K. S. Thejaswini, Irmak Saglam, Satya Prakash Nayak:
Solving Two-Player Games under Progress Assumptions. CoRR abs/2310.12767 (2023) - [i17]Daniel Hausmann, Nir Piterman, Irmak Saglam, Anne-Kathrin Schmuck:
Fair $ω$-Regular Games. CoRR abs/2310.13612 (2023) - 2022
- [c19]Bernd Finkbeiner, Kaushik Mallik, Noemi Passing, Malte Schledjewski, Anne-Kathrin Schmuck:
BOCoSy: Small but Powerful Symbolic Output-Feedback Control. HSCC 2022: 24:1-24:11 - [c18]Tamajit Banerjee, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, Sadegh Soudjani:
A Direct Symbolic Algorithm for Solving Stochastic Rabin Games. TACAS (2) 2022: 81-98 - [i16]Tamajit Banerjee, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, Sadegh Soudjani:
Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness. CoRR abs/2202.07480 (2022) - 2021
- [c17]Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, Sadegh Soudjani:
Symbolic Qualitative Control for Stochastic Systems via Finite Parity Games. ADHS 2021: 127-132 - [i15]Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, Sadegh Soudjani:
Symbolic Control for Stochastic Systems via Parity Games. CoRR abs/2101.00834 (2021) - [i14]Anne-Kathrin Schmuck, Mehrdad Zareian:
Abstraction-Based Output-Feedback Control with State-Based Specifications. CoRR abs/2104.10974 (2021) - 2020
- [j6]Anne-Kathrin Schmuck, Thomas Moor, Rupak Majumdar:
On the relation between reactive synthesis and supervisory control of non-terminating processes. Discret. Event Dyn. Syst. 30(1): 81-124 (2020) - [j5]Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, Damien Zufferey:
Assume-Guarantee Distributed Synthesis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(11): 3215-3226 (2020) - [c16]Stanly Samuel, Kaushik Mallik, Anne-Kathrin Schmuck, Daniel Neider:
Resilient Abstraction-Based Controller Design. CDC 2020: 2123-2129 - [c15]Rupak Majumdar, Necmiye Ozay, Anne-Kathrin Schmuck:
On abstraction-based controller design with output feedback. HSCC 2020: 15:1-15:11 - [c14]Stanly Samuel, Kaushik Mallik, Anne-Kathrin Schmuck, Daniel Neider:
Resilient abstraction-based controller design. HSCC 2020: 33:1-33:2 - [i13]Rupak Majumdar, Necmiye Ozay, Anne-Kathrin Schmuck:
On Abstraction-Based Controller Design With Output Feedback. CoRR abs/2002.02687 (2020) - [i12]Rupak Majumdar, Anne-Kathrin Schmuck:
Supervisory Controller Synthesis for Non-terminating Processes is an Obliging Game. CoRR abs/2007.01773 (2020) - [i11]Stanly Samuel, Kaushik Mallik, Anne-Kathrin Schmuck, Daniel Neider:
Resilient Abstraction-Based Controller Design. CoRR abs/2008.06315 (2020)
2010 – 2019
- 2019
- [j4]Kaushik Mallik, Anne-Kathrin Schmuck, Sadegh Soudjani, Rupak Majumdar:
Compositional Synthesis of Finite-State Abstractions. IEEE Trans. Autom. Control. 64(6): 2629-2636 (2019) - [c13]Kyle Hsu, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck:
Lazy Abstraction-Based Controller Synthesis. ATVA 2019: 23-47 - [c12]Yunjun Bai, Kaushik Mallik, Anne-Kathrin Schmuck, Damien Zufferey, Rupak Majumdar:
Incremental Abstraction Computation for Symbolic Controller Synthesis in a Changing Environment. CDC 2019: 6261-6268 - [c11]Gregor B. Banusic, Rupak Majumdar, Marcus Pirron, Anne-Kathrin Schmuck, Damien Zufferey:
PGCD: robot programming and verification with geometry, concurrency, and dynamics. ICCPS 2019: 57-66 - [c10]Rupak Majumdar, Nir Piterman, Anne-Kathrin Schmuck:
Environmentally-Friendly GR(1) Synthesis. TACAS (2) 2019: 229-246 - [i10]Rupak Majumdar, Nir Piterman, Anne-Kathrin Schmuck:
Environmentally-friendly GR(1) Synthesis. CoRR abs/1902.05629 (2019) - 2018
- [c9]Kyle Hsu, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck:
Lazy Abstraction-Based Control for Safety Specifications. CDC 2018: 4902-4907 - [c8]Kyle Hsu, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck:
Multi-Layered Abstraction-Based Controller Synthesis for Continuous-Time Systems. HSCC 2018: 120-129 - [i9]Kyle Hsu, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck:
Lazy Abstraction-Based Control for Safety Specifications. CoRR abs/1804.02666 (2018) - [i8]Kyle Hsu, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck:
Lazy Abstraction-Based Control for Reachability. CoRR abs/1804.02722 (2018) - 2017
- [j3]Anne-Kathrin Schmuck, Rupak Majumdar, Adrian Leva:
Dynamic hierarchical reactive controller synthesis. Discret. Event Dyn. Syst. 27(2): 261-299 (2017) - [c7]Kaushik Mallik, Sadegh Esmaeil Zadeh Soudjani, Anne-Kathrin Schmuck, Rupak Majumdar:
Compositional construction of finite state abstractions for stochastic control systems. CDC 2017: 550-557 - [i7]Kaushik Mallik, Sadegh Esmaeil Zadeh Soudjani, Anne-Kathrin Schmuck, Rupak Majumdar:
Compositional Construction of Finite State Abstractions for Stochastic Control Systems. CoRR abs/1709.09546 (2017) - 2016
- [j2]Anne-Kathrin Schmuck, Sven Schneider, Jörg Raisch, Uwe Nestmann:
Supervisory control synthesis for deterministic context free specification languages - Enforcing controllability least restrictively. Discret. Event Dyn. Syst. 26(1): 5-32 (2016) - [c6]Kaushik Mallik, Anne-Kathrin Schmuck:
Supervisory controller synthesis for decomposable deterministic context free specification languages. WODES 2016: 22-27 - [i6]Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck:
Compositional Synthesis of Finite State Abstractions. CoRR abs/1612.08515 (2016) - 2015
- [b1]Anne-Kathrin Schmuck:
Building bridges in abstraction-based controller synthesis: advancing, combining, and comparing methods from computer and control. Technical University of Berlin, Germany, 2015 - [c5]Anne-Kathrin Schmuck, Paulo Tabuada, Jörg Raisch:
Comparing asynchronous l-complete approximations and quotient based abstractions. CDC 2015: 6823-6829 - [i5]Anne-Kathrin Schmuck, Paulo Tabuada, Jörg Raisch:
Comparing Asynchronous l-Complete Approximations and Quotient Based Abstractions. CoRR abs/1503.07139 (2015) - [i4]Anne-Kathrin Schmuck, Rupak Majumdar:
Dynamic Hierarchical Reactive Controller Synthesis. CoRR abs/1510.07246 (2015) - 2014
- [j1]Anne-Kathrin Schmuck, Jörg Raisch:
Asynchronous I-complete approximations. Syst. Control. Lett. 73: 67-75 (2014) - [c4]Anne-Kathrin Schmuck, Jörg Raisch:
Constructing (Bi)similar finite state abstractions using asynchronous l-complete approximations. CDC 2014: 6744-6751 - [c3]Anne-Kathrin Schmuck, Jörg Raisch:
Simulation and bisimulation over multiple time scales in a behavioral setting. MED 2014: 517-524 - [c2]Sven Schneider, Anne-Kathrin Schmuck, Uwe Nestmann, Jörg Raisch:
Reducing an Operational Supervisory Control Problem by Decomposition for Deterministic Pushdown Automata. WODES 2014: 214-221 - [c1]Anne-Kathrin Schmuck, Sven Schneider, Jörg Raisch, Uwe Nestmann:
Extending Supervisory Controller Synthesis to Deterministic Pushdown Automata - Enforcing Controllability Least Restrictively. WODES 2014: 286-293 - [i3]Anne-Kathrin Schmuck, Jörg Raisch:
Simulation and Bisimulation over Multiple Time Scales in a Behavioral Setting. CoRR abs/1402.3484 (2014) - [i2]Anne-Kathrin Schmuck, Jörg Raisch:
Constructing (Bi)Similar Finite State Abstractions using Asynchronous $l$-Complete Approximations. CoRR abs/1402.3506 (2014) - [i1]Anne-Kathrin Schmuck, Jörg Raisch:
Asynchronous $l$-Complete Approximations. CoRR abs/1402.5759 (2014)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:11 CEST 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:
