Guha, S, Jecker, I, Lehtinen, K and Zimmermann, M 
ORCID: 0000-0002-8038-2453
(2022)
Parikh Automata over Infinite Words.
.
Abstract
Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run, thereby preserving many of the desirable algorithmic properties of finite automata. Here, we study the extension of the classical framework onto infinite inputs: We introduce reachability, safety, Büchi, and co-Büchi Parikh automata on infinite words and study expressiveness, closure properties, and the complexity of verification problems. We show that almost all classes of automata have pairwise incomparable expressiveness, both in the deterministic and the nondeterministic case; a result that sharply contrasts with the well-known hierarchy in the ω-regular setting. Furthermore, emptiness is shown decidable for Parikh automata with reachability or Büchi acceptance, but undecidable for safety and co-Büchi acceptance. Most importantly, we show decidability of model checking with specifications given by deterministic Parikh automata with safety or co-Büchi acceptance, but also undecidability for all other types of automata. Finally, solving games is undecidable for all types.
| Item Type: | Conference or Workshop Item (Unspecified) |
|---|---|
| Divisions: | Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science |
| Depositing User: | Symplectic Admin |
| Date Deposited: | 03 Mar 2023 09:33 |
| Last Modified: | 03 Mar 2023 09:33 |
| DOI: | 10.4230/LIPIcs.FSTTCS.2022.40 |
| Open Access URL: | https://doi.org/10.4230/LIPIcs.FSTTCS.2022.40 |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3168716 |
Dimensions
Dimensions
