We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
On decidability of LTL model checking for process rewrite systems.
- Authors
Bozzelli, Laura; Křetínský, Mojmír; Řehák, Vojtěch; Strejček, Jan
- Abstract
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (wPRS), and properties described by basic fragments of action-based Linear Temporal Logic (LTL) with both future and past operators. It is known that the problem for general LTL properties is decidable for Petri nets and for pushdown processes, while it is undecidable for PA processes.We show that the problem is decidable for wPRS if we consider properties defined by LTL formulae with only modalities strict eventually, strict always, and their past counterparts. Moreover, we show that the problem remains undecidable for PA processes even with respect to the LTL fragment with the only modality until or the fragment with modalities next and infinitely often.
- Subjects
DECIDABILITY (Mathematical logic); INFINITY (Mathematics); MATHEMATICAL logic; MODAL logic; SYSTEM analysis
- Publication
Acta Informatica, 2009, Vol 46, Issue 1, p1
- ISSN
0001-5903
- Publication type
Article
- DOI
10.1007/s00236-008-0082-3