The Element of Surprise in Timed Games

Alfaro, Luca de; Faella, Marco; Henzinger, Thomas A.; Majumdar, Rupak; Stoelinga, Mariëlle

doi:10.1007/978-3-540-45187-7_9

Cited by 92 publications

(137 citation statements)

References 11 publications

Supporting

Mentioning

136

Contrasting

Order By: Relevance

“…Given a clock value u, we define a satisfaction relation |= u between configurations and formulas in Φ(Q) according to the intuition that when the automaton is in state q with clock value u, then it can make an instantaneous a-transition to configuration C if 4 C |= u δ(q, a). Formally, |= u is defined inductively as follows: C |= u q if (q, u) ∈ C, C |= u x k if u k, C |= u x.ψ if C |= 0 ψ, and the boolean connectives are handled in the obvious way.…”

Section: Alternating Timed Automatamentioning

confidence: 99%

“…More formally, the control problem asks, given a system S and a specification ϕ, whether there exists a controller C such that S guided by C satisfies ϕ. Since the mid-90's, the control of real-time systems has developed a lot [8,17,13,16,15,11,4], and several kinds of properties have been investigated, for instance properties based on states of the system [8,17,4], or expressed in LTL [15], or in the branchingtime timed temporal logic TCTL [16], or even expressed by timed automata [13]. However, to our knowledge no work has investigated the control problem against properties expressed in a linear-time timed temporal logic.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Controller Synthesis for MTL Specifications

Bouyer

Bozzelli

Chevalier

2006

CONCUR 2006 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL with timing constraints on modalities, and recently, its model-checking has been proved decidable in several cases. We investigate these decidable fragments of MTL (full MTL when interpreted over finite timed words, and Safety-MTL when interpreted over infinite timed words), and prove two kinds of results.(1) We first prove that, contrary to model-checking, the control problem is undecidable. Roughly, the computation of a lossy channel system could be encoded as a model-checking problem, and we prove here that a perfect channel system can be encoded as a control problem. (2) We then prove that if we fix the resources of the controller (by resources we mean clocks and constants that the controller can use), the control problem becomes decidable. This decidability result relies on properties of well (and better) quasi-orderings.

show abstract

Section: Alternating Timed Automatamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Controller Synthesis for MTL Specifications

Bouyer

Bozzelli

Chevalier

2006

CONCUR 2006 – Concurrency Theory

View full text Add to dashboard Cite

show abstract

“…Synthesis of real-time systems has mostly been studied in the context of controller synthesis and game theory [Asarin et al 1998;Asarin and Maler 1999;D'Souza and Madhusudan 2002;Bouyer et al 2003;de Alfaro et al 2003;Faella et al 2002]. In these papers, the common assumption is that the existing program (called a plant in controller synthesis and a game in game theory) and/or the given specification are deterministic.…”

Section: Example: Real-time Resource Allocationmentioning

confidence: 99%

“…In these papers, since the authors consider highly expressive specifications, the complexity of the proposed methods is very high. For example, synthesis problems presented in [Faella et al 2002;Asarin et al 1998;Asarin and Maler 1999;de Alfaro et al 2003] are Exptime-complete. Moreover, deciding the existence of a solution (called a controller) in [D'Souza and Madhusudan 2002;Bouyer et al 2003] is 2Exptime-complete.…”

Section: Example: Real-time Resource Allocationmentioning

confidence: 99%

Revising UNITY Programs: Possibilities and Limitations

Ebnenasir

Kulkarni

Bonakdarpour

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We concentrate on automatic addition of untimed and real-time UNITY properties to programs by local redesign. The main focus of this paper is to identify instances where addition of UNITY properties can be achieved efficiently (in polynomial time) and where the problem of adding UNITY properties is difficult (NP-complete).Regarding addition of UNITY properties in polynomial time, we present a sound and complete algorithm that adds a single leads-to property (respectively, bounded-time leads-to property) and a conjunction of unless, stable, and invariant properties (respectively, bounded-time unless and stable) to an existing untimed (respectively, real-time) UNITY program. Since ensures can be expressed as a conjunction of a leads-to and unless, our algorithms can also be used to add one ensures property along with a conjunction of safety properties.Regarding hardness results, we show that (1) while one leads-to (respectively, ensures) property can be added in polynomial time, the problem of adding two such properties (or any combination of leads-to and ensures) is NP-complete, (2) if maximum non-determinism is desired then the problem of adding even a single leads-to property is NP-complete, and (3) the problem of providing maximum non-determinism while adding a single bounded-time leads-to property to a real-time program is NP-complete (in the size of the time-abstract bisimulation representation of the program) even if the original program satisfies the corresponding unbounded leads-to property.

show abstract

“…Synthesis of real-time systems has mostly been studied in the context of controller synthesis and game theory [10][11][12][13][14][15]. In these papers, the common assumption is that the existing program (called a plant) and/or the given specification are deterministic.…”

Section: Related Workmentioning

confidence: 99%

Incremental Synthesis of Fault-Tolerant Real-Time Programs

Bonakdarpour

Kulkarni

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we focus on the problem of automated addition of faulttolerance to an existing fault-intolerant real-time program. We consider three levels of fault-tolerance, namely nonmasking, failsafe, and masking, based on safety and liveness properties satisfied in the presence of faults. More specifically, a nonmasking (respectively, failsafe, masking) program satisfies liveness (respectively, safety, both safety and liveness) in the presence of faults. For failsafe and masking fault-tolerance, we consider two additional levels, soft and hard, based on satisfaction of timing constraints in the presence of faults. We present a polynomial time algorithm (in the size of the input program's region graph) that adds bounded-time recovery from an arbitrary given set of states to another arbitrary set of states. Using this algorithm, we propose a sound and complete synthesis algorithm that transforms a fault-intolerant real-time program into a nonmasking fault-tolerant program. Furthermore, we introduce sound and complete algorithms for adding soft/hard-failsafe fault-tolerance. For reasons of space, our results on addition of soft/hard-masking fault-tolerance are presented in a technical report.

show abstract

The Element of Surprise in Timed Games

Cited by 92 publications

References 11 publications

Controller Synthesis for MTL Specifications

Controller Synthesis for MTL Specifications

Revising UNITY Programs: Possibilities and Limitations

Incremental Synthesis of Fault-Tolerant Real-Time Programs

Contact Info

Product

Resources

About