Algorithms for Omega-Regular Games with Imperfect Information

Chatterjee, Krishnendu; Doyen, Laurent; Henzinger, Thomas A.; Raskin, Jean-François

doi:10.2168/lmcs-3(3:4)2007

Cited by 76 publications

(28 citation statements)

References 24 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Second, we identify structural properties in the underlying automata constructions that allow us to define an antichain algorithm for solving the LTL realizability problem. This is in line with our previous works in [6,7,25,8] that use subsumption to obtain efficient implementations of several variants of subset constructions. Third, we study compositional algorithms to solve safety games, and we show how they can be used to develop compositional algorithms for solving the realizability and synthesis problems of large and structured LTL specifications.…”

Section: Contributionssupporting

confidence: 89%

Antichains and compositional algorithms for LTL synthesis

Filiot

Jin

Raskin

2011

Form Methods Syst Des

View full text Add to dashboard Cite

In this paper, we present new monolithic and compositional algorithms to solve the LTL realizability problem. Those new algorithms are based on a reduction of the LTL realizability problem to a game whose winning condition is defined by a universal automaton on infinite words with a k-co-Büchi acceptance condition. This acceptance condition asks that runs visit at most k accepting states, so it implicitly defines a safety game. To obtain efficient algorithms from this construction, we need several additional ingredients. First, we study the structure of the underlying automata constructions, and we show that there exists a partial order that structures the state space of the underlying safety game. This partial order can be used to define an efficient antichain algorithm. Second, we show that the algorithm can be implemented in an incremental way by considering increasing values of k in the acceptance condition. Finally, we show that for large LTL formulas that are written as conjunctions of smaller formulas, we can solve the problem compositionally by first computing winning strategies for each conjunct that appears in the large formula. We report on the behavior of those algorithms on several benchmarks. We show that the compositional algorithms are able to handle LTL formulas that are several pages long.

show abstract

Section: Contributionssupporting

confidence: 89%

Antichains and compositional algorithms for LTL synthesis

Filiot

Jin

Raskin

2011

Form Methods Syst Des

View full text Add to dashboard Cite

show abstract

“…Raskin et al proposed an algorithm to check the existence of observation-based strategies for twoplayer turn-based games on graphs with ω-regular objectives [23]. They are interested in the existence of winning observation-based strategies, that is, strategies with imperfect information and perfect recall.…”

Section: Resultsmentioning

confidence: 99%

A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability

Busard

Pecheur

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Since the introduction of Alternating-time Temporal Logic (AT L), many logics have been proposed to reason about different strategic capabilities of the agents of a system. In particular, some logics have been designed to reason about the uniform memoryless strategies of such agents. These strategies are the ones the agents can effectively play by only looking at what they observe from the current state. AT L ir can be seen as the core logic to reason about such uniform strategies. Nevertheless, its model-checking problem is difficult-it requires a polynomial number of calls to an NP oracle-, and practical algorithms to solve it appeared only recently.This paper proposes a technique for model checking uniform memoryless strategies. Existing techniques build the strategies from the states of interest-such as the initial states-through a forward traversal of the system. On the other hand, the proposed approach builds the winning strategies from the target states through a backward traversal, making sure that only uniform strategies are explored. Nevertheless, building the strategies from the ground up limits its applicability to constrained reachability objectives only. This paper describes the approach in details and compares it experimentally with existing approaches implemented into a BDD-based framework. These experiments show that the technique is competitive on the cases it can handle. * This research is financed by the Walloon Region as part of the Logistics in Wallonia competitiveness pole. 1 A ∆ P 2 problem requires a polynomial number of calls to an NP oracle.

show abstract

“…We aim to provide an event-based controller synthesis technique that allows for domain models where the environment behaves nondeterministically. We believe that this issue could be tackled by adapting strategy construction algorithms for two-player games with imperfect information [20]. The model proposed by such games is appropriate to be applied in event-based controller synthesis where the controller must deal with a domain model that is considered an enemy but its full state is unknown to the controller.…”

Section: Dealing With Incomplete Informationmentioning

confidence: 99%

Synthesis of event-based controllers: A software engineering challenge

D'Ippolito¹

2012

2012 34th International Conference on Software Engineering (ICSE)

View full text Add to dashboard Cite

Existing software engineering techniques for automatic synthesis of event-based controllers have various limitations. In the context of the world/machine approach such limitations can be seen as restrictions in the expressiveness of the controller goals and domain model specifications or in the relation between the controllable and monitorable actions. In this thesis we aim to provide techniques that overcome such limitations, e.g. supporting more expressive goal specifications, distinguishing controllable from monitorable actions or guaranteeing achievement of the desired goals, among others. Hence, improving the state of the art in the synthesis of event-based controllers. Moreover, we plan to provide efficient tools supporting the developed techniques and evaluate them by modelling known case studies from the software engineering literature. Ultimately, showing that by allowing more expressiveness of controller goals and domain model specifications, and explicitly distinguishing controllable and monitorable actions such case studies can be more accurately modelled and solutions guaranteeing satisfaction of the goals can be achieved. Keywords-controller synthesis; behavioural modelling I. RESEARCH PROBLEMRequirements Engineering (RE) has a key role in eliciting, elaborating, analysing, specifying and documenting the goals of the desired system. One of the most influential approaches for RE is the Goal Oriented Requirements Engineering (GORE) approach [1] which states that the requirements R for the interface between the machine and the world [2] together with the domain description D must entail the machine goals G. Formally, R, D |= G.The problem of generating an operational description that guarantees the entailment, given a set of descriptive assumptions on the environment behaviour and a set of goals for the machine, can be seen as a synthesis problem.Controller synthesis [3], [4] is a well studied problem that attempts to automatically generate an operational behaviour model of the system-to-be such that when deployed in a given domain model that behaves according to specified assumptions satisfies a given goal. Controller synthesis techniques have been used in several domains such as synthesis of glue code and component adaptors in order to achieve safe composition at the architecture level [5], also in particular in service oriented architectures [6], or to synthesise adaptation strategies in self-adaptive systems [7].Existing software engineering techniques for automatic synthesis of event-based controllers have various limitations.In the context of the world/machine approach such limitations can be seen as restrictions in the expressiveness of the controller goals and domain model specifications, the relation between the controllable and monitorable actions, or scalability problems.Most SE techniques restrict controller goals and environment assumptions to safety properties. Hence, synthesis can be posed as a backward error propagation variant where a behaviour model is pruned by disabling controllable...

show abstract

Algorithms for Omega-Regular Games with Imperfect Information

Cited by 76 publications

References 24 publications

Antichains and compositional algorithms for LTL synthesis

Antichains and compositional algorithms for LTL synthesis

A Backward-traversal-based Approach for Symbolic Model Checking of Uniform Strategies for Constrained Reachability

Synthesis of event-based controllers: A software engineering challenge

Contact Info

Product

Resources

About