Robust Controller Synthesis in Timed Automata
|
|
- Rafe Scott
- 5 years ago
- Views:
Transcription
1 Robust Controller Synthesis in Timed Automata Ocan Sankur LSV, ENS Cachan & CNRS Joint with Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
2 Timed Automata and Non-determinism A timed automaton x 2, a, x := 0 x = 1, y := 0 l 0 l 1 l 2 y 2, b, y := 0 Runs y x Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
3 Timed Automata and Non-determinism A timed automaton x 2, a, x := 0 x = 1, y := 0 l 0 l 1 l 2 y 2, b, y := 0 Runs y x Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
4 Timed Automata and Non-determinism A timed automaton x 2, a, x := 0 x = 1, y := 0 l 0 l 1 l 2 y 2, b, y := 0 Runs y x Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
5 Timed Automata and Non-determinism A timed automaton x 2, a, x := 0 x = 1, y := 0 l 0 l 1 l 2 y 2, b, y := 0 Runs y x Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
6 Timed Automata and Non-determinism A timed automaton x 2, a, x := 0 x = 1, y := 0 l 0 l 1 l 2 y 2, b, y := 0 Runs y x Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
7 Timed Automata and Non-determinism A timed automaton x 2, a, x := 0 x = 1, y := 0 l 0 l 1 l 2 y 2, b, y := 0 Runs y x Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
8 Controller Synthesis Given a non-deterministic system, and a specification, compute a strategy to control the system. The system under the strategy is deterministic. an implementation. y 2 1 Example: at any state (l 1, x, y), delay 2 x 2 i.e. half way through the guard x Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
9 Controller Synthesis Given a non-deterministic system, and a specification, compute a strategy to control the system. The system under the strategy is deterministic. an implementation. y 2 1 Example: at any state (l 1, x, y), delay 2 x 2 i.e. half way through the guard x Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
10 Controller Synthesis Given a non-deterministic system, and a specification, compute a strategy to control the system. The system under the strategy is deterministic. an implementation. y 2 1 Example: at any state (l 1, x, y), delay 2 x 2 i.e. half way through the guard x Theorem [Alur & Dill 1994] Computing strategies for Büchi objectives in timed automata is PSPACE-complete. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
11 Robustness in Strategies 1. However exact timings cannot be ensured in real-time systems. So the strategy ( x delay 2 x ) 2 cannot be implemented exactly. Is any strategy valid under an error interval? Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
12 Robustness in Strategies 1. However exact timings cannot be ensured in real-time systems. So the strategy ( x delay 2 x ) 2 cannot be implemented exactly. y In our example, one can show that x is increasing during consecutive visits to l 2, and the guard is x x Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
13 Robustness in Strategies 1. However exact timings cannot be ensured in real-time systems. So the strategy ( x delay 2 x ) 2 cannot be implemented exactly. y In our example, one can show that x is increasing during consecutive visits to l 2, and the guard is x x Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
14 Robustness in Strategies 1. However exact timings cannot be ensured in real-time systems. So the strategy ( x delay 2 x ) 2 cannot be implemented exactly. y In our example, one can show that x is increasing during consecutive visits to l 2, and the guard is x x Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
15 Robustness in Strategies 1. However exact timings cannot be ensured in real-time systems. So the strategy ( x delay 2 x ) 2 cannot be implemented exactly. y In our example, one can show that x is increasing during consecutive visits to l 2, and the guard is x x Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
16 Robustness in Strategies 1. However exact timings cannot be ensured in real-time systems. So the strategy ( x delay 2 x ) 2 cannot be implemented exactly. y In our example, one can show that x is increasing during consecutive visits to l 2, and the guard is x x 2. Strategies may require arbitrary precision. Required delays converge here. When x is closed to 2, no additional delay is supported. Run is theoretically infinite, but it is actually blocking. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
17 Robustness in Strategies (2) Some strategies in timed automata are not realistic, and may require high precision, and can cause convergence. Goal: Develop a theory of robust strategies that tolerate error and avoid convergence. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
18 Robustness in Strategies (2) (Conservative) Perturbation Game: Controller vs Environment. Given A and δ > 0, define G(A) as a game as follows. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d + ɛ = g for all ɛ [ δ, δ]. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
19 Robustness in Strategies (2) (Conservative) Perturbation Game: Controller vs Environment. Given A and δ > 0, define G(A) as a game as follows. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d + ɛ = g for all ɛ [ δ, δ]. 2 Environment chooses ɛ [ δ, +δ], Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
20 Robustness in Strategies (2) (Conservative) Perturbation Game: Controller vs Environment. Given A and δ > 0, define G(A) as a game as follows. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d + ɛ = g for all ɛ [ δ, δ]. 2 Environment chooses ɛ [ δ, +δ], 3 New state is (l, (ν + d + ɛ)[r 0]). Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
21 Robustness in Strategies (2) (Conservative) Perturbation Game: Controller vs Environment. Given A and δ > 0, define G(A) as a game as follows. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d + ɛ = g for all ɛ [ δ, δ]. 2 Environment chooses ɛ [ δ, +δ], 3 New state is (l, (ν + d + ɛ)[r 0]). 1<x<2 y:=0 Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
22 Robustness in Strategies (2) (Conservative) Perturbation Game: Controller vs Environment. Given A and δ > 0, define G(A) as a game as follows. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d + ɛ = g for all ɛ [ δ, δ]. 2 Environment chooses ɛ [ δ, +δ], 3 New state is (l, (ν + d + ɛ)[r 0]). 1<x<2 y:=0 Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
23 Robustness in Strategies (2) (Conservative) Perturbation Game: Controller vs Environment. Given A and δ > 0, define G(A) as a game as follows. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d + ɛ = g for all ɛ [ δ, δ]. 2 Environment chooses ɛ [ δ, +δ], 3 New state is (l, (ν + d + ɛ)[r 0]). 1<x<2 y:=0 Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
24 Robustness in Strategies (2) (Conservative) Perturbation Game: Controller vs Environment. Given A and δ > 0, define G(A) as a game as follows. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d + ɛ = g for all ɛ [ δ, δ]. 2 Environment chooses ɛ [ δ, +δ], 3 New state is (l, (ν + d + ɛ)[r 0]). 1<x<2 y:=0 Previous work: Chatterjee, Henzinger, Prabhu 2008: for fixed δ > 0. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
25 Main Result: Parameterized Robust Control Parameterized robust control Given a timed automaton A, and a Büchi condition φ, decide whether for small enough δ > 0, G(A) satisfies φ. A strategy for δ is valid for all 0 < δ < δ. The problem consists in finding cycles that do not become blocked (converge). Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
26 Main Result: Parameterized Robust Control Parameterized robust control Given a timed automaton A, and a Büchi condition φ, decide whether for small enough δ > 0, G(A) satisfies φ. A strategy for δ is valid for all 0 < δ < δ. The problem consists in finding cycles that do not become blocked (converge). Convergence: Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
27 Main Result: Parameterized Robust Control Parameterized robust control Given a timed automaton A, and a Büchi condition φ, decide whether for small enough δ > 0, G(A) satisfies φ. A strategy for δ is valid for all 0 < δ < δ. The problem consists in finding cycles that do not become blocked (converge). Convergence: Environment can force the play inside a half-space. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
28 Main Result: Parameterized Robust Control Parameterized robust control Given a timed automaton A, and a Büchi condition φ, decide whether for small enough δ > 0, G(A) satisfies φ. A strategy for δ is valid for all 0 < δ < δ. The problem consists in finding cycles that do not become blocked (converge). No Convergence: No such constraining half-spaces. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
29 Main Result: Parameterized Robust Control Parameterized robust control Given a timed automaton A, and a Büchi condition φ, decide whether for small enough δ > 0, G(A) satisfies φ. A strategy for δ is valid for all 0 < δ < δ. The problem consists in finding cycles that do not become blocked (converge). Theorem Parameterized robust control is PSPACE-complete. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
30 Main Result: Parameterized Robust Control Parameterized robust control Given a timed automaton A, and a Büchi condition φ, decide whether for small enough δ > 0, G(A) satisfies φ. A strategy for δ is valid for all 0 < δ < δ. The problem consists in finding cycles that do not become blocked (converge). Theorem Parameterized robust control is PSPACE-complete. Robustly controllable there exists a reachable forgetful cycle. If all states are accepting, then Thick timed automata are exactly those that are robustly controllable. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
31 Reachability in Timed Automata Runs of timed automata can be characterized by runs visiting only the vertices of regions. given the topological closure of the guards. 2 y x Orbit Graph The orbit graph of a cycle on regions is a graph where: - nodes are the vertices of the region. - there is an edge a b, if b is reachable from a along the path. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
32 A cycle is called forgetful if it is strongly connected (Asarin & Basset 2011) Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22 Orbit Graph Example x 2, a, x := 0 x = 1, y := 0 l 0 l 1 l 2 y 2, b, y := y l 1 a 2 1 y l y l 2 b y 2 1 l y l x x x x x
33 Reachability with Orbit Graphs λ 2 λ 1 ν λ 3 For any valuation ν, write ν = λ v, a convex combination of the vertices. Theorem [Puri 2000], [Asarin & Basset 2011] Given a path, and valuation λ v, λ v λ v λ is computed by distributing each λ v to its successors following a probability distribution. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
34 Reachability with Orbit Graphs (1 p q)λ 1 λ 2 ν pλ 1 qλ 1 λ 3 For any valuation ν, write ν = λ v, a convex combination of the vertices. Theorem [Puri 2000], [Asarin & Basset 2011] Given a path, and valuation λ v, λ v λ v λ is computed by distributing each λ v to its successors following a probability distribution. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
35 Reachability with Orbit Graphs λ 2 λ 1 ν λ 3 For any valuation ν, write ν = λ v, a convex combination of the vertices. Theorem [Puri 2000], [Asarin & Basset 2011] Given a path, and valuation λ v, λ v λ v λ is computed by distributing each λ v to its successors following a probability distribution. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
36 Reachability with Orbit Graphs 2λ 2 /3 λ 1 /2 + λ 2 /3 ν λ 3 + λ 1 /2 For any valuation ν, write ν = λ v, a convex combination of the vertices. Theorem [Puri 2000], [Asarin & Basset 2011] Given a path, and valuation λ v, λ v λ v λ is computed by distributing each λ v to its successors following a probability distribution. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
37 Proof 1: When There is an Accepting Forgetful Cycle Show that Controller can win. Claim: If π is a forgetful cycle, then the folded orbit graph of π n is a complete graph for some n 1. In the rest, the graph of π is complete. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
38 Proof 1: When There is an Accepting Forgetful Cycle Show that Controller can win. Claim: If π is a forgetful cycle, then the folded orbit graph of π n is a complete graph for some n 1. In the rest, the graph of π is complete. Claim: If π is has a complete f.o.g., then (ν, ν ) r s, ν ν. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
39 Proof 1: When There is an Accepting Forgetful Cycle Show that Controller can win. Claim: If π is a forgetful cycle, then the folded orbit graph of π n is a complete graph for some n 1. In the rest, the graph of π is complete. Claim: If π is has a complete f.o.g., then (ν, ν ) r s, ν ν. ν ν Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
40 Proof 1: There is an Accepting Forgetful Cycle Controller s strategy: try to come back at the middle of the region. Without perturbations, this is possible by hypothesis: Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
41 Proof 1: There is an Accepting Forgetful Cycle Controller s strategy: try to come back at the middle of the region. Without perturbations, this is possible by hypothesis: Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
42 Proof 1: There is an Accepting Forgetful Cycle Controller s strategy: try to come back at the middle of the region. Without perturbations, this is possible by hypothesis: Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
43 Proof 1: There is an Accepting Forgetful Cycle Controller s strategy: try to come back at the middle of the region. Without perturbations, this is possible by hypothesis: Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
44 Proof 1: There is an Accepting Forgetful Cycle Controller s strategy: try to come back at the middle of the region. Without perturbations, this is possible by hypothesis: Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
45 Proof 1: There is an Accepting Forgetful Cycle Controller s strategy: try to come back at the middle of the region. Without perturbations, this is possible by hypothesis: Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
46 Proof 1: There is an Accepting Forgetful Cycle Under perturbations, we need the controllable predecessors of a subset. δ Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
47 Proof 1: There is an Accepting Forgetful Cycle Under perturbations, we need the controllable predecessors of a subset. δ 2δ Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
48 Proof 1: There is an Accepting Forgetful Cycle Under perturbations, we need the controllable predecessors of a subset. 3δ δ 2δ Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
49 Proof 1: There is an Accepting Forgetful Cycle Under perturbations, we need the controllable predecessors of a subset. 3δ δ 2δ 2δ Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
50 Proof 1: There is an Accepting Forgetful Cycle Under perturbations, we need the controllable predecessors of a subset. 3δ δ 2δ 2δ Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
51 Proof 1: There is an Accepting Forgetful Cycle Under perturbations, we need the controllable predecessors of a subset. lδ 3δ δ kδ 2δ 2δ Each red-blue set is a shrinking of a gray zone. The shrunk DBM data structure can be used to compute / represent these sets, where computations hold for all small enough δ > 0. S., Bouyer, Markey. Shrinking Timed Automata. FSTTCS 11. Bouyer, Markey, S. Robust Reachability in Timed Automata: A Game-Based Approach. ICALP 12. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
52 Case: There is an Accepting Forgetful Cycle A δ B δ Computations with shrunk DBMs hold for all δ [0, δ 0 ], for some δ 0 > 0. Here, for any δ > 0, from A δ, Controller can ensure reaching B δ. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
53 Case: There is an Accepting Forgetful Cycle A δ B δ Computations with shrunk DBMs hold for all δ [0, δ 0 ], for some δ 0 > 0. Here, for any δ > 0, from A δ, Controller can ensure reaching B δ. Claim 1: For (computable) small enough δ > 0, A δ, B δ. Claim 2: For (computable) small enough δ > 0, B δ A δ. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
54 Case: There is an Accepting Forgetful Cycle A δ B δ Computations with shrunk DBMs hold for all δ [0, δ 0 ], for some δ 0 > 0. Here, for any δ > 0, from A δ, Controller can ensure reaching B δ. Claim 1: For (computable) small enough δ > 0, A δ, B δ. Claim 2: For (computable) small enough δ > 0, B δ A δ. Controller ends in A δ at each iteration, so it can repeat its strategy. Controller wins! Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
55 Proof 2: Only Non-Forgetful Cycles Show that if all cycles are non-forgetful, Controller looses. If accepting for Büchi, then for some strategy, some cycle is repeated infinitely often. Assume there are only non-forgetful cycles. We will show a contradiction (proof idea). Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
56 Proof 2: Only Non-Forgetful Cycles A non-forgetful cycle always has an initial component I. Lemma [Asarin & Basset 2011] If λ v λ v, then v I λ v v I λ v. This quantitiy is nonincreasing along an infinite repetition of the cycle. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
57 Proof 2: Only Non-Forgetful Cycles A non-forgetful cycle always has an initial component I. λ 2 v I λv = c λ 1 λ 3 Lemma [Asarin & Basset 2011] If λ v λ v, then v I λ v v I λ v. This quantitiy is nonincreasing along an infinite repetition of the cycle. Proof: Each λ v is the sum of the predecessors of v multiplied by a probability. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
58 Proof 2: Only Non-Forgetful Cycles A non-forgetful cycle always has an initial component I. λ 2 /2 v I λv = c λ 1 /2 + λ 2 /2 λ 3 + λ 1 /2 Lemma [Asarin & Basset 2011] If λ v λ v, then v I λ v v I λ v. This quantitiy is nonincreasing along an infinite repetition of the cycle. Proof: Each λ v is the sum of the predecessors of v multiplied by a probability. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
59 Case: Only Non-Forgetful Cycles Lemma Environment has a strategy to ensure, for any λ v λ v, v I λ v v I λ v ɛ. ɛ Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
60 Case: Only Non-Forgetful Cycles Lemma Environment has a strategy to ensure, for any λ v λ v, v I λ v v I λ v ɛ. λ 2 ɛ λ 1 ɛ λ 3 ɛ Claim 1: Environment can enforce λ v ɛ for all v. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
61 Case: Only Non-Forgetful Cycles Lemma Environment has a strategy to ensure, for any λ v λ v, v I λ v v I λ v ɛ. λ 2 ɛ λ 1 ɛ λ 3 ɛ Claim 1: Environment can enforce λ v ɛ for all v. Claim 2: There exists some edge leaving I. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
62 Case: Only Non-Forgetful Cycles Lemma Environment has a strategy to ensure, for any λ v λ v, v I λ v v I λ v ɛ. λ 2 ɛ λ 1 ɛ ɛ λ 3 ɛ Claim 1: Environment can enforce λ v ɛ for all v. Claim 2: There exists some edge leaving I. Claim 3: Environment can enforce edge probabilities ɛ. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
63 Case: Only Non-Forgetful Cycles Lemma Environment has a strategy to ensure, for any λ v λ v, v I λ v v I λ v ɛ. λ 2 ɛ λ 1 ɛ ɛ λ 3 ɛ It follows: The sum v I is decreased by at least ɛ at each iteration. But 0 v I 1, contradiction (no infinite run along this region). Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
64 Algorithm Robust Controller Synthesis Algorithm Given a timed automaton A, - Guess a cycle of length at most exponential in the region automaton, - Compute the folded orbit graph (on-the-fly) and check whether it is forgetful. - Accept if it is, reject otherwise. (If there is a forgetful cycle, there is one of at most exponential length.) Once a forgetful lasso is found, one can compute the maximal δ and a winning strategy in time polynomial in the length of the lasso, using results from the shrinking papers. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
65 Algorithm Robust Controller Synthesis Algorithm Given a timed automaton A, - Guess a cycle of length at most exponential in the region automaton, - Compute the folded orbit graph (on-the-fly) and check whether it is forgetful. - Accept if it is, reject otherwise. (If there is a forgetful cycle, there is one of at most exponential length.) Once a forgetful lasso is found, one can compute the maximal δ and a winning strategy in time polynomial in the length of the lasso, using results from the shrinking papers. The problem is PSPACE-complete. Same complexity as non-emptiness in the standard semantics. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
66 Conclusion A Game semantics for modelling perturbations disables punctual moves, and too precise strategies. Thin timed automata do become blocking under some perturbation strategies. Robust control thickness (along accepting lassos). Winning strategies can be computed by δ-parameterized data structures. One can compute symbolically, and adjust δ later. Timed games Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
67 Excess-Perturbation Game Let A be a timed automaton and δ > 0. Excess Perturbation Game: Controller vs Environment. At any state (l, ν), Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
68 Excess-Perturbation Game Let A be a timed automaton and δ > 0. Excess Perturbation Game: Controller vs Environment. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d = g, Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
69 Excess-Perturbation Game Let A be a timed automaton and δ > 0. Excess Perturbation Game: Controller vs Environment. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d = g, 2 Environment chooses d [d δ, d + δ], (we can have d = g) Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
70 Excess-Perturbation Game Let A be a timed automaton and δ > 0. Excess Perturbation Game: Controller vs Environment. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d = g, 2 Environment chooses d [d δ, d + δ], (we can have d = g) 3 New state is (l, (ν + d )[R 0]). Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
71 Excess-Perturbation Game Let A be a timed automaton and δ > 0. Excess Perturbation Game: Controller vs Environment. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d = g, 2 Environment chooses d [d δ, d + δ], (we can have d = g) 3 New state is (l, (ν + d )[R 0]). For δ > 0, x=y=1 y:=0 ν 0 Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
72 Excess-Perturbation Game Let A be a timed automaton and δ > 0. Excess Perturbation Game: Controller vs Environment. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d = g, 2 Environment chooses d [d δ, d + δ], (we can have d = g) 3 New state is (l, (ν + d )[R 0]). For δ > 0, x=y=1 y:=0 ν 0 ν 0 Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
73 Excess-Perturbation Game Let A be a timed automaton and δ > 0. Excess Perturbation Game: Controller vs Environment. At any state (l, ν), 1 Controller chooses a delay d δ, and an edge l g,r l, such that ν + d = g, 2 Environment chooses d [d δ, d + δ], (we can have d = g) 3 New state is (l, (ν + d )[R 0]). For δ > 0, x=y=1 y:=0 ν 0 ν 0 Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
74 Excess-Perturbation Game - 2 Excess Perturbation Semantics The model is often simpler: one can use equalities, not think about error intervals. A synthesized strategy takes into account additional behaviors. vs Conservative Perturbation Semantics The model already contains intervals for timing constraints. No additional behavior is expected. The problem is convergence: the synthesized strategy must ensure liveness. Pick one... Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
75 Reachability in Excess-Perturbation Game (Parameterized) Robust Reachability Given a timed automaton A and target location l, Does there exist δ 0 > 0, such that Controller has a strategy reaching l in the excess semantics for all δ [0, δ 0 )? Main result Robust reachability in excess semantics is EXPTIME-complete. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
76 EXPTIME-hardness Usual semantics in TA can encode reachability in linearly bounded Turing machines (PSPACE-complete). Robust semantics in TA can encode reachability in alternating linearly bounded Turing machines (EXPTIME-complete). The encoding is similar as in the PSPACE-hardness proofs for TA. Alternation: simulated by the perturbating player x, y := 0 x = 1, y := 0 x = 2, y 1 x = 2, y < 1 Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
77 Conclusion The excess-perturbation game semantics is harder: reachability is EXPTIME-complete. NB: Convergence is not a problem for reachability (finite runs). General timed games in both semantics. Zone-based algorithms, efficient implementations. Ocan Sankur (ENS Cachan) Robust Control in Timed Automata February 18, / 22
Robust Reachability in Timed Automata: A Game-based Approach
Robust Reachability in Timed Automata: A Game-based Approach Patricia Bouyer, Nicolas Markey, and Ocan Sankur LSV, CNRS & ENS Cachan, France. {bouyer,markey,sankur}@lsv.ens-cachan.fr Abstract. Reachability
More informationTimed Automata with Observers under Energy Constraints
Timed Automata with Observers under Energy Constraints Patricia Bouyer-Decitre Uli Fahrenberg Kim G. Larsen Nicolas Markey LSV, CNRS & ENS Cachan, France Aalborg Universitet, Danmark /9 Introduction The
More informationModels for Efficient Timed Verification
Models for Efficient Timed Verification François Laroussinie LSV / ENS de Cachan CNRS UMR 8643 Monterey Workshop - Composition of embedded systems Model checking System Properties Formalizing step? ϕ Model
More informationReachability-Time Games on Timed Automata (Extended Abstract)
Reachability-Time Games on Timed Automata (Extended Abstract) Marcin Jurdziński and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK Abstract. In a reachability-time game, players
More informationA Survey of Partial-Observation Stochastic Parity Games
Noname manuscript No. (will be inserted by the editor) A Survey of Partial-Observation Stochastic Parity Games Krishnendu Chatterjee Laurent Doyen Thomas A. Henzinger the date of receipt and acceptance
More informationTheoretical Computer Science
Theoretical Computer Science 458 (2012) 49 60 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Energy parity games Krishnendu
More informationNash Equilibria in Concurrent Games with Büchi Objectives
Nash Equilibria in Concurrent Games with Büchi Objectives Patricia Bouyer, Romain Brenguier, Nicolas Markey, and Michael Ummels LSV, CNRS & ENS Cachan, France {bouyer,brenguier,markey,ummels}@lsv.ens-cachan.fr
More informationNash Equilibria for Reachability Objectives in Multi-player Timed Games
Nash Equilibria for Reachability Objectives in Multi-player Timed Games Patricia Bouyer, Romain Brenguier, and Nicolas Markey LSV, ENS Cachan & CNRS, France {bouyer,brenguie,markey}@lsv.ens-cachan.fr Abstract.
More informationLaboratoire Spécification & Vérification. Language Preservation Problems in Parametric Timed Automata. Étienne André and Nicolas Markey
Language Preservation Problems in Parametric Timed Automata Étienne André and Nicolas Markey June 2015 Research report LSV-15-05 (Version 1) Laboratoire Spécification & Vérification École Normale Supérieure
More informationSynthesis of Designs from Property Specifications
Synthesis of Designs from Property Specifications Amir Pnueli New York University and Weizmann Institute of Sciences FMCAD 06 San Jose, November, 2006 Joint work with Nir Piterman, Yaniv Sa ar, Research
More informationUndecidability Results for Timed Automata with Silent Transitions
Fundamenta Informaticae XXI (2001) 1001 1025 1001 IOS Press Undecidability Results for Timed Automata with Silent Transitions Patricia Bouyer LSV, ENS Cachan, CNRS, France bouyer@lsv.ens-cachan.fr Serge
More informationLiveness in L/U-Parametric Timed Automata
Liveness in L/U-Parametric Timed Automata Étienne André and Didier Lime [AL17] Université Paris 13, LIPN and École Centrale de Nantes, LS2N Highlights, 14 September 2017, London, England Étienne André
More informationAntichain Algorithms for Finite Automata
Antichain Algorithms for Finite Automata Laurent Doyen 1 and Jean-François Raskin 2 1 LSV, ENS Cachan & CNRS, France 2 U.L.B., Université Libre de Bruxelles, Belgium Abstract. We present a general theory
More informationDecision Problems for Additive Regular Functions
Decision Problems for Additive Regular Functions Rajeev Alur and Mukund Raghothaman University of Pennsylvania {alur, rmukund}@cis.upenn.edu Abstract. Additive Cost Register Automata (ACRA) map strings
More informationVerification of Polynomial Interrupt Timed Automata
Verification of Polynomial Interrupt Timed Automata Béatrice Bérard 1, Serge Haddad 2, Claudine Picaronny 2, Mohab Safey El Din 1, Mathieu Sassolas 3 1 Université P. & M. Curie, LIP6 2 ENS Cachan, LSV
More informationAdmissible Strategies for Synthesizing Systems
Admissible Strategies for Synthesizing Systems Ocan Sankur Univ Rennes, Inria, CNRS, IRISA, Rennes Joint with Romain Brenguier (DiffBlue), Guillermo Pérez (Antwerp), and Jean-François Raskin (ULB) (Multiplayer)
More informationController Synthesis with UPPAAL-TIGA. Alexandre David Kim G. Larsen, Didier Lime, Franck Cassez, Jean-François Raskin
Controller Synthesis with UPPAAL-TIGA Alexandre David Kim G. Larsen, Didier Lime, Franck Cassez, Jean-François Raskin Overview Timed Games. Algorithm (CONCUR 05). Strategies. Code generation. Architecture
More informationGames and Synthesis. Nir Piterman University of Leicester Telč, July-Autugst 2014
Games and Synthesis Nir Piterman University of Leicester Telč, July-Autugst 2014 Games and Synthesis, EATCS Young Researchers School, Telč, Summer 2014 Games and Synthesis, EATCS Young Researchers School,
More informationLower-Bound Constrained Runs in Weighted Timed Automata
Lower-Bound Constrained Runs in Weighted Timed Automata Patricia Bouyer LSV ENS Cachan & CNRS Email: bouyer@lsv.ens-cachan.fr Kim G. Larsen Dept. Computer Science Aalborg. Email:kgl@cs.aau.dk Nicolas Markey
More informationFrom Liveness to Promptness
From Liveness to Promptness Orna Kupferman Hebrew University Nir Piterman EPFL Moshe Y. Vardi Rice University Abstract Liveness temporal properties state that something good eventually happens, e.g., every
More informationRobot Games of Degree Two
Robot Games of Degree Two V. Halava 1,2 R. Niskanen 2 I. Potapov 2 1 Department of Mathematics and Statistics University of Turku, Finland 2 Department of Computer Science University of Liverpool, UK 9th
More informationmodels, languages, dynamics Eugene Asarin PIMS/EQINOCS Workshop on Automata Theory and Symbolic Dynamics LIAFA - University Paris Diderot and CNRS
models, s, LIAFA - University Paris Diderot and CNRS PIMS/EQINOCS Workshop on Automata Theory and Symbolic Dynamics Context A model for verification of real-time systems Invented by Alur and Dill in early
More informationModel Checking Real-Time Systems
Model Checking Real-Time Systems Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey, Joël Ouaknine, and James Worrell Abstract This chapter surveys timed automata as a formalism for model checking
More informationAutomata, Logic and Games: Theory and Application
Automata, Logic and Games: Theory and Application 1. Büchi Automata and S1S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong Büchi Automata & S1S 14-19 June
More informationLecture 20: PSPACE. November 15, 2016 CS 1010 Theory of Computation
Lecture 20: PSPACE November 15, 2016 CS 1010 Theory of Computation Recall that PSPACE = k=1 SPACE(nk ). We will see that a relationship between time and space complexity is given by: P NP PSPACE = NPSPACE
More informationSanjit A. Seshia EECS, UC Berkeley
EECS 219C: Computer-Aided Verification Explicit-State Model Checking: Additional Material Sanjit A. Seshia EECS, UC Berkeley Acknowledgments: G. Holzmann Checking if M satisfies : Steps 1. Compute Buchi
More informationRandomness for Free. 1 Introduction. Krishnendu Chatterjee 1, Laurent Doyen 2, Hugo Gimbert 3, and Thomas A. Henzinger 1
Randomness for Free Krishnendu Chatterjee 1, Laurent Doyen 2, Hugo Gimbert 3, and Thomas A. Henzinger 1 1 IST Austria (Institute of Science and Technology Austria) 2 LSV, ENS Cachan & CNRS, France 3 LaBri
More informationOptimal Bounds in Parametric LTL Games
Optimal Bounds in Parametric LTL Games Martin Zimmermann 1 Institute of Informatics University of Warsaw Warsaw, Poland Abstract Parameterized linear temporal logics are extensions of Linear Temporal Logic
More informationParameterized Regular Expressions and Their Languages
Parameterized Regular Expressions and Their Languages Pablo Barceló a, Juan Reutter b, Leonid Libkin b a Department of Computer Science, University of Chile b School of Informatics, University of Edinburgh
More informationSOLUTION: SOLUTION: SOLUTION:
Convert R and S into nondeterministic finite automata N1 and N2. Given a string s, if we know the states N1 and N2 may reach when s[1...i] has been read, we are able to derive the states N1 and N2 may
More informationSymmetric Nash Equilibria
Symmetric Nash Equilibria Steen Vester Supervisors: Patricia Bouyer-Decitre & Nicolas Markey, Laboratoire Spécification et Vérification, ENS de Cachan September 6, 2012 Summary In this report we study
More informationfor System Modeling, Analysis, and Optimization
Fundamental Algorithms for System Modeling, Analysis, and Optimization Stavros Tripakis UC Berkeley EECS 144/244 Fall 2013 Copyright 2013, E. A. Lee, J. Roydhowdhury, S. A. Seshia, S. Tripakis All rights
More informationComplexity Issues in Automated Addition of Time-Bounded Liveness Properties 1
Complexity Issues in Automated Addition of Time-Bounded Liveness Properties 1 Borzoo Bonakdarpour and Sandeep S. Kulkarni Software Engineering and Network Systems Laboratory, Department of Computer Science
More informationPURE NASH EQUILIBRIA IN CONCURRENT DETERMINISTIC GAMES
PURE NASH EQUILIBRIA IN CONCURRENT DETERMINISTIC GAMES PATRICIA BOUYER 1, ROMAIN BRENGUIER 2, NICOLAS MARKEY 1, AND MICHAEL UMMELS 3 1 LSV CNRS & ENS Cachan France e-mail address: {bouyer,markey}@lsv.ens-cachan.fr
More informationPOLYNOMIAL SPACE QSAT. Games. Polynomial space cont d
T-79.5103 / Autumn 2008 Polynomial Space 1 T-79.5103 / Autumn 2008 Polynomial Space 3 POLYNOMIAL SPACE Polynomial space cont d Polynomial space-bounded computation has a variety of alternative characterizations
More informationRecent results on Timed Systems
Recent results on Timed Systems Time Petri Nets and Timed Automata Béatrice Bérard LAMSADE Université Paris-Dauphine & CNRS berard@lamsade.dauphine.fr Based on joint work with F. Cassez, S. Haddad, D.
More informationRobust Safety of Timed Automata
Formal Methods in System Design manuscript No. (will be inserted by the editor) Robust Safety of Timed Automata Martin De Wulf Laurent Doyen Nicolas Markey Jean-François Raskin the date of receipt and
More informationWhen are Timed Automata Determinizable?
When are Timed Automata Determinizable? Christel Baier 1, Nathalie Bertrand 2, Patricia Bouyer 3, and Thomas Brihaye 4 1 Technische Universität Dresden, Germany 2 INRIA Rennes Bretagne Atlantique, France
More informationTime(d) Petri Net. Serge Haddad. Petri Nets 2016, June 20th LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA
Time(d) Petri Net Serge Haddad LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA haddad@lsv.ens-cachan.fr Petri Nets 2016, June 20th 2016 1 Time and Petri Nets 2 Time Petri Net: Syntax and Semantic
More informationSynthesis from Probabilistic Components
Synthesis from Probabilistic Components Yoad Lustig, Sumit Nain, and Moshe Y. Vardi Department of Computer Science Rice University, Houston, TX 77005, USA yoad.lustig@gmail.com, nain@cs.rice.edu, vardi@cs.rice.edu
More informationMeasuring Permissivity in Finite Games
Measuring Permissivity in Finite Games Patricia Bouyer, Marie Duflot, Nicolas Markey, and Gabriel Renault 3 LSV, CNRS & ENS Cachan, France {bouyer,markey}@lsv.ens-cachan.fr LACL, Université Paris, France
More informationContributions to timed systems and transducers
Contributions to timed systems and transducers Habilitation Thesis Mémoire d Habilitation à Diriger des Recherches Pierre-Alain Reynier Laboratoire d informatique fondamentale de Marseille Aix-Marseille
More informationThe Cost of Punctuality
The Cost of Punctuality Patricia Bouyer 1,2 Nicolas Markey 1 Joël Ouaknine 2 James Worrell 2 1 LSV, CNRS & ENS Cachan, France 2 Oxford University, UK {bouyer,markey}@lsv.ens-cachan.fr {joel,jbw}@comlab.ox.ac.uk
More informationSolving Partial-Information Stochastic Parity Games
Solving Partial-Information Stochastic Parity ames Sumit Nain and Moshe Y. Vardi Department of Computer Science, Rice University, Houston, Texas, 77005 Email: {nain,vardi}@cs.rice.edu Abstract We study
More informationQuantum Computing Lecture 8. Quantum Automata and Complexity
Quantum Computing Lecture 8 Quantum Automata and Complexity Maris Ozols Computational models and complexity Shor s algorithm solves, in polynomial time, a problem for which no classical polynomial time
More informationSynthesis weakness of standard approach. Rational Synthesis
1 Synthesis weakness of standard approach Rational Synthesis 3 Overview Introduction to formal verification Reactive systems Verification Synthesis Introduction to Formal Verification of Reactive Systems
More informationTowards the Complexity of Controls for Timed Automata with a Small Number of Clocks
Fifth International Conference on Fuzzy Systems and Knowledge Discovery Towards the Complexity of Controls for Timed Automata with a Small Number of Clocks Taolue Chen CWI PO Box 94079, 1090 GB Amsterdam,
More informationRobustness and Implementability of Timed Automata
Robustness and Implementability of Timed Automata Martin De Wulf, Laurent Doyen, Nicolas Markey, and Jean-François Raskin Computer Science Departement, Université Libre de Bruxelles, Belgium Abstract.
More informationThe efficiency of identifying timed automata and the power of clocks
The efficiency of identifying timed automata and the power of clocks Sicco Verwer a,b,1,, Mathijs de Weerdt b, Cees Witteveen b a Eindhoven University of Technology, Department of Mathematics and Computer
More informationAdvanced Automata Theory 7 Automatic Functions
Advanced Automata Theory 7 Automatic Functions Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced Automata Theory
More informationSerge Haddad Mathieu Sassolas. Verification on Interrupt Timed Automata. Research Report LSV-09-16
Béatrice Bérard Serge Haddad Mathieu Sassolas Verification on Interrupt Timed Automata Research Report LSV-09-16 July 2009 Verification on Interrupt Timed Automata Béatrice Bérard 1, Serge Haddad 2, Mathieu
More information1 Computational Problems
Stanford University CS254: Computational Complexity Handout 2 Luca Trevisan March 31, 2010 Last revised 4/29/2010 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationPS2 - Comments. University of Virginia - cs3102: Theory of Computation Spring 2010
University of Virginia - cs3102: Theory of Computation Spring 2010 PS2 - Comments Average: 77.4 (full credit for each question is 100 points) Distribution (of 54 submissions): 90, 12; 80 89, 11; 70-79,
More informationOn the determinization of timed systems
On the determinization of timed systems Patricia Bouyer, Samy Jaziri, Nicolas Markey To cite this version: Patricia Bouyer, Samy Jaziri, Nicolas Markey. On the determinization of timed systems. FOR- MATS
More informationNote on winning positions on pushdown games with omega-regular winning conditions
Note on winning positions on pushdown games with omega-regular winning conditions Olivier Serre To cite this version: Olivier Serre. Note on winning positions on pushdown games with omega-regular winning
More informationNotes for Lecture Notes 2
Stanford University CS254: Computational Complexity Notes 2 Luca Trevisan January 11, 2012 Notes for Lecture Notes 2 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationSri vidya college of engineering and technology
Unit I FINITE AUTOMATA 1. Define hypothesis. The formal proof can be using deductive proof and inductive proof. The deductive proof consists of sequence of statements given with logical reasoning in order
More informationContext-Free Languages (Pre Lecture)
Context-Free Languages (Pre Lecture) Dr. Neil T. Dantam CSCI-561, Colorado School of Mines Fall 2017 Dantam (Mines CSCI-561) Context-Free Languages (Pre Lecture) Fall 2017 1 / 34 Outline Pumping Lemma
More informationRevisiting Synthesis of GR(1) Specifications
Revisiting Synthesis of GR(1) Specifications Uri Klein & Amir Pnueli Courant Institute of Mathematical Sciences, NYU Haifa Verification Conference, October 2010 What Is Synthesis? Rather than implement
More informationProbabilistic Büchi Automata with non-extremal acceptance thresholds
Probabilistic Büchi Automata with non-extremal acceptance thresholds Rohit Chadha 1, A. Prasad Sistla, and Mahesh Viswanathan 3 1 LSV, ENS Cachan & CNRS & INRIA Saclay, France Univ. of IIlinois, Chicago,
More informationState Explosion in Almost-Sure Probabilistic Reachability
State Explosion in Almost-Sure Probabilistic Reachability François Laroussinie Lab. Spécification & Vérification, ENS de Cachan & CNRS UMR 8643, 61, av. Pdt. Wilson, 94235 Cachan Cedex France Jeremy Sproston
More informationLogic and Games SS 2009
Logic and Games SS 2009 Prof. Dr. Erich Grädel Łukasz Kaiser, Tobias Ganzow Mathematische Grundlagen der Informatik RWTH Aachen Contents 1 Finite Games and First-Order Logic 1 1.1 Model Checking Games
More informationController Synthesis for MTL Specifications
Controller Synthesis for MTL Specifications Patricia Bouyer, Laura Bozzelli, and Fabrice Chevalier LSV, CNRS & ENS Cachan, France {bouyer,bozzelli,chevalie}@lsv.ens-cachan.fr Abstract. We consider the
More informationAlternating nonzero automata
Alternating nonzero automata Application to the satisfiability of CTL [,, P >0, P =1 ] Hugo Gimbert, joint work with Paulin Fournier LaBRI, Université de Bordeaux ANR Stoch-MC 06/07/2017 Control and verification
More informationComplexity Issues in Automated Addition of Time-Bounded Liveness Properties 1
Complexity Issues in Automated Addition of Time-Bounded Liveness Properties 1 Borzoo Bonakdarpour and Sandeep S. Kulkarni Software Engineering and Network Systems Laboratory, Department of Computer Science
More informationCompilers. Lexical analysis. Yannis Smaragdakis, U. Athens (original slides by Sam
Compilers Lecture 3 Lexical analysis Yannis Smaragdakis, U. Athens (original slides by Sam Guyer@Tufts) Big picture Source code Front End IR Back End Machine code Errors Front end responsibilities Check
More information198:538 Complexity of Computation Lecture 16 Rutgers University, Spring March 2007
198:538 Complexity of Computation Lecture 16 Rutgers University, Spring 2007 8 March 2007 In this lecture we discuss Shamir s theorem that PSPACE is the set of languages that have interactive proofs with
More informationEfficient Model-Checking of Weighted CTL with Upper-Bound Constraints
Software Tools for Technology Transfer manuscript No. (will be inserted by the editor) Efficient Model-Checking of Weighted CTL with Upper-Bound Constraints Jonas Finnemann Jensen, Kim Guldstrand Larsen,
More informationAsynchronous Games over Tree Architectures
Asynchronous Games over Tree Architectures Blaise Genest 1, Hugo Gimbert 2, Anca Muscholl 2, Igor Walukiewicz 2 1 IRISA, CNRS, Rennes, France 2 LaBRI, CNRS/Université Bordeaux, France Abstract. We consider
More informationA Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control
A Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control Massimo Benerecetti, University of Naples Federico II, Italy Marco Faella, University of Naples Federico II,
More informationComputability and Complexity
Computability and Complexity Lecture 5 Reductions Undecidable problems from language theory Linear bounded automata given by Jiri Srba Lecture 5 Computability and Complexity 1/14 Reduction Informal Definition
More informationBefore we show how languages can be proven not regular, first, how would we show a language is regular?
CS35 Proving Languages not to be Regular Before we show how languages can be proven not regular, first, how would we show a language is regular? Although regular languages and automata are quite powerful
More information15-251: Great Theoretical Ideas in Computer Science Lecture 7. Turing s Legacy Continues
15-251: Great Theoretical Ideas in Computer Science Lecture 7 Turing s Legacy Continues Solvable with Python = Solvable with C = Solvable with Java = Solvable with SML = Decidable Languages (decidable
More informationTimed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences Patricia Bouyer 1, Serge Haddad 2, Pierre-Alain Reynier 1 1 LSV, CNRS & ENS Cachan, France 2 LAMSADE, CNRS & Université
More information1 More finite deterministic automata
CS 125 Section #6 Finite automata October 18, 2016 1 More finite deterministic automata Exercise. Consider the following game with two players: Repeatedly flip a coin. On heads, player 1 gets a point.
More informationLecture 22: PSPACE
6.045 Lecture 22: PSPACE 1 VOTE VOTE VOTE For your favorite course on automata and complexity Please complete the online subject evaluation for 6.045 2 Final Exam Information Who: You On What: Everything
More informationTCTL model-checking of Time Petri Nets
1 TCTL model-checking of Time Petri Nets Hanifa Boucheneb 1, Guillaume Gardey 2,3 and Olivier H. Roux 2 Affiliations : 1 : École polytechnique de Montréal, C.P. 6079, succ. Centre-ville Montréal H3C3A7
More informationGames with Costs and Delays
Games with Costs and Delays Martin Zimmermann Saarland University June 20th, 2017 LICS 2017, Reykjavik, Iceland Martin Zimmermann Saarland University Games with Costs and Delays 1/14 Gale-Stewart Games
More informationCS 154, Lecture 2: Finite Automata, Closure Properties Nondeterminism,
CS 54, Lecture 2: Finite Automata, Closure Properties Nondeterminism, Why so Many Models? Streaming Algorithms 0 42 Deterministic Finite Automata Anatomy of Deterministic Finite Automata transition: for
More informationFinite Automata. Dr. Neil T. Dantam. Fall CSCI-561, Colorado School of Mines. Dantam (Mines CSCI-561) Finite Automata Fall / 35
Finite Automata Dr. Neil T. Dantam CSCI-561, Colorado School of Mines Fall 2017 Dantam (Mines CSCI-561) Finite Automata Fall 2017 1 / 35 Outline Dantam (Mines CSCI-561) Finite Automata Fall 2017 2 / 35
More informationFinite Automata. BİL405 - Automata Theory and Formal Languages 1
Finite Automata BİL405 - Automata Theory and Formal Languages 1 Deterministic Finite Automata (DFA) A Deterministic Finite Automata (DFA) is a quintuple A = (Q,,, q 0, F) 1. Q is a finite set of states
More informationSIMULATION PROBLEMS OVER ONE-COUNTER NETS
Logical Methods in Computer Science Vol. 12(1:6)2016, pp. 1 46 www.lmcs-online.org Submitted Jun. 17, 2015 Published Mar. 14, 2016 SIMULATION PROBLEMS OVER ONE-COUNTER NETS a PIOTR HOFMAN a, S LAWOMIR
More informationRabin Theory and Game Automata An Introduction
Rabin Theory and Game Automata An Introduction Ting Zhang Stanford University November 2002 Logic Seminar 1 Outline 1. Monadic second-order theory of two successors (S2S) 2. Rabin Automata 3. Game Automata
More informationThe purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational
1 The purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational model. We'll remind you what a Turing machine is --- you
More informationVisibly Linear Dynamic Logic
Visibly Linear Dynamic Logic Joint work with Alexander Weinert (Saarland University) Martin Zimmermann Saarland University September 8th, 2016 Highlights Conference, Brussels, Belgium Martin Zimmermann
More informationSymbolic Quantitative Robustness Analysis of Timed Automata
Symbolic Quantitative Robustness Analysis of Timed Automata Ocan Sankur To cite this version: Ocan Sankur. Symbolic Quantitative Robustness Analysis of Timed Automata. Tools and Algorithms for the Construction
More informationTemporal logics and explicit-state model checking. Pierre Wolper Université de Liège
Temporal logics and explicit-state model checking Pierre Wolper Université de Liège 1 Topics to be covered Introducing explicit-state model checking Finite automata on infinite words Temporal Logics and
More informationSemi-Automatic Distributed Synthesis
Semi-Automatic Distributed Synthesis Bernd Finkbeiner and Sven Schewe Universität des Saarlandes, 66123 Saarbrücken, Germany {finkbeiner schewe}@cs.uni-sb.de Abstract. We propose a sound and complete compositional
More informationStrategy Logic. 1 Introduction. Krishnendu Chatterjee 1, Thomas A. Henzinger 1,2, and Nir Piterman 2
Strategy Logic Krishnendu Chatterjee 1, Thomas A. Henzinger 1,2, and Nir Piterman 2 1 University of California, Berkeley, USA 2 EPFL, Switzerland c krish@eecs.berkeley.edu, {tah,nir.piterman}@epfl.ch Abstract.
More informationMTAT Complexity Theory October 20th-21st, Lecture 7
MTAT.07.004 Complexity Theory October 20th-21st, 2011 Lecturer: Peeter Laud Lecture 7 Scribe(s): Riivo Talviste Polynomial hierarchy 1 Turing reducibility From the algorithmics course, we know the notion
More informationReal-time Synthesis is Hard!
Real-time Synthesis is Hard! @ Highlights 2016 Benjamin Monmege (LIF, Aix-Marseille Université) Thomas Brihaye, Morgane Estiévenart, Hsi-Ming Ho (UMONS) Gilles Geeraerts (ULB) Nathalie Sznajder (UPMC,
More informationDES. 4. Petri Nets. Introduction. Different Classes of Petri Net. Petri net properties. Analysis of Petri net models
4. Petri Nets Introduction Different Classes of Petri Net Petri net properties Analysis of Petri net models 1 Petri Nets C.A Petri, TU Darmstadt, 1962 A mathematical and graphical modeling method. Describe
More informationLecture 23 : Nondeterministic Finite Automata DRAFT Connection between Regular Expressions and Finite Automata
CS/Math 24: Introduction to Discrete Mathematics 4/2/2 Lecture 23 : Nondeterministic Finite Automata Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we designed finite state automata
More informationThe Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees
The Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees Karsten Lehmann a, Rafael Peñaloza b a Optimisation Research Group, NICTA Artificial Intelligence Group, Australian National
More informationTrading Infinite Memory for Uniform Randomness in Timed Games
Trading Infinite Memory for Uniform Randomness in Timed Games Krishnendu Chatterjee Thomas A. Henzinger Vinayak Prabhu Electrical Engineering and Computer Sciences University of California at Berkeley
More informationControlling probabilistic systems under partial observation an automata and verification perspective
Controlling probabilistic systems under partial observation an automata and verification perspective Nathalie Bertrand, Inria Rennes, France Uncertainty in Computation Workshop October 4th 2016, Simons
More informationFinite Automata. Dr. Neil T. Dantam. Fall CSCI-561, Colorado School of Mines. Dantam (Mines CSCI-561) Finite Automata Fall / 43
Finite Automata Dr. Neil T. Dantam CSCI-561, Colorado School of Mines Fall 2018 Dantam (Mines CSCI-561) Finite Automata Fall 2018 1 / 43 Outline Languages Review Traffic Light Example Deterministic Finite
More informationHourglass Automata. Yuki Osada, Tim French, Mark Reynolds, and Harry Smallbone
Hourglass Automata Yuki Osada, Tim French, Mark Reynolds, and Harry Smallbone The University of Western Australia. yuki.osada@research.uwa.edu.au, {tim.french,mark.reynolds}@uwa.edu.au, 21306592@student.uwa.edu.au
More informationThe space complexity of a standard Turing machine. The space complexity of a nondeterministic Turing machine
298 8. Space Complexity The space complexity of a standard Turing machine M = (Q,,,, q 0, accept, reject) on input w is space M (w) = max{ uav : q 0 w M u q av, q Q, u, a, v * } The space complexity of
More information