Compositional synthesis and most general controllers

[1]  Pierre Wolper,et al.  An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages , 1998, Theor. Comput. Sci..

[2]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  Christel Baier,et al.  Checking Equivalence for Reo Networks , 2008, FACS.

[4]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Fair Realizability and Synthesis , 1995, CAV.

[5]  W. M. Wonham,et al.  The control of discrete event systems , 1989, Proc. IEEE.

[6]  Yih-Kuen Tsay,et al.  Tool support for learning Büchi automata and linear temporal logic , 2009, Formal Aspects of Computing.

[7]  Doron A. Peled,et al.  Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator , 1997, Inf. Process. Lett..

[8]  Jean-François Raskin,et al.  Compositional Algorithms for LTL Synthesis , 2010, ATVA.

[9]  Krishnendu Chatterjee,et al.  Generalized Parity Games , 2007, FoSSaCS.

[10]  Christel Baier,et al.  A Compositional Framework for Controller Synthesis , 2011, CONCUR.

[11]  Moshe Tennenholtz,et al.  Distributed Games , 1998, TARK.

[12]  Marcin Jurdziński,et al.  Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..

[13]  Orna Kupfermant,et al.  Synthesis with Incomplete Informatio , 2000 .

[14]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[15]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[16]  Yih-Kuen Tsay,et al.  GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae , 2007, TACAS.

[17]  Krishnendu Chatterjee,et al.  Environment Assumptions for Synthesis , 2008, CONCUR.

[18]  Sven Schewe,et al.  Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata , 2012, ATVA.

[19]  Moshe Y. Vardi.  Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach , 1999, ARTS.

[20]  Krishnendu Chatterjee,et al.  The Complexity of Partial-Observation Parity Games , 2010, LPAR.

[21]  Christel Baier,et al.  A Uniform Framework for Modeling and Verifying Components and Connectors , 2009, COORDINATION.

[22]  Sven Schewe,et al.  Tighter Bounds for the Determinisation of Büchi Automata , 2009, FoSSaCS.

[23]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[24]  Jan Kretínský,et al.  Deterministic Automata for the (F,G)-fragment of LTL , 2012, CAV.

[25]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[26]  Bernd Puchala,et al.  Asynchronous Omega-Regular Games with Partial Information , 2010, MFCS.

[27]  M. Paterson,et al.  A deterministic subexponential algorithm for solving parity games , 2006, SODA 2006.

[28]  Amir Pnueli,et al.  Distributed reactive systems are hard to synthesize , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[29]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[30]  Roman Rabinovich,et al.  Down the Borel Hierarchy: Solving Muller Games via Safety Games , 2012, GandALF.

[31]  Orna Kupferman,et al.  Synthesis of Trigger Properties , 2010, LPAR.

[32]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[33]  Klaus Schneider,et al.  Generating Deterministic $\omega$-Automata for most LTL Formulas by the Breakpoint Construction , 2008, MBMV.

[34]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[35]  Antti Valmari.  A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..

[36]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[37]  Antonín Kucera,et al.  The stuttering principle revisited , 2005, Acta Informatica.

[38]  Christel Baier,et al.  LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[39]  Christel Baier,et al.  Experiments with deterministic omega-automata for formulas of linear temporal logic , 2006, Theor. Comput. Sci..

[40]  Olivier Carton.  Chain Automata , 1994, Theor. Comput. Sci..

[41]  Dietmar Berwanger,et al.  On the Power of Imperfect Information , 2008, FSTTCS.

[42]  Dana Fisman,et al.  Reasoning with Temporal Logic on Truncated Paths , 2003, CAV.

[43]  Christel Baier,et al.  Model checking for a probabilistic branching time logic with fairness , 1998, Distributed Computing.

[44]  Christel Baier,et al.  Partial Order Reduction for Probabilistic Branching Time , 2006, QAPL.

[45]  J. R. Büchi,et al.  Solving sequential conditions by finite-state strategies , 1969 .

[46]  Jaco van de Pol,et al.  Computing Weakest Strategies for Safety Games of Imperfect Information , 2009, TACAS.

[47]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[48]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[49]  Christel Baier,et al.  Symbolic Model Checking for Channel-based Component Connectors , 2007, FOCLASA.

[50]  Igor Walukiewicz,et al.  Permissive strategies: from parity games to safety games , 2002, RAIRO Theor. Informatics Appl..

[51]  Roderick Bloem,et al.  Optimizations for LTL Synthesis , 2006, 2006 Formal Methods in Computer Aided Design.

[52]  Amir Pnueli,et al.  Symbolic Controller Synthesis for Discrete and Timed Systems , 1994, Hybrid Systems.

[53]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[54]  Olivier Carton,et al.  Computing the Rabin Index of a Parity Automaton , 1999, RAIRO Theor. Informatics Appl..

[55]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[56]  Yih-Kuen Tsay,et al.  GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic , 2008, TACAS.

[57]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[58]  Christel Baier,et al.  Principles of model checking , 2008 .

[59]  Christel Baier,et al.  Modeling component connectors in Reo by constraint automata , 2004, Sci. Comput. Program..

[60]  Gerard J. Holzmann,et al.  Not checking for closure under stuttering , 1996, The Spin Verification System.

[61]  Orna Kupferman,et al.  Safraless Compositional Synthesis , 2006, CAV.

[62]  Christof Löding.  Optimal Bounds for Transformations of omega-Automata , 1999, FSTTCS.

[63]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[64]  Patricia Bouyer,et al.  Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited , 2011, ATVA.

[65]  Marcin Jurdziński.  Lectures in Game Theory for Computer Scientists: Algorithms for Solving Parity Games , 2011 .

[66]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[67]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[68]  Ji Wang,et al.  A tighter analysis of Piterman's Büchi determinization , 2009, Inf. Process. Lett..

[69]  Oliver Friedmann,et al.  Solving Parity Games in Practice , 2009, ATVA.

[70]  A. Pnueli,et al.  Effective synthesis of switching controllers for linear systems , 2000, Proceedings of the IEEE.

[71]  Christel Baier,et al.  Hierarchical Modeling and Formal Verification. An Industrial Case Study Using Reo and Vereofy , 2011, FMICS.

[72]  Krishnendu Chatterjee,et al.  Alpaga: A Tool for Solving Parity Games with Imperfect Information , 2009, TACAS.

[73]  Amir Pnueli,et al.  Faster Solutions of Rabin and Streett Games , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[74]  Orna Kupferman,et al.  The Blowup in Translating LTL to Deterministic Automata , 2010, MoChArt.

[75]  Roderick Bloem,et al.  Anzu: A Tool for Property Synthesis , 2007, CAV.

[76]  Robert S. Streett,et al.  Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable , 1982, Inf. Control..

[77]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[78]  Klaus Schneider,et al.  From LTL to Symbolically Represented Deterministic Automata , 2008, VMCAI.

[79]  P. S. Thiagarajan,et al.  Open Systems in Reactive Environments: Control and Synthesis , 2000, CONCUR.

[80]  Krishnendu Chatterjee,et al.  Strategy Construction for Parity Games with Imperfect Information , 2008, CONCUR.

[81]  Nir Piterman,et al.  From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[82]  Christel Baier,et al.  Alternating-Time Stream Logic for Multi-agent Systems , 2008, COORDINATION.

[83]  Christel Baier,et al.  Synthesis of Reo Connectors for Strategies and Controllers , 2014, Fundam. Informaticae.

[84]  Christel Baier,et al.  Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications , 2005, COORDINATION.

[85]  Sven Schewe.  Solving Parity Games in Big Steps , 2007, FSTTCS.

[86]  Helmut Lescow,et al.  Strategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions , 1996, TACAS.

[87]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[88]  Farhad Arbab,et al.  Reo: A Channel-based Coordination Model for Component Composition , 2005 .

[89]  Jan Kretínský,et al.  Rabinizer: Small Deterministic Automata for LTL(F, G) , 2012, ATVA.

[90]  John H. Reif,et al.  The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..

[91]  Keijo Heljanko,et al.  Testing LTL formula translation into Büchi automata , 2002, International Journal on Software Tools for Technology Transfer.

[92]  Rüdiger Ehlers,et al.  Minimising Deterministic Büchi Automata Precisely Using SAT Solving , 2010, SAT.

[93]  Kousha Etessami,et al.  A note on a question of Peled and Wilke regarding stutter-invariant LTL , 2000, Inf. Process. Lett..

[94]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[95]  Jaco van de Pol,et al.  Compositional Control Synthesis for Partially Observable Systems , 2009, CONCUR.