Visibly Linear Dynamic Logic

Transcription

1 Visibly Linear Dynamic Logic Joint work with Alexander Weinert (Saarland University) Martin Zimmermann Saarland University September 8th, 2016 Highlights Conference, Brussels, Belgium Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 1/8

2 The Everlasting Quest for Expressiveness LTL: Every request q is eventually answered by a response p G(q F p) Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 2/8

3 The Everlasting Quest for Expressiveness LTL: Every request q is eventually answered by a response p G(q F p) LDL: Every request q is eventually answered by a response p after an even number of steps [true ]( q (true true) p ) Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 2/8

4 The Everlasting Quest for Expressiveness LTL: Every request q is eventually answered by a response p G(q F p) LDL: Every request q is eventually answered by a response p after an even number of steps [true ]( q (true true) p ) VLDL: Every request q is eventually answered by a response p and there are never more responses than requests Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 2/8

5 The Everlasting Quest for Expressiveness LTL: Every request q is eventually answered by a response p G(q F p) LDL: Every request q is eventually answered by a response p after an even number of steps [true ]( q (true true) p ) VLDL: Every request q is eventually answered by a response p and there are never more responses than requests This can be expressed using pushdown automata/context-free grammars in the guards. Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 2/8

6 Visibly Pushdown Automata Partition input alphabet Σ into Σ c (calls), Σ r (returns), and Σ l (local actions). A visibly pushdown automaton (VPA) has to push when processing a call, pop when processing a return while the stack is non-empty (otherwise stack is unchanged), and leave the stack unchanged when processing a local action. Stack height determined by input word closure under union, intersection, and complement. Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 3/8

7 Visibly Pushdown Automata Partition input alphabet Σ into Σ c (calls), Σ r (returns), and Σ l (local actions). A visibly pushdown automaton (VPA) has to push when processing a call, pop when processing a return while the stack is non-empty (otherwise stack is unchanged), and leave the stack unchanged when processing a local action. Stack height determined by input word closure under union, intersection, and complement. Examples: a n b n is a VPL, if a is a call and b a return. ww R is not a VPL. Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 3/8

8 Visibly Linear Dynamic Logic (VLDL) Syntax ϕ := p ϕ ϕ ϕ ϕ ϕ A ϕ [A]ϕ where p P ranges over atomic propositions and A ranges over VPA s. All VPA s have the same partition of 2 P into calls, returns, and local actions. Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 4/8

9 Visibly Linear Dynamic Logic (VLDL) Syntax ϕ := p ϕ ϕ ϕ ϕ ϕ A ϕ [A]ϕ where p P ranges over atomic propositions and A ranges over VPA s. All VPA s have the same partition of 2 P into calls, returns, and local actions. Semantics w = A ϕ if there exists an n such that w 0 w n is accepted by A and w n w n+1 w n+2 = ϕ. w = [A]ϕ if for every n s.t. w 0 w n is accepted by A we have w n w n+1 w n+2 = ϕ. Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 4/8

10 Example Every request q is eventually answered by a response p and there are never more responses than requests : where [A true ]( q A true p ) [A]false A true accepts every input, and A accepts every input with more responses than requests. Both languages are visibly pushdown, if {q} is a call, {p} is a return, and and {p, q} are local actions. Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 5/8

11 Expressiveness Lemma VLDL and non-deterministic ω-vpa are expressively equivalent. Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 6/8

12 Expressiveness Lemma VLDL and non-deterministic ω-vpa are expressively equivalent. Proof Idea VLDL non-deterministic ω-vpa Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 6/8

13 Expressiveness Lemma VLDL and non-deterministic ω-vpa are expressively equivalent. Proof Idea VLDL Deterministic Stair Automata [LMS 04] O(2 n ) non-deterministic ω-vpa Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 6/8

14 Expressiveness Lemma VLDL and non-deterministic ω-vpa are expressively equivalent. Proof Idea VLDL Deterministic Stair Automata O(n 2 ) [LMS 04] O(2 n ) non-deterministic ω-vpa Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 6/8

15 Expressiveness Lemma VLDL and non-deterministic ω-vpa are expressively equivalent. Proof Idea VLDL Deterministic Stair Automata O(n 2 ) O(n 2 ) 1-way Alternating Jumping Automata [LMS 04] O(2 n ) non-deterministic ω-vpa Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 6/8

16 Expressiveness Lemma VLDL and non-deterministic ω-vpa are expressively equivalent. Proof Idea VLDL Deterministic Stair Automata O(n 2 ) O(n 2 ) 1-way Alternating Jumping Automata [LMS 04] O(2 n ) non-deterministic ω-vpa O(2 n ) [Bozelli 07] Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 6/8

17 The Competitors If p holds true immediately after entering module m, it shall hold immediately after the corresponding return from m as well Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 7/8

18 The Competitors If p holds true immediately after entering module m, it shall hold immediately after the corresponding return from m as well VLDL: [A c ](p A r p) with Σ r, A Σ c, A Σ l, Σ c, A Σ r, A Σ c, A Σ l, Σ r, A c A r Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 7/8

19 The Competitors If p holds true immediately after entering module m, it shall hold immediately after the corresponding return from m as well ω-vpa: Σ p Σ c, P Σ c, P c, P Σ p Σ r, P Σ r, P r, P Σ p l, Σ p, Σ p r, P Σ l, l Σ p c, P Σ p c Σ p r, P, P Σ p c, P Σ p r, P Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 7/8

20 The Competitors If p holds true immediately after entering module m, it shall hold immediately after the corresponding return from m as well VLTL: (α; true) α false with visibly rational expression α below: [(p q) call m [(q ) (p p)] return m (p q) ] (p q) Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 7/8

21 Our Results validity model-checking infinite games LTL PSpace PSpace 2ExpTime LDL PSpace PSpace 2ExpTime Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 8/8

22 Our Results validity model-checking infinite games LTL PSpace PSpace 2ExpTime LDL PSpace PSpace 2ExpTime VLDL ExpTime ExpTime 3ExpTime VLTL ExpTime ExpTime? Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 8/8

23 Our Results validity model-checking infinite games LTL PSpace PSpace 2ExpTime LDL PSpace PSpace 2ExpTime VLDL ExpTime ExpTime 3ExpTime VLTL ExpTime ExpTime? VLDL exp ExpTime ExpTime 3ExpTime Martin Zimmermann Saarland University Visibly Linear Dynamic Logic 8/8