regular separability of parikh automata languages ch...
TRANSCRIPT
![Page 1: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/1.jpg)
Regular separability ofParikh automata languagesℤ-Petri nets
L. Clemente, W. Czerwiński, S. Lasota (University of Warsaw)Ch. Paperman (University of Bordeaux)
London, September 2017
![Page 2: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/2.jpg)
Regular separability ofParikh automata languagesℤ-Petri nets
L. Clemente, W. Czerwiński, S. Lasota (University of Warsaw)Ch. Paperman (University of Bordeaux)
London, September 2017
![Page 3: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/3.jpg)
At a glance
1. Problem: Regular separability of ℤ-Petri nets languages.
2. Result: The problem is decidable.
3. Future: Decidable for ℕ-Petri nets? Conjecture: YES.
![Page 4: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/4.jpg)
Main techniques
1. Deterministic = nondeterministic.(Presented before by Sławek Lasota.)
2. Regular partitioning.
3. Reduce to separability of bounded languages.(Bounded languages are of the form, e.g., x*y*z* for x, y, z ∈ Σ*.)
![Page 5: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/5.jpg)
Regular separability
A B
![Page 6: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/6.jpg)
Regular separability
A B
R
“simple” (regular)
![Page 7: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/7.jpg)
Regular separability
A B
R
“simple” (regular)
recognised by Petri nets
![Page 8: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/8.jpg)
Decidable separability
1. 1CN [Czerwiński, Lasota LICS’17](one ℕ-counter, with zero test).
Via the Regular Overapproximation technique→ next talk by Wojtek Czerwiński.
2. ℤ-PN [C., Czerwiński, Lasota, Paperman ICALP’17](many ℤ-counters; no zero test).
3. [Conjecture] Separability of ℕ-PN languages is decidable.
![Page 9: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/9.jpg)
Decidable separability
1. 1CN [Czerwiński, Lasota LICS’17](one ℕ-counter, with zero test).
Via the Regular Overapproximation technique→ next talk by Wojtek Czerwiński.
2. ℤ-PN [C., Czerwiński, Lasota, Paperman ICALP’17](many ℤ-counters; no zero test).
3. [Conjecture] Separability of ℕ-PN languages is decidable.
![Page 10: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/10.jpg)
Decidable separability
1. 1CN [Czerwiński, Lasota LICS’17](one ℕ-counter, with zero test).
Via the Regular Overapproximation technique→ next talk by Wojtek Czerwiński.
2. ℤ-PN [C., Czerwiński, Lasota, Paperman ICALP’17](many ℤ-counters; no zero test).
3. [Conjecture] Separability of ℕ-PN languages is decidable.
![Page 11: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/11.jpg)
Decidable separability
1. 1CN [Czerwiński, Lasota LICS’17](one ℕ-counter, with zero test).
Via the Regular Overapproximation technique→ next talk by Wojtek Czerwiński.
2. ℤ-PN [C., Czerwiński, Lasota, Paperman ICALP’17](many ℤ-counters; no zero test).
3. [Conjecture] Separability of ℕ-PN languages is decidable.
![Page 12: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/12.jpg)
Regular separability of ℤ-PN
What is a ℤ-Petri net?
Nondeterministic finite automaton A+ finitely many ℤ-counters (no zero test).
Accepting runs: counters start and end with value zero.
Theorem. Regular separability is decidable for ℤ-PN.
![Page 13: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/13.jpg)
Regular separability of ℤ-PN
What is a ℤ-Petri net?
Nondeterministic finite automaton A+ finitely many ℤ-counters (no zero test).
Accepting runs: counters start and end with value zero.
Theorem. Regular separability is decidable for ℤ-PN.
![Page 14: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/14.jpg)
Solution
1. Deterministic = nondeterministic. (Presented before by Sławek Lasota.)
2. Regular partitioning.
3. Reduce to separability of bounded languages.(Bounded languages are of the form, e.g., x*y*z* for x, y, z ∈ Σ*.)
assume DFA
![Page 15: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/15.jpg)
Solution
1. Deterministic = nondeterministic. (Presented before by Sławek Lasota.)
2. Regular partitioning.
3. Reduce to separability of bounded languages.(Bounded languages are of the form, e.g., x*y*z* for x, y, z ∈ Σ*.)
assume DFA
![Page 16: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/16.jpg)
Solution
1. Deterministic = nondeterministic. (Presented before by Sławek Lasota.)
2. Regular partitioning.
3. Reduce to separability of bounded languages.(Bounded languages are of the form, e.g., x*y*z* for x, y, z ∈ Σ*.)
assume DFA
![Page 17: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/17.jpg)
Solution
1. Deterministic = nondeterministic. (Presented before by Sławek Lasota.)
2. Regular partitioning.
3. Reduce to separability of bounded languages.(Bounded languages are of the form, e.g., x*y*z* for x, y, z ∈ Σ*.)
assume DFA
![Page 18: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/18.jpg)
R0
R1
R2
R3
Regular partitioning
A, B separable iff, for every i, A ∩ Ri, B ∩ Ri separable
L(A) L(B)
![Page 19: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/19.jpg)
L(A) L(B)
Regular partitioning: Application
![Page 20: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/20.jpg)
L(A) L(B)
Regular partitioning: Application
R(A)
![Page 21: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/21.jpg)
L(A) L(B)
Regular partitioning: Application
R(A)
R(B)
![Page 22: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/22.jpg)
L(A) L(B)
Regular partitioning: Application
R(A)
R(B)
R(A) ∩ R(B)
![Page 23: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/23.jpg)
L(A) L(B)
Regular partitioning: Application
Σ* \ R(A) ∩ R(B)
We can assume the same underlying DFA for the two ℤ-PNs.
R(A) ∩ R(B)
![Page 24: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/24.jpg)
Solution
1. Deterministic = nondeterministic. (Presented before by Sławek Lasota.)
2. Regular partitioning. ✔
3. Reduce to separability of bounded languages.(Bounded languages are of the form, e.g., x*y*z* for x, y, z ∈ Σ*.)
assume DFA
![Page 25: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/25.jpg)
Consider simple cycles instead of single transitions:
● Cycles can be rearranged (once enough states have been visited).● We can fix an order for cycles → bounded language.
Reduction to bounded languages
![Page 26: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/26.jpg)
x*y*z*
Σ \ x*y*z*
Reduction to bounded languages
L(A)
Lemma. L(A), L(B) are regular separable iff L(A), L(B) are regular separable in x*y*z*
R
L(B)
![Page 27: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/27.jpg)
x*y*z*
Σ \ x*y*z*
Reduction to bounded languages
L(A)
R
regular separability ofℤ-PN languages
L(B)
![Page 28: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/28.jpg)
x*y*z*
Reduction to bounded languages
L(A)
R
regular separability ofℤ-PN languages
bounded regular separability ofbounded ℤ-PN languages
L(B)
![Page 29: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/29.jpg)
(x*y*z*)
Reduction to bounded languages
(L(A))
(R)
regular separability ofℤ-PN languages
bounded regular separability ofbounded ℤ-PN languages
(L(B))
![Page 30: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/30.jpg)
Reduction to bounded languages
(L(A))
(R)
regular separability ofℤ-PN languages
bounded regular separability ofbounded ℤ-PN languages
(L(B))semilinear
unary
![Page 31: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/31.jpg)
Reduction to bounded languages
(L(A))
(R)
regular separability ofℤ-PN languages
bounded regular separability ofbounded ℤ-PN languages
(L(B))semilinear
unary
unary separability ofsemilinear sets
[Choffrut, Grigorieff ILP’06]
![Page 32: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/32.jpg)
Solution
1. Deterministic = nondeterministic. (Presented before by Sławek Lasota.)
2. Regular partitioning. ✔
3. Reduce to separability of bounded languages. ✔(Bounded languages are of the form, e.g., x*y*z* for x, y, z ∈ Σ*.)
assume DFA
![Page 33: Regular separability of Parikh automata languages Ch ...highlights-conference.org/wp-content/uploads/2017/09/HIGHLIGHTS17... · Regular separability of Parikh automata languages ℤ-Petri](https://reader034.vdocuments.site/reader034/viewer/2022042801/5aa4e0f47f8b9a185d8c9d76/html5/thumbnails/33.jpg)
Conclusions
1. [Decidable] 1CN [Czerwiński, Lasota LICS’17](one ℕ-counter, with zero test).
Via the Regular Overapproximation technique→ next talk by Wojtek Czerwiński.
2. [Decidable] ℤ-PN [C., Czerwiński, Lasota, Paperman ICALP’17](many ℤ-counters; no zero test). ✔
3. [Conjecture] Separability of ℕ-PN languages is decidable.