Permissive strategies: from parity games to safety games
RAIRO-Theor. Inf. Appl., 36 3 (2002) 261-275
Published online: 2002-12-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
15217 206 (2025)
https://doi.org/10.1007/978-3-031-75434-0_14
15373 197 (2025)
https://doi.org/10.1007/978-3-031-77019-7_12
Predicate abstraction for hyperliveness verification
Raven Beutner and Bernd FinkbeinerFormal Methods in System Design 66 (2) 238 (2025)
https://doi.org/10.1007/s10703-025-00482-5
15697 177 (2025)
https://doi.org/10.1007/978-3-031-90653-4_9
ltl synthesis under environment specifications for reachability and safety properties
Benjamin Aminof, Giuseppe De Giacomo, Antonio Di Stasio, Hugo Francon, Sasha Rubin and Shufang ZhuInformation and Computation 303 105255 (2025)
https://doi.org/10.1016/j.ic.2024.105255
Formal synthesis of controllers for safety-critical autonomous systems: Developments and challenges
Xiang Yin, Bingzhao Gao and Xiao YuAnnual Reviews in Control 57 100940 (2024)
https://doi.org/10.1016/j.arcontrol.2024.100940
14380 33 (2024)
https://doi.org/10.1007/978-3-031-46002-9_3
Verified Software. Theories, Tools and Experiments.
Suguman Bansal, Giuseppe De Giacomo, Antonio Di Stasio, et al.Lecture Notes in Computer Science, Verified Software. Theories, Tools and Experiments. 13800 1 (2023)
https://doi.org/10.1007/978-3-031-25803-9_1
14282 263 (2023)
https://doi.org/10.1007/978-3-031-43264-4_17
Correct and efficient UAV missions based on temporal planning and in-flight hybrid simulations
Ezequiel Pecker-Marcosig, Sebastián Zudaire, Rodrigo Castro and Sebastián UchitelRobotics and Autonomous Systems 164 104404 (2023)
https://doi.org/10.1016/j.robot.2023.104404
13964 390 (2023)
https://doi.org/10.1007/978-3-031-37706-8_20
13964 436 (2023)
https://doi.org/10.1007/978-3-031-37706-8_22
1 (2023)
https://doi.org/10.1145/3575870.3589555
Bounded game-theoretic semantics for modal mu-calculus
Lauri Hella, Antti Kuusisto and Raine RönnholmInformation and Computation 289 104882 (2022)
https://doi.org/10.1016/j.ic.2022.104882
Computer Aided Verification
Raven Beutner and Bernd FinkbeinerLecture Notes in Computer Science, Computer Aided Verification 13371 341 (2022)
https://doi.org/10.1007/978-3-031-13185-1_17
Deciding Parity Games in Quasi-polynomial Time
Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li and Frank StephanSIAM Journal on Computing 51 (2) STOC17-152 (2022)
https://doi.org/10.1137/17M1145288
Finite-Memory Supervisory Control of Discrete Event Systems for LTL[$\mathcal {F}$] Specifications
Ami Sakakibara, Natsuki Urabe and Toshimitsu UshioIEEE Transactions on Automatic Control 67 (12) 6896 (2022)
https://doi.org/10.1109/TAC.2021.3139221
119 (2021)
https://doi.org/10.1109/MRS50823.2021.9620561
Indecision and delays are the parents of failure—taming them algorithmically by synthesizing delay-resilient control
Mingshuai Chen, Martin Fränzle, Yangjia Li, Peter N. Mosaad and Naijun ZhanActa Informatica 58 (5) 497 (2021)
https://doi.org/10.1007/s00236-020-00374-7
97 (2021)
https://doi.org/10.1002/9781119723950.ch6
Logical time control of concurrent DES
Jean-Luc Béchennec, Didier Lime and Olivier H. RouxDiscrete Event Dynamic Systems 31 (2) 185 (2021)
https://doi.org/10.1007/s10626-020-00333-x
Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants
Lauri Hella, Antti Kuusisto and Raine RönnholmElectronic Proceedings in Theoretical Computer Science 326 82 (2020)
https://doi.org/10.4204/EPTCS.326.6
On-Line Permissive Supervisory Control of Discrete Event Systems for scLTL Specifications
Ami Sakakibara and Toshimitsu UshioIEEE Control Systems Letters 4 (3) 530 (2020)
https://doi.org/10.1109/LCSYS.2020.2971029
92 (2019)
https://doi.org/10.1109/ACSD.2019.00020
297 (2018)
https://doi.org/10.1109/ALLERTON.2018.8635905
Assume-admissible synthesis
Romain Brenguier, Jean-François Raskin and Ocan SankurActa Informatica 54 (1) 41 (2017)
https://doi.org/10.1007/s00236-016-0273-2
1 (2017)
https://doi.org/10.1109/LICS.2017.8005092
Synthesis of Joint Control and Active Sensing Strategies Under Temporal Logic Constraints
Jie Fu and Ufuk TopcuIEEE Transactions on Automatic Control 61 (11) 3464 (2016)
https://doi.org/10.1109/TAC.2016.2518639
7081 (2016)
https://doi.org/10.1109/CDC.2016.7799360
5714 (2016)
https://doi.org/10.1109/CDC.2016.7799147
Compositional construction of most general controllers
Joachim Klein, Christel Baier and Sascha KlüppelholzActa Informatica 52 (4-5) 443 (2015)
https://doi.org/10.1007/s00236-015-0239-9
Automata Techniques for Epistemic Protocol Synthesis
Guillaume Aucher, Bastien Maubert and Sophie PinchinatElectronic Proceedings in Theoretical Computer Science 146 97 (2014)
https://doi.org/10.4204/EPTCS.146.13
Down the Borel hierarchy: Solving Muller games via safety games
Daniel Neider, Roman Rabinovich and Martin ZimmermannTheoretical Computer Science 560 219 (2014)
https://doi.org/10.1016/j.tcs.2014.01.017
Safety first: a two-stage algorithm for the synthesis of reactive systems
Saqib Sohail and Fabio SomenziInternational Journal on Software Tools for Technology Transfer 15 (5-6) 433 (2013)
https://doi.org/10.1007/s10009-012-0224-3
Playing Pushdown Parity Games in a Hurry
Wladimir Fridman and Martin ZimmermannElectronic Proceedings in Theoretical Computer Science 96 183 (2012)
https://doi.org/10.4204/EPTCS.96.14
Down the Borel Hierarchy: Solving Muller Games via Safety Games
Daniel Neider, Roman Rabinovich and Martin ZimmermannElectronic Proceedings in Theoretical Computer Science 96 169 (2012)
https://doi.org/10.4204/EPTCS.96.13
CONCUR 2010 - Concurrency Theory
Krishnendu Chatterjee, Florian Horn and Christof LödingLecture Notes in Computer Science, CONCUR 2010 - Concurrency Theory 6269 284 (2010)
https://doi.org/10.1007/978-3-642-15375-4_20
Strategy construction for parity games with imperfect information
Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen and Thomas A. HenzingerInformation and Computation 208 (10) 1206 (2010)
https://doi.org/10.1016/j.ic.2009.09.006
77 (2009)
https://doi.org/10.1109/FMCAD.2009.5351138
CONCUR 2009 - Concurrency Theory
Patricia Bouyer, Marie Duflot, Nicolas Markey and Gabriel RenaultLecture Notes in Computer Science, CONCUR 2009 - Concurrency Theory 5710 196 (2009)
https://doi.org/10.1007/978-3-642-04081-8_14
CONCUR 2008 - Concurrency Theory
Krishnendu Chatterjee, Thomas A. Henzinger and Barbara JobstmannLecture Notes in Computer Science, CONCUR 2008 - Concurrency Theory 5201 147 (2008)
https://doi.org/10.1007/978-3-540-85361-9_14
Deriving Available Behavior All Out from Incompatible Component Compositions
Yan Zhang, Jun Hu, Xiaofeng Yu, et al.Electronic Notes in Theoretical Computer Science 160 349 (2006)
https://doi.org/10.1016/j.entcs.2006.05.033
1 (2005)
https://doi.org/10.1109/CDC.2005.1582121
Computer Science Logic
Damian NiwińskiLecture Notes in Computer Science, Computer Science Logic 2471 27 (2002)
https://doi.org/10.1007/3-540-45793-3_3
Algebraic Methodology and Software Technology
Igor WalukiewiczLecture Notes in Computer Science, Algebraic Methodology and Software Technology 2422 15 (2002)
https://doi.org/10.1007/3-540-45719-4_2