Publication details

<< back
 

On Decidability of LTL Model Checking for Process Rewrite Systems

Basic information
Original title:On Decidability of LTL Model Checking for Process Rewrite Systems
Authors:Laura Bozzelli, Mojmír Křetínský, Vojtěch Řehák, Jan Strejček
Further information
Citation:BOZZELLI, Laura - KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan. On Decidability of LTL Model Checking for Process Rewrite Systems. In FSTTCS 2006: 26th International Conference on Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings. Berlin : Springer-Verlag, 2006. ISBN 978-3-540-49994-7, pp. 248-259. 2006, Kolkata, India. Lecture Notes in Computer Science 4337.
Original language:English
Field:Informatika
Type:Article in Proceedings
Keywords:infinite-state systems; linear time logic; decidability; model checking

We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS), possibly extended with a weak finite-state control unit, and properties described by basic fragments of action-based Linear Temporal Logic (LTL). 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. As our main result, we show that the problem is decidable for wPRS if we consider properties defined by formulae with only modalities "strict eventually" and "strict always". 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".

Related projects:

 
 
top