On Decidability of LTL Model Checking for Process Rewrite Systems

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). It is known that the prob...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Bozzelli, Laura, Křetínský, Mojmír, Řehák, Vojtěch, Strejček, Jan
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Decidability Boundary Exact sciences and technology Linear Temporal Logic Model Check Normal Form Process Constant Software Software engineering Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!