A Hybrid Algorithm for LTL Games

DOI10.1007/978-3-540-78163-9_26MaRDI QIDQ5452725zbMATH OpenOpenAlexFDO

Authors Sohail, Fabio Somenzi, Kavita Ravi

Publication date 4 April 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78163-9_26

Mathematics Subject Classification ID

Temporal logic (03B44) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Applications of game theory (91A80)

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• Compositional algorithms for LTL synthesis
• Practical synthesis of reactive systems from LTL specifications via parity games
• Synthesis of Reactive(1) designs
• Synthesis from LTL specifications with mean-payoff objectives

Cited in

(14)

• Practical synthesis of reactive systems from LTL specifications via parity games
• A symbolic algorithm for lazy synthesis of eager strategies
• Nearly optimal verifiable data streaming
• Reachability games for linear hybrid systems
• Semantic labelling and learning for parity game solving in LTL synthesis
• Interpolation-based GR(1) assumptions refinement
• scientific article; zbMATH DE number 1361131 (Why is no real title available?)
• Towards a notion of unsatisfiable and unrealizable cores for LTL
• Synthesis of Reactive(1) designs
• scientific article; zbMATH DE number 1948167 (Why is no real title available?)
• Compositional algorithms for LTL synthesis
• Iterative synthesis of control guards ensuring invariance and inevitability in discrete-decision games
• Tools and Algorithms for the Construction and Analysis of Systems
• Guessing winning policies in LTL synthesis by semantic learning

This page was built for publication: A Hybrid Algorithm for LTL Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452725)