Some techniques and results in deciding bisimilarity
|
|
- Grant Thompson
- 5 years ago
- Views:
Transcription
1 Some techniques and results in deciding bisimilarity Petr Jančar Dept of Computer Science Technical University Ostrava (FEI VŠB-TU) Czech Republic Talk at the Verification Seminar, ULB, Brussels, 16 December 2005 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
2 Outline Behavioural equivalences; bisimulation equivalence. Undecidability of equivalences on (labelled place/transition) Petri nets (STACS 1994); imperfect Minsky machine simulation. Undecidability of the reachability set equality. Semilinear witnesses; decidable cases. Bisimilarity on process rewrite systems, and prefix rewrite systems. PSPACE-completeness of bisimilarity on Basic Parallel Processes (LiCS 2003); distance-to-disabling functions (dd-functions). Undecidability of bisimilarity on Type -1 systems (Jančar and Srba, FoSSaCS 2006); Defender s choice technique. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
3 Outline Behavioural equivalences; bisimulation equivalence. Undecidability of equivalences on (labelled place/transition) Petri nets (STACS 1994); imperfect Minsky machine simulation. Undecidability of the reachability set equality. Semilinear witnesses; decidable cases. Bisimilarity on process rewrite systems, and prefix rewrite systems. PSPACE-completeness of bisimilarity on Basic Parallel Processes (LiCS 2003); distance-to-disabling functions (dd-functions). Undecidability of bisimilarity on Type -1 systems (Jančar and Srba, FoSSaCS 2006); Defender s choice technique. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
4 Vending machines coffee tea V 1 def = 5k.5k.( coffee.collect.v 1 + tea.collect.v 1 ) 5k V 2 def = 5k.5k.coffee.collect.V 2 + 5k.5k.tea.collect.V 2 collect Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
5 Vending machines - cont. V 1 def = 5k.5k.( coffee.collect.v 1 + tea.collect.v 1 ) V 1 5k 5k coffee tea collect V 2 def = 5k.5k.coffee.collect.V 2 + 5k.5k.tea.collect.V 2 5k 5k 5k 5k collect coffee tea Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
6 Behavioural equivalences and preorders; simulation Does a system implement another one? Are they equivalent? (system = labelled transition system) Language (trace) equivalences often too coarse coffee coin coin tea coffee coin A binary relation R over STATES is a simulation if whenever (s, t) R then for every action a if s a s a then t t for some t such that (s, t ) R. s is simulated by t if there is a simulation R (s, t). The union of (all) simulations is (the maximal) simulation tea Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
7 Bisimulation equivalence Milner, Park (1980s) A binary relation R over STATES is a bisimulation if (it is a symmetric simulation, i.e.) whenever (s, t) R then for every action a if s a s a then t t for some t such that (s, t ) R. whenever (s, t) R then for every action a if t a t a then s s for some s such that (s, t ) R. s is bisimilar with t if there is a bisimulation R (s, t). The union of (all) bisimulations is (the maximal) bisimulation. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
8 Linear Time / Branching Time Spectrum Bisimulation equivalence 2-nested simulation equivalence Ready simulation equivalence Possible-futures equivalence Ready trace equivalence Simulation equivalence Readiness equivalence Failure trace equivalence Failures equivalence Completed trace equivalence Trace equivalence Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
9 Outline Behavioural equivalences; bisimulation equivalence. Undecidability of equivalences on (labelled place/transition) Petri nets (STACS 1994); imperfect Minsky machine simulation. Undecidability of the reachability set equality. Semilinear witnesses; decidable cases. Bisimilarity on process rewrite systems, and prefix rewrite systems. PSPACE-completeness of bisimilarity on Basic Parallel Processes (LiCS 2003); distance-to-disabling functions (dd-functions). Undecidability of bisimilarity on Type -1 systems (Jančar and Srba, FoSSaCS 2006); Defender s choice technique. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
10 Minsky counter machines A Minsky counter machine C is given by a fixed number of (nonnegative integer) counters c 1, c 2,..., c m a program (in fact, a set of labelled instructions) 1 : com 1 ; 2 : com 2 ;... ; n : com n, where com n is instruction HALT com i (i = 1, 2,..., n 1) are commands of two types: c j := c j + 1; goto k if c j = 0 then goto k 1 else (c j := c j 1; goto k 2 ) Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
11 Undecidability of behavioural equivalences for Petri nets Fact It is undecidable if a 2-counter machine C halts on the zero input (i.e., when starting with c 1 = c 2 = 0). We show an algorithm A : so that C A N C 1, NC 2 if C halts (on input zero) then the behaviours of N1 C, NC 2 differ drastically (one can perform a trace which the other cannot) if C does not halt then the behaviours of N1 C, NC 2 in a strict sense (the nets are bisimilar) are the same Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
12 Linear Time / Branching Time Spectrum Bisimulation equivalence 2-nested simulation equivalence Ready simulation equivalence Possible-futures equivalence Ready trace equivalence Simulation equivalence Readiness equivalence Failure trace equivalence Failures equivalence Completed trace equivalence Trace equivalence Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
13 Reduction of Halting Problem to Petri net equivalences c 2 s 1 s 2 s 3 s 4 s 5 s n... s 6 c 1 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
14 Reduction of Halting Problem to Petri net equivalences c 2 s 1 s 2 s 3 s 4 s 5 s n... s 6 c 1 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
15 Reduction of Halting Problem to Petri net equivalences c 2 s 1 s 2 s 3 s 4 s 5 s n... s 6 c 1 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
16 Reduction of Halting Problem to Petri net equivalences c 2 s 1 s 2 s 3 s 4 s 5 s n... s 6 c 1 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
17 Reduction of Halting Problem to Petri net equivalences c 2 s 1 s 2 s 3 s 4 s 5 s n... s 6 c Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
18 Reduction of Halting Problem to Petri net equivalences c 2 s 1 s 2 s 3 s 4 s 5 s n... s 6 c Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
19 Reduction of Halting Problem to Petri net equivalences c 2 s 1 s 2 s 3 s 4 s 5 s n... s 6 c p 2 p 1 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
20 Reduction of Halting Problem to Petri net equivalences c 2 s 1 s 2 s 3 s 4 s 5 s n... s 6 c p 2 p 1 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
21 Reduction - cont... Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
22 Outline Behavioural equivalences; bisimulation equivalence. Undecidability of equivalences on (labelled place/transition) Petri nets (STACS 1994); imperfect Minsky machine simulation. Undecidability of the reachability set equality. Semilinear witnesses; decidable cases. Bisimilarity on process rewrite systems, and prefix rewrite systems. PSPACE-completeness of bisimilarity on Basic Parallel Processes (LiCS 2003); distance-to-disabling functions (dd-functions). Undecidability of bisimilarity on Type -1 systems (Jančar and Srba, FoSSaCS 2006); Defender s choice technique. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
23 Reduction for the reachability set equality c 2 s 1 s 2 s 3 s 4 s 5 s n... s 6 c p 2 p 1 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
24 Reduction for the reachability set equality c 2 s 1 s 2 s 3 s 4 s 5 s n... s 6 c p 2 p 1 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
25 R(N) R(N blue ); when R(N blue ) R(N)? N t SC Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
26 R(N) R(N blue ); when R(N blue ) R(N)? N t SC COD r 1 AUX r 2 2 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
27 R(N) R(N blue ); when R(N blue ) R(N)? N t SC t COD r 1 AUX r 2 2 COD for decreasing (green t) Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
28 Reduction for the reachability set equality cont. If C halts, after m steps, then N blue has a possibility to simulate C correctly, and thus reach a dead marking where SC = m, and COD is in binary , with length m+1, where 1s correspond to the decreasing (green) transitions Such a marking is unreachable in N ; therefore R(N blue ) R(N). If C does not halt then R(N blue ) R(N) (in fact, R(N blue ) = R(N)). Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
29 Outline Behavioural equivalences; bisimulation equivalence. Undecidability of equivalences on (labelled place/transition) Petri nets (STACS 1994); imperfect Minsky machine simulation. Undecidability of the reachability set equality. Semilinear witnesses; decidable cases. Bisimilarity on process rewrite systems, and prefix rewrite systems. PSPACE-completeness of bisimilarity on Basic Parallel Processes (LiCS 2003); distance-to-disabling functions (dd-functions). Undecidability of bisimilarity on Type -1 systems (Jančar and Srba, FoSSaCS 2006); Defender s choice technique. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
30 Presburger definable sets = semilinear sets A set L N k is linear if there are: a basis b N k and periods p 1, p 2,..., p n N k so that L = { b + c 1 p 1 + c 2 p c n p n c 1, c 2,..., c n N } A set S N k is semilinear iff it is a finite union of linear sets. Ginsburg, Spanier 1966: Presburger-definable subsets of N k are precisely the semilinear sets. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
31 Reachability set equality revisited For 2 unbounded places, R(N) is (effectively) semilinear; hence R(N 1 ) R(N 2 ) (and R(N 1 ) = R(N 2 )) decidable. For 5 unbounded places, R(N 1 ) = R(N 2 ) (and R(N 1 ) R(N 2 )) undecidable. What about 3 and 4 unbounded places?? Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
32 Simulation on one-counter nets semilinear p(m) is not simulated by q(n)... red p(m) is simulated by q(n)... black n m?? Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
33 Outline Behavioural equivalences; bisimulation equivalence. Undecidability of equivalences on (labelled place/transition) Petri nets (STACS 1994); imperfect Minsky machine simulation. Undecidability of the reachability set equality. Semilinear witnesses; decidable cases. Bisimilarity on process rewrite systems, and prefix rewrite systems. PSPACE-completeness of bisimilarity on Basic Parallel Processes (LiCS 2003); distance-to-disabling functions (dd-functions). Undecidability of bisimilarity on Type -1 systems (Jančar and Srba, FoSSaCS 2006); Defender s choice technique. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
34 Process rewrite systems a E 1 1 F1 a E 2 2 F2... E k a k Fk PRS PAD PAN PDA PA PN BPA BPP FS Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
35 Bisimilarity over context-free processes decidable Context-free grammar (in Greibach NF) finitely many rules of the type A 1 ab 1 B 2... B k Processes BPA (sequential) Processes BPP (parallel) A 1 A 2... A n b a B 1 B 2... B k A 2... A n a a b... A 1 a B 1 B 2... B k Christensen, Hirshfeld, Moller (1993) decidable (nonprimitive recursive upper bound) Srba (2002) PSPACE-hard Jančar (2003) PSPACE-complete Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
36 DPDA language equivalence, PDA bisimilarity G. Sénizergues (1997) The language equivalence problem for deterministic pushdown automata is decidable C. Stirling (2002) Simplified the proof substantially, and showed that it is primitive recursive They also showed that bisimilarity for nondeterministic pushdown automata decidable. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
37 Outline Behavioural equivalences; bisimulation equivalence. Undecidability of equivalences on (labelled place/transition) Petri nets (STACS 1994); imperfect Minsky machine simulation. Undecidability of the reachability set equality. Semilinear witnesses; decidable cases. Bisimilarity on process rewrite systems, and prefix rewrite systems. PSPACE-completeness of bisimilarity on Basic Parallel Processes (LiCS 2003); distance-to-disabling functions (dd-functions). Undecidability of bisimilarity on Type -1 systems (Jančar and Srba, FoSSaCS 2006); Defender s choice technique. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
38 Distance-to-disabling functions (dd-functions) dd a : S IN ω dist(s, t) = min { length(w) s w t } dd a (s) = min { dist(s, t) t has no a-successor } Given a tuple F = (d 1,..., d k ), each transition s a t determines a change F(t) F(s) = ( d 1 (t) d 1 (s),..., d k (t) d k (s) ). dd (a,f,δ) (s) = min { dist(s, t) r : if t a r then F(r) F(t) δ }. Observation. s t = d(s) = d(t) for all dd-functions d. The direction = holds for image finite systems. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
39 Basic Parallel Processes Finitely many rules of the type A 1 a B1 B 2... B k A 1 a B 1 B 2... B k BPP-nets: variables = places Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
40 DD-functions on BPP-nets norm Q (M) = min { dist(m, M ) M has no tokens on Q } x 1 3 x 2 4 x 3 x 4 x 5 x 6 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
41 DD-functions on BPP-nets norm Q (M) = min { dist(m, M ) M has no tokens on Q } x 1 3 x x 3 x 4 x 5 x 6 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
42 DD-functions on BPP-nets norm Q (M) = min { dist(m, M ) M has no tokens on Q } x 1 3 x x 3 x 4 x 5 1 x 6 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
43 DD-functions on BPP-nets norm Q (M) = min { dist(m, M ) M has no tokens on Q } x 1 3 x x 3 2 x 4 x 5 1 x 6 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
44 DD-functions on BPP-nets norm Q (M) = min { dist(m, M ) M has no tokens on Q } x x x 3 2 x 4 x 5 1 x 6 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
45 DD-functions on BPP-nets norm Q (M) = min { dist(m, M ) M has no tokens on Q } x x x 3 2 x 4 ω x 5 1 x 6 ω norm Q (x 1, x 2, x 3, x 4, x 5, x 6 ) = 6x 1 + x 2 + 2x 3 + ω x 4 + x 5 + ω x 6 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
46 Bisimilarity on Basic Parallel Processes in PSPACE M 1 M 2 important Q : norm Q (M 1 ) = norm Q (M 2 ) The following puzzling question is thus answered positively: X 2 X 3 = X X 2? Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
47 Weak bisimilarity on Basic Parallel Processes τ X X 2 τ X X τ τ τ τ b c b c Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
48 Weak bisimilarity on Basic Parallel Processes τ X 2 X 3 τ X X τ τ τ τ b c b c Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
49 Outline Behavioural equivalences; bisimulation equivalence. Undecidability of equivalences on (labelled place/transition) Petri nets (STACS 1994); imperfect Minsky machine simulation. Undecidability of the reachability set equality. Semilinear witnesses; decidable cases. Bisimilarity on process rewrite systems, and prefix rewrite systems. PSPACE-completeness of bisimilarity on Basic Parallel Processes (LiCS 2003); distance-to-disabling functions (dd-functions). Undecidability of bisimilarity on Type -1 systems (Jančar and Srba, FoSSaCS 2006); Defender s choice technique. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
50 Bisimilarity on prefix rewrite systems Normed Processes Unnormed Processes Type -2 Σ 1 1 -complete Σ1 1 -complete Type -1b Π 0 1 -complete Σ1 1 -complete Type -1a Π 0 1 -complete Π0 1 -complete Type 0, and decidable decidable Type EXPTIME-hard EXPTIME-hard Type 2 P 2-EXPTIME P-hard PSPACE-hard Type 3 P-complete P-complete The main new result: Bisimilarity is undecidable on Type -1a systems. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
51 Pushdown graphs; generated by Type 0 systems px px qa b c a pxa qε qε px b pxa b pxaa b pxaaa b... c c c c q a qa a qaa a qaaa a... a Type 0 system: finite sets of rules w 1 w 2 (the same class of generated graphs) An involved result: Bisimilarity is decidable (Sénizergues (1998,2005), then Stirling) Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
52 Type -1 systems (or Type -1a systems); rules R a w X XA A b c a XA ε ε X b XA b XAA b XAAA b... c c c c ε a A a AA a AAA Stirling, Sénizergues: is bisimilarity decidable? Sénizergues decidability result for equational graphs of finite out-degree (equivalent to the case R a w with prefix-free R) Maybe in the normed case? (u is normed if each path from u can be prolonged to reach ε) Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50 a...
53 Hierarchy of prefix rewriting Type Form of Rewrite Rules Type -2 a R 1 R 2 Type -1a/-1b R a w / w a R Type 0 w a w Type px a qw Type 2 X a w Type 3 X a Y, X a ε Type -2 Type -1a Type -1b Type 0 = Type Type 2 Type 3 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
54 Bisimilarity is undecidable on Type -1a systems Normed Processes Unnormed Processes Type -2 Σ 1 1 -complete Σ1 1 -complete Type -1b Π 0 1 -complete Σ1 1 -complete Type -1a Π 0 1 -complete Π0 1 -complete Type 0, and decidable decidable Type EXPTIME-hard EXPTIME-hard Type 2 P 2-EXPTIME P-hard PSPACE-hard Type 3 P-complete P-complete Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
55 Inf-PCP (a version of Post Correspondence Problem) A PCP-instance : u 1 u 2... u n v 1 v 2... v n u i, v i : nonempty words in an alphabet An infinite initial solution: a sequence i 1, i 2, i 3,... from {1, 2,..., n} such that i 1 =1 and u i1 u i2 u i3 u i4 = v i1 v i2 v i3 v i4 Given a Turing machine M, with instructions (q 0, a) (q 1, b, +1),..., and an input word, say w = aabab, we can construct PCP-instance so that: M does not halt on w there is an infinite initial solution. # q 0 a... a b... #q 0 aabab# bq 1... a b... #q 0 aa b... #q 0 aabab#bq 1 ab... So neg-hp is reducible to inf-pcp; inf-pcp is Π 0 1 -complete. Note: we can even require u i v i Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
56 Inf-PCP is reducible to bisimilarity on (normed) Type -1a u 1 u 2... u n v 1 v 2... v n u i, v i {A, B} +, u i v i Observation: The following conditions are equivalent u i1 u i2 u i3 = v i1 v i2 v i3 m: u i1 u i2 u im is a prefix of v i1 v i2 v im m: (u i1 u i2 u im ) R is a suffix of (v i1 v i2 v im ) R m: (u im ) R (u im 1 ) R (u i1 ) R is a suffix of (v im ) R (v im 1 ) R (v i1 ) R A game: Defender stepwise generates a sequence... I im... I i3 I i2 I i1 (with i 1 = 1) Attacker has a possibility to stop this process and win whenever (u im ) R (u im 1 ) R (u i1 ) R is not a suffix of (v im ) R (v im 1 ) R (v i1 ) R Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
57 Implementation of the game; generating rules c X Y X c Y i X c Y i for all i {1, 2,..., n} Y i XI i Y i i X I i for all i {1, 2,..., n} j XI j for all i, j {1, 2,..., n}, i j Y i c XI 1 c X I 1 c YI 1... Y 8 I Y 8 I 1... Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
58 Implementation of the game; generating rules c X Y X c Y i X c Y i for all i {1, 2,..., n} Y i XI i Y i i X I i for all i {1, 2,..., n} Y i j XI j for all i, j {1, 2,..., n}, i j c XI 1 c X I 1 c YI 1... Y 8 I XI 5 I 1... XI 8 I 1... Y 8 I XI 5 I 1... X I 8 I 1 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
59 Implementation of the game; generating rules c X Y X c Y i X c Y i for all i {1, 2,..., n} Y i XI i Y i i X I i for all i {1, 2,..., n} Y i j XI j for all i, j {1, 2,..., n}, i j c XI 1 c X I 1 c YI 1... Y 8 I XI 5 I 1... XI 8 I 1... Y 8 I XI 5 I 1... X I 8 I 1 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
60 Switch-to-checking rules XI 7 I 15 I 3 I 8 I 1 X I 7 I 15 I 3 I 8 I 1 (u i7 ) R (u i15 ) R (u i3 ) R (u i8 ) R (u i1 ) R (v i7 ) R (v i15 ) R (v i3 ) R (v i8 ) R (v i1 ) R X d C X (I )I i d C w X (I )I i d C w for all i {1, 2,..., n} and all suffices w of vi R Notation: I stands for (I 1 + I I n ) ; XI 7 I 15 I 3 I 8 I 1 d CI 7 I 15 I 3 I 8 I 1 X I 7 I 15 I 3 I 8 I 1 d C wi 8 I 1 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
61 Checking rules CI 7 I 15 I 3 I 8 I 1 C wi 8 I 1 CA a C C A a C CB b C C B b C C e ε C e ε h(ui CI R ) i C tail(ui R ) C h(vi I R ) i C tail(vi R ) for all i {1, 2,..., n} Notation. h(w) = a when head(w) = A, h(w) = b when head(w) = B Observation. CI 7 I 15 I 3 I 8 I 1 is bisimilar to C wi 8 I 1 iff (u i7 ) R (u i15 ) R (u i3 ) R (u i8 ) R (u i1 ) R = w(v i8 ) R (v i1 ) R Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
62 Summary of the reduction: inf-pcp bisim-type-1a u 1 u 2... u n v 1 v 2... v n generating rules switch-to-checking rules checking rules There is an infinite initial solution XI 1 is bisimilar with X I 1 (Moreover: XI 1, X I 1 are normed processes.) Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
63 Π 0 1-completeness of bisim-normed-type-1b The only difference wrt Type -1a: switch-to-checking rules XI 7 I 15 I 3 I 8 I 1 X I 7 I 15 I 3 I 8 I 1 (u i7 ) R (u i15 ) R (u i3 ) R (u i8 ) R (u i1 ) R (v i7 ) R (v i15 ) R (v i3 ) R (v i8 ) R (v i1 ) R X X d C d C(A + B) X d C(A + B) XI 7 I 15 I 3 I 8 I 1 d CwI 7 I 15 I 3 I 8 I 1 X I 7 I 15 I 3 I 8 I 1 d C I 7 I 15 I 3 I 8 I 1 Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
64 High undecidability; Σ 1 1-completeness; rec-pcp A predicate P(x) (over natural numbers) is in Σ 1 1 iff P(x) MF(M, x) for a set variable M and a first-order arithmetical formula F. A well known Σ 1 1-complete problem: is there an infinite computation of a given nondeterministic Turing machine which visits q 0 infinitely often? A PCP-instance : u 1 u 2... u n v 1 v 2... v n u i, v i : nonempty words in an alphabet Recurrent solution: a sequence i 1, i 2, i 3,... from {1, 2,..., n} such that i 1 =1 and u i1 u i2 u i3 u i4 = v i1 v i2 v i3 v i4 1 appears infinitely often in the sequence i 1, i 2, i 3,... Fact. Problem rec-pcp is Σ 1 1 -complete. Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
65 Σ 1 1-completeness for (unrestricted) Type -1b X X Y c Y c Y I 1 I X c Y I 1 I Y c X c XI Y c XI X X X d C d C(A + B) X d C(A + B) f Z X f Z CA a C C A a C... ZI i i Z Z I i i Z for all i {1, 2,..., n} Z e ε Z e ε Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
66 Σ 1 1-completeness for normed Type -2 Like for the previous Type -1b, the only difference is the generating rules: c X Y X c Y I 1 I X c Y I 1 I Y c X YI c XI Y I c XI Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
67 Bisimilarity on prefix rewrite systems Normed Processes Unnormed Processes Type -2 Σ 1 1 -complete Σ1 1 -complete Type -1b Π 0 1 -complete Σ1 1 -complete Type -1a Π 0 1 -complete Π0 1 -complete Type 0, and decidable decidable Type EXPTIME-hard EXPTIME-hard Type 2 P 2-EXPTIME P-hard PSPACE-hard Type 3 P-complete P-complete Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
68 Outline Behavioural equivalences; bisimulation equivalence. Undecidability of equivalences on (labelled place/transition) Petri nets (STACS 1994); imperfect Minsky machine simulation. Undecidability of the reachability set equality. Semilinear witnesses; decidable cases. Bisimilarity on process rewrite systems, and prefix rewrite systems. PSPACE-completeness of bisimilarity on Basic Parallel Processes (LiCS 2003); distance-to-disabling functions (dd-functions). Undecidability of bisimilarity on Type -1 systems (Jančar and Srba, FoSSaCS 2006); Defender s choice technique. THE END Petr Jančar (TU Ostrava) Deciding bisimilarity Brussels, / 50
Simulation Preorder on Simple Process Algebras
Simulation Preorder on Simple Process Algebras Antonín Kučera and Richard Mayr Faculty of Informatics MU, Botanická 68a, 6000 Brno, Czech Repubic, tony@fi.muni.cz Institut für Informatik TUM, Arcisstr.,
More informationUndecidability Results for Bisimilarity on Prefix Rewrite Systems
Undecidability Results for Bisimilarity on Prefix Rewrite Systems Petr Jančar 1 and Jiří Srba 2 1 Center of Applied Cybernetics, Department of Computer Science Technical University of Ostrava, Czech Republic
More informationSemantic Equivalences and the. Verification of Infinite-State Systems 1 c 2004 Richard Mayr
Semantic Equivalences and the Verification of Infinite-State Systems Richard Mayr Department of Computer Science Albert-Ludwigs-University Freiburg Germany Verification of Infinite-State Systems 1 c 2004
More informationarxiv: v2 [cs.fl] 3 Dec 2012
BPA Bisimilarity is EXPTIME-hard Stefan Kiefer 1 University of Oxford, UK arxiv:1205.7041v2 [cs.fl] 3 Dec 2012 Abstract Given a basic process algebra (BPA) and two stack symbols, the BPA bisimilarity problem
More informationDP lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation 188 (2004) 1 19 www.elsevier.com/locate/ic DP lower bounds for equivalence-checking and model-checking of one-counter automata Petr Jančar, a,1 Antonín Kučera, b,1 Faron Moller,
More informationFundamenta Informaticae 30 (1997) 23{41 1. Petri Nets, Commutative Context-Free Grammars,
Fundamenta Informaticae 30 (1997) 23{41 1 IOS Press Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes Javier Esparza Institut fur Informatik Technische Universitat Munchen Munchen,
More informationDecidable Subsets of CCS
Decidable Subsets of CCS based on the paper with the same title by Christensen, Hirshfeld and Moller from 1994 Sven Dziadek Abstract Process algebra is a very interesting framework for describing and analyzing
More informationFlat counter automata almost everywhere!
Flat counter automata almost everywhere! Jérôme Leroux and Grégoire Sutre Projet Vertecs, IRISA / INRIA Rennes, FRANCE Équipe MVTsi, CNRS / LABRI, FRANCE Counter-automata verification A simple counter-automata:
More informationTrace Inclusion for One-Counter Nets Revisited
Trace Inclusion for One-Counter Nets Revisited Piotr Hofman 1 and Patrick Totzke 2 1 University of Bayreuth, Germany 2 LaBRI, Univ. Bordeaux & CNRS, France Abstract. One-counter nets (OCN) consist of a
More informationUndecidability of Weak Bisimulation Equivalence in Unary One-Counter Petri Nets
T E H U N I V E R S I T Y O H F R G E D I N B U Undecidability of Weak Bisimulation Equivalence in Unary One-Counter Petri Nets Jana Hofmann Master of Science Computer Science School of Informatics University
More informationReversal-Bounded Counter Machines Revisited
Reversal-Bounded Counter Machines Revisited Alain Finkel 1 and Arnaud Sangnier 1,2 1 LSV, ENS Cachan, CNRS & 2 EDF R&D 61 av. du pdt Wilson 94230 Cachan. France {finkel,sangnier}@lsv.ens-cachan.fr Abstract.
More informationarxiv: v1 [cs.lo] 21 Apr 2014
Trace Inclusion for One-Counter Nets Revisited Piotr Hofman 1 and Patrick Totzke 2 1 University of Bayreuth, Germany 2 University of Edinburgh, UK arxiv:1404.5157v1 [cs.lo] 21 Apr 2014 Abstract. One-counter
More informationOutline. Complexity Theory. Example. Sketch of a log-space TM for palindromes. Log-space computations. Example VU , SS 2018
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 3. Logarithmic Space Reinhard Pichler Institute of Logic and Computation DBAI Group TU Wien 3. Logarithmic Space 3.1 Computational
More informationFoundations of Informatics: a Bridging Course
Foundations of Informatics: a Bridging Course Week 3: Formal Languages and Semantics Thomas Noll Lehrstuhl für Informatik 2 RWTH Aachen University noll@cs.rwth-aachen.de http://www.b-it-center.de/wob/en/view/class211_id948.html
More informationWeak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time
Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time Antonín Kučera 1 and Richard Mayr 2 1 Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno, Czech Republic,
More informationBisimilarity of Probabilistic Pushdown Automata
Bisimilarity of Probabilistic Pushdown Automata Vojtěch Forejt 1, Petr Jančar 2, Stefan Kiefer 1, and James Worrell 1 1 Department of Computer Science, University of Oxford, UK 2 Department of Computer
More informationTUM{INFO{01-I /1.{FI Alle Rechte vorbehalten Nachdruck auch auszugsweise verboten c1999 SFB 342 Methoden und Werkzeuge fur die Nutzung parallele
TECHNISCHE UNIVERSIT AT M UNCHEN INSTITUT F UR INFORMATIK Sonderforschungsbereich 342: Methoden und Werkzeuge fur die Nutzung paralleler Rechnerarchitekturen Simulation Preorder on Simple Process Algebras
More informationThe State Explosion Problem
The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis
More informationSYLLABUS. Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 3 : REGULAR EXPRESSIONS AND LANGUAGES
Contents i SYLLABUS UNIT - I CHAPTER - 1 : AUT UTOMA OMATA Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 2 : FINITE AUT UTOMA OMATA An Informal Picture of Finite Automata,
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 informationThe Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets
The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets Georg Zetzsche Technische Universität Kaiserslautern Reachability Problems 2015 Georg Zetzsche (TU KL) Emptiness
More informationProbabilistic Aspects of Computer Science: Probabilistic Automata
Probabilistic Aspects of Computer Science: Probabilistic Automata Serge Haddad LSV, ENS Paris-Saclay & CNRS & Inria M Jacques Herbrand Presentation 2 Properties of Stochastic Languages 3 Decidability Results
More informationarxiv: v2 [cs.lo] 26 Mar 2018
Wadge Degrees of ω-languages of Petri Nets Olivier Finkel Equipe de Logique Mathématique Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS et Université Paris 7, France. finkel@math.univ-paris-diderot.fr
More informationPrimitive recursive functions: decidability problems
Primitive recursive functions: decidability problems Armando B. Matos October 24, 2014 Abstract Although every primitive recursive (PR) function is total, many problems related to PR functions are undecidable.
More informationRegular Model Checking and Verification of Cellular Automata
Aalborg University Master Thesis Regular Model Checking and Verification of Cellular Automata Authors: Joakim Byg Kenneth Yrke Jørgensen {jokke,kyrke}@cs.aau.dk Department of Computer Science Dat 6 June
More informationON STATELESS AUTOMATA AND P SYSTEMS
ON STATELESS AUTOMATA AND P SYSTEMS Linmin Yang School of Electrical Engineering and Computer Science Washington State University, Pullman, Washington 99164, USA lyang1@eecs.wsu.edu Zhe Dang School of
More informationPetri Nets (for Planners)
Petri (for Planners) B. Bonet, P. Haslum... from various places... ICAPS 2011 & Motivation Petri (PNs) is formalism for modelling discrete event systems Developed by (and named after) C.A. Petri in 1960s
More informationModels of Concurrency
Models of Concurrency GERARDO SCHNEIDER UPPSALA UNIVERSITY DEPARTMENT OF INFORMATION TECHNOLOGY UPPSALA, SWEDEN Thanks to Frank Valencia Models of Concurrency p.1/57 Concurrency is Everywhere Concurrent
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 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 informationTUM{INFO{10-I /1.{FI Alle Rechte vorbehalten Nachdruck auch auszugsweise verboten c1998 SFB 342 Methoden und Werkzeuge fur die Nutzung parallele
TECHNISCHE UNIVERSIT AT M U N C H E N INSTITUT F UR INFORMATIK Sonderforschungsbereich 342: Methoden und Werkzeuge fur die Nutzung paralleler Rechnerarchitekturen Lossy Counter Machines Richard Mayr TUM-I9827
More informationOn the Accepting Power of 2-Tape Büchi Automata
On the Accepting Power of 2-Tape Büchi Automata Equipe de Logique Mathématique Université Paris 7 STACS 2006 Acceptance of infinite words In the sixties, Acceptance of infinite words by finite automata
More informationuring Reducibility Dept. of Computer Sc. & Engg., IIT Kharagpur 1 Turing Reducibility
uring Reducibility Dept. of Computer Sc. & Engg., IIT Kharagpur 1 Turing Reducibility uring Reducibility Dept. of Computer Sc. & Engg., IIT Kharagpur 2 FINITE We have already seen that the language FINITE
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 informationUndecidable Problems. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science May 12, / 65
Undecidable Problems Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science May 12, 2018 1/ 65 Algorithmically Solvable Problems Let us assume we have a problem P. If there is an algorithm solving
More information6.8 The Post Correspondence Problem
6.8. THE POST CORRESPONDENCE PROBLEM 423 6.8 The Post Correspondence Problem The Post correspondence problem (due to Emil Post) is another undecidable problem that turns out to be a very helpful tool for
More informationIntroduction to Temporal Logic. The purpose of temporal logics is to specify properties of dynamic systems. These can be either
Introduction to Temporal Logic The purpose of temporal logics is to specify properties of dynamic systems. These can be either Desired properites. Often liveness properties like In every infinite run action
More informationLecture 24: Randomized Complexity, Course Summary
6.045 Lecture 24: Randomized Complexity, Course Summary 1 1/4 1/16 1/4 1/4 1/32 1/16 1/32 Probabilistic TMs 1/16 A probabilistic TM M is a nondeterministic TM where: Each nondeterministic step is called
More informationTHEORY OF COMPUTATION (AUBER) EXAM CRIB SHEET
THEORY OF COMPUTATION (AUBER) EXAM CRIB SHEET Regular Languages and FA A language is a set of strings over a finite alphabet Σ. All languages are finite or countably infinite. The set of all languages
More informationBlackhole Pushdown Automata
Fundamenta Informaticae XXI (2001) 1001 1020 1001 IOS Press Blackhole Pushdown Automata Erzsébet Csuhaj-Varjú Computer and Automation Research Institute, Hungarian Academy of Sciences Kende u. 13 17, 1111
More informationNew Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations (Extended Abstract) Gaoyan Xie, Cheng Li and Zhe Dang School of Electrical Engineering and
More informationComplexity of Reachability, Mortality and Freeness Problems for Matrix Semigroups
Complexity of Reachability, Mortality and Freeness Problems for Matrix Semigroups Paul C. Bell Department of Computer Science Loughborough University P.Bell@lboro.ac.uk Co-authors for todays topics: V.
More informationFinite Automata and Languages
CS62, IIT BOMBAY Finite Automata and Languages Ashutosh Trivedi Department of Computer Science and Engineering, IIT Bombay CS62: New Trends in IT: Modeling and Verification of Cyber-Physical Systems (2
More informationChapter 3: Linear temporal logic
INFOF412 Formal verification of computer systems Chapter 3: Linear temporal logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 LTL: a specification
More informationMA/CSSE 474 Theory of Computation
MA/CSSE 474 Theory of Computation CFL Hierarchy CFL Decision Problems Your Questions? Previous class days' material Reading Assignments HW 12 or 13 problems Anything else I have included some slides online
More informationDM17. Beregnelighed. Jacob Aae Mikkelsen
DM17 Beregnelighed Jacob Aae Mikkelsen January 12, 2007 CONTENTS Contents 1 Introduction 2 1.1 Operations with languages...................... 2 2 Finite Automata 3 2.1 Regular expressions/languages....................
More informationReachability in Petri nets with Inhibitor arcs
Reachability in Petri nets with Inhibitor arcs Klaus Reinhardt Universität Tübingen reinhard@informatik.uni-tuebingen.de Overview Multisets, New operators Q and Q on multisets, Semilinearity Petri nets,
More informationIntroduction to the Theory of Computation. Automata 1VO + 1PS. Lecturer: Dr. Ana Sokolova.
Introduction to the Theory of Computation Automata 1VO + 1PS Lecturer: Dr. Ana Sokolova http://cs.uni-salzburg.at/~anas/ Setup and Dates Lectures and Instructions 23.10. 3.11. 17.11. 24.11. 1.12. 11.12.
More informationOn Recognizable Languages of Infinite Pictures
On Recognizable Languages of Infinite Pictures Equipe de Logique Mathématique CNRS and Université Paris 7 LIF, Marseille, Avril 2009 Pictures Pictures are two-dimensional words. Let Σ be a finite alphabet
More informationA Note on Decidable Separability by Piecewise Testable Languages
A Note on Decidable Separability by Piecewise Testable Languages Wojciech Czerwiński 1, Wim Martens 2, Lorijn van Rooijen 3, and Marc Zeitoun 3 1 University of Warsaw 2 University of Bayreuth 3 Bordeaux
More informationTheir proof is rather lengthy and hard to grasp; it ultimately relies on showing a periodicity for any transition graph generated from normed context-
Bisimulation Equivalence is Decidable for all Context-Free Processes Sren Christensen Hans Huttel y Colin Stirling 1 Introduction Over the past decade much attention has been devoted to the study of process
More informationOn Recognizable Languages of Infinite Pictures
On Recognizable Languages of Infinite Pictures Equipe de Logique Mathématique CNRS and Université Paris 7 JAF 28, Fontainebleau, Juin 2009 Pictures Pictures are two-dimensional words. Let Σ be a finite
More informationLogic and Automata I. Wolfgang Thomas. EATCS School, Telc, July 2014
Logic and Automata I EATCS School, Telc, July 2014 The Plan We present automata theory as a tool to make logic effective. Four parts: 1. Some history 2. Automata on infinite words First step: MSO-logic
More informationLTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems
This space is reserved for the EPiC Series header, do not use it LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems Rachel Faran and Orna Kupferman The Hebrew University,
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 informationHomework 8. a b b a b a b. two-way, read/write
Homework 8 309 Homework 8 1. Describe a TM that accepts the set {a n n is a power of 2}. Your description should be at the level of the descriptions in Lecture 29 of the TM that accepts {ww w Σ } and the
More informationDecision Problems with TM s. Lecture 31: Halting Problem. Universe of discourse. Semi-decidable. Look at following sets: CSCI 81 Spring, 2012
Decision Problems with TM s Look at following sets: Lecture 31: Halting Problem CSCI 81 Spring, 2012 Kim Bruce A TM = { M,w M is a TM and w L(M)} H TM = { M,w M is a TM which halts on input w} TOTAL TM
More informationComplexity: Some examples
Algorithms and Architectures III: Distributed Systems H-P Schwefel, Jens M. Pedersen Mm6 Distributed storage and access (jmp) Mm7 Introduction to security aspects (hps) Mm8 Parallel complexity (hps) Mm9
More informationAutomata-based Verification - III
COMP30172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2009 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationTHEORY OF COMPUTATION
THEORY OF COMPUTATION There are four sorts of men: He who knows not and knows not he knows not: he is a fool - shun him; He who knows not and knows he knows not: he is simple teach him; He who knows and
More informationTheory of Computation Turing Machine and Pushdown Automata
Theory of Computation Turing Machine and Pushdown Automata 1. What is a Turing Machine? A Turing Machine is an accepting device which accepts the languages (recursively enumerable set) generated by type
More informationReasoning about Strategies: From module checking to strategy logic
Reasoning about Strategies: From module checking to strategy logic based on joint works with Fabio Mogavero, Giuseppe Perelli, Luigi Sauro, and Moshe Y. Vardi Luxembourg September 23, 2013 Reasoning about
More informationCPSC 421: Tutorial #1
CPSC 421: Tutorial #1 October 14, 2016 Set Theory. 1. Let A be an arbitrary set, and let B = {x A : x / x}. That is, B contains all sets in A that do not contain themselves: For all y, ( ) y B if and only
More informationReachability in Succinct and Parametric One-Counter Automata
Reachability in Succinct and Parametric One-Counter Automata Christoph Haase, Stephan Kreutzer, Joël Ouaknine, and James Worrell Oxford University Computing Laboratory, UK {chrh,kreutzer,joel,jbw}@comlab.ox.ac.uk
More informationAutomata Theory (2A) Young Won Lim 5/31/18
Automata Theory (2A) Copyright (c) 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationPushdown Automata. Chapter 12
Pushdown Automata Chapter 12 Recognizing Context-Free Languages We need a device similar to an FSM except that it needs more power. The insight: Precisely what it needs is a stack, which gives it an unlimited
More informationIntroduction to the Theory of Computation. Automata 1VO + 1PS. Lecturer: Dr. Ana Sokolova.
Introduction to the Theory of Computation Automata 1VO + 1PS Lecturer: Dr. Ana Sokolova http://cs.uni-salzburg.at/~anas/ Setup and Dates Lectures Tuesday 10:45 pm - 12:15 pm Instructions Tuesday 12:30
More informationA Characterization of Regular Expressions under Bisimulation
A Characterization of Regular Expressions under Bisimulation J. C. M. BAETEN Technische Universiteit Eindhoven, Eindhoven, The Netherlands F. CORRADINI Università di Camerino, Camerino, Italy AND C. A.
More informationCS256/Spring 2008 Lecture #11 Zohar Manna. Beyond Temporal Logics
CS256/Spring 2008 Lecture #11 Zohar Manna Beyond Temporal Logics Temporal logic expresses properties of infinite sequences of states, but there are interesting properties that cannot be expressed, e.g.,
More informationPart I: Definitions and Properties
Turing Machines Part I: Definitions and Properties Finite State Automata Deterministic Automata (DFSA) M = {Q, Σ, δ, q 0, F} -- Σ = Symbols -- Q = States -- q 0 = Initial State -- F = Accepting States
More information3130CIT Theory of Computation
GRIFFITH UNIVERSITY School of Computing and Information Technology 3130CIT Theory of Computation Final Examination, Semester 2, 2006 Details Total marks: 120 (40% of the total marks for this subject) Perusal:
More informationRational graphs trace context-sensitive languages
Rational graphs trace context-sensitive languages Christophe Morvan 1 and Colin Stirling 2 1 IRISA, Campus de eaulieu, 35042 Rennes, France christophe.morvan@irisa.fr 2 Division of Informatics, University
More informationEnergy and Mean-Payoff Games with Imperfect Information
Energy and Mean-Payoff Games with Imperfect Information Aldric Degorre 1, Laurent Doyen 2, Raffaella Gentilini 3, Jean-François Raskin 1, and Szymon Toruńczyk 2 1 Université Libre de Bruxelles (ULB), Belgium
More informationUndecidable Problems and Reducibility
University of Georgia Fall 2014 Reducibility We show a problem decidable/undecidable by reducing it to another problem. One type of reduction: mapping reduction. Definition Let A, B be languages over Σ.
More informationFurther discussion of Turing machines
Further discussion of Turing machines In this lecture we will discuss various aspects of decidable and Turing-recognizable languages that were not mentioned in previous lectures. In particular, we will
More information6.045 Final Exam Solutions
6.045J/18.400J: Automata, Computability and Complexity Prof. Nancy Lynch, Nati Srebro 6.045 Final Exam Solutions May 18, 2004 Susan Hohenberger Name: Please write your name on each page. This exam is open
More informationQuestion Bank UNIT I
Siddhivinayak Technical Campus School of Engineering & Research Technology Department of computer science and Engineering Session 2016-2017 Subject Name- Theory of Computation Subject Code-4KS05 Sr No.
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 informationDiscrete Parameters in Petri Nets
Discrete Parameters in Petri Nets SYNCOP2015 Based on a Paper accepted in PN2015 Nicolas David, Claude Jard, Didier Lime, Olivier H. Roux April 22, 2015 Nicolas David, Claude Jard, Didier Lime, Olivier
More informationCS 125 Section #10 (Un)decidability and Probability November 1, 2016
CS 125 Section #10 (Un)decidability and Probability November 1, 2016 1 Countability Recall that a set S is countable (either finite or countably infinite) if and only if there exists a surjective mapping
More informationTime and Timed Petri Nets
Time and Timed Petri Nets Serge Haddad LSV ENS Cachan & CNRS & INRIA haddad@lsv.ens-cachan.fr DISC 11, June 9th 2011 1 Time and Petri Nets 2 Timed Models 3 Expressiveness 4 Analysis 1/36 Outline 1 Time
More informationFunctions on languages:
MA/CSSE 474 Final Exam Notation and Formulas page Name (turn this in with your exam) Unless specified otherwise, r,s,t,u,v,w,x,y,z are strings over alphabet Σ; while a, b, c, d are individual alphabet
More informationAutomata Theory. Lecture on Discussion Course of CS120. Runzhe SJTU ACM CLASS
Automata Theory Lecture on Discussion Course of CS2 This Lecture is about Mathematical Models of Computation. Why Should I Care? - Ways of thinking. - Theory can drive practice. - Don t be an Instrumentalist.
More informationNODIA AND COMPANY. GATE SOLVED PAPER Computer Science Engineering Theory of Computation. Copyright By NODIA & COMPANY
No part of this publication may be reproduced or distributed in any form or any means, electronic, mechanical, photocopying, or otherwise without the prior permission of the author. GATE SOLVED PAPER Computer
More informationIncompleteness Theorems, Large Cardinals, and Automata ov
Incompleteness Theorems, Large Cardinals, and Automata over Finite Words Equipe de Logique Mathématique Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS and Université Paris 7 TAMC 2017, Berne
More informationSt.MARTIN S ENGINEERING COLLEGE Dhulapally, Secunderabad
St.MARTIN S ENGINEERING COLLEGE Dhulapally, Secunderabad-500 014 Subject: FORMAL LANGUAGES AND AUTOMATA THEORY Class : CSE II PART A (SHORT ANSWER QUESTIONS) UNIT- I 1 Explain transition diagram, transition
More informationCSCI 1590 Intro to Computational Complexity
CSCI 59 Intro to Computational Complexity Overview of the Course John E. Savage Brown University January 2, 29 John E. Savage (Brown University) CSCI 59 Intro to Computational Complexity January 2, 29
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 informationComputability and Complexity Theory: An Introduction
Computability and Complexity Theory: An Introduction meena@imsc.res.in http://www.imsc.res.in/ meena IMI-IISc, 20 July 2006 p. 1 Understanding Computation Kinds of questions we seek answers to: Is a given
More informationSection 14.1 Computability then else
Section 14.1 Computability Some problems cannot be solved by any machine/algorithm. To prove such statements we need to effectively describe all possible algorithms. Example (Turing machines). Associate
More informationLecture 21: Algebraic Computation Models
princeton university cos 522: computational complexity Lecture 21: Algebraic Computation Models Lecturer: Sanjeev Arora Scribe:Loukas Georgiadis We think of numerical algorithms root-finding, gaussian
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
5-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY 5-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY YOU NEED TO PICK UP THE SYLLABUS, THE COURSE SCHEDULE, THE PROJECT INFO SHEET, TODAY S CLASS NOTES
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 informationOn Stateless Automata and P Systems
Proceedings of the International Workshop, Automata for Cellular and Molecular Computing, MTA SZTAKI, Budapest, pages 144-157, 2007. On Stateless Automata and P Systems Linmin Yang 1, Zhe Dang 1, and Oscar
More informationA note on the attractor-property of infinite-state Markov chains
A note on the attractor-property of infinite-state Markov chains Christel Baier a, Nathalie Bertrand b, Philippe Schnoebelen b a Universität Bonn, Institut für Informatik I, Germany b Lab. Specification
More informationLinear Time Analysis of Properties of Conflict-Free and General Petri nets
Linear Time Analysis of Properties of Conflict-Free and General Petri nets Paola Alimonti Esteban Feuerstein Luigi Laura Umberto Nanni Technical Report n. 9, 2010 Linear Time Analysis of Properties of
More informationSemantics and Verification
Semantics and Verification Lecture 2 informal introduction to CCS syntax of CCS semantics of CCS 1 / 12 Sequential Fragment Parallelism and Renaming CCS Basics (Sequential Fragment) Nil (or 0) process
More informationFinal exam study sheet for CS3719 Turing machines and decidability.
Final exam study sheet for CS3719 Turing machines and decidability. A Turing machine is a finite automaton with an infinite memory (tape). Formally, a Turing machine is a 6-tuple M = (Q, Σ, Γ, δ, q 0,
More informationMm7 Intro to distributed computing (jmp) Mm8 Backtracking, 2-player games, genetic algorithms (hps) Mm9 Complex Problems in Network Planning (JMP)
Algorithms and Architectures II H-P Schwefel, Jens M. Pedersen Mm6 Advanced Graph Algorithms (hps) Mm7 Intro to distributed computing (jmp) Mm8 Backtracking, 2-player games, genetic algorithms (hps) Mm9
More informationRegister machines L2 18
Register machines L2 18 Algorithms, informally L2 19 No precise definition of algorithm at the time Hilbert posed the Entscheidungsproblem, just examples. Common features of the examples: finite description
More information