20,567 research outputs found

    Assume-Admissible Synthesis

    Get PDF
    In this paper, we introduce a novel rule for synthesis of reactive systems, applicable to systems made of n components which have each their own objectives. It is based on the notion of admissible strategies. We compare our novel rule with previous rules defined in the literature, and we show that contrary to the previous proposals, our rule defines sets of solutions which are rectangular. This property leads to solutions which are robust and resilient. We provide algorithms with optimal complexity and also an abstraction framework.Comment: 31 page

    Non-Zero Sum Games for Reactive Synthesis

    Get PDF
    In this invited contribution, we summarize new solution concepts useful for the synthesis of reactive systems that we have introduced in several recent publications. These solution concepts are developed in the context of non-zero sum games played on graphs. They are part of the contributions obtained in the inVEST project funded by the European Research Council.Comment: LATA'16 invited pape

    Stabilization of Linear Systems with Structured Perturbations

    Get PDF
    The problem of stabilization of linear systems with bounded structured uncertainties are considered in this paper. Two notions of stability, denoted quadratic stability (Q-stability) and ÎĽ-stability, are considered, and corresponding notions of stabilizability and detectability are defined. In both cases, the output feedback stabilization problem is reduced via a separation argument to two simpler problems: full information (FI) and full control (FC). The set of all stabilizing controllers can be parametrized as a linear fractional transformation (LFT) on a free stable parameter. For Q-stability, stabilizability and detectability can in turn be characterized by Linear Matrix Inequalities (LMIs), and the FI and FC Q-stabilization problems can be solved using the corresponding LMIs. In the standard one-dimensional case the results in this paper reduce to well-known results on controller parametrization using state-space methods, although the development here relies more heavily on elegant LFT machinery and avoids the need for coprime factorizations

    Interval-based Synthesis

    Get PDF
    We introduce the synthesis problem for Halpern and Shoham's modal logic of intervals extended with an equivalence relation over time points, abbreviated HSeq. In analogy to the case of monadic second-order logic of one successor, the considered synthesis problem receives as input an HSeq formula phi and a finite set Sigma of propositional variables and temporal requests, and it establishes whether or not, for all possible evaluations of elements in Sigma in every interval structure, there exists an evaluation of the remaining propositional variables and temporal requests such that the resulting structure is a model for phi. We focus our attention on decidability of the synthesis problem for some meaningful fragments of HSeq, whose modalities are drawn from the set A (meets), Abar (met by), B (begins), Bbar (begun by), interpreted over finite linear orders and natural numbers. We prove that the fragment ABBbareq is decidable (non-primitive recursive hard), while the fragment AAbarBBbar turns out to be undecidable. In addition, we show that even the synthesis problem for ABBbar becomes undecidable if we replace finite linear orders by natural numbers.Comment: In Proceedings GandALF 2014, arXiv:1408.556
    • …
    corecore