On the decidability of model checking for several μ-calculi and Petri nets

On the decidability of model checking for several μ-calculi and Petri nets

The decidability of the model checking problem for several μ-calculi and Petri nets is analysed. The linear time μ-calculus without atomic sentences is decidable; if simple atomic sentences are added, it becomes undecidable. A very simple subset of the modal μ-calculus is undecidable.

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Esparza, Javier
Format: Buchkapitel
Sprache:eng
Schlagworte:
Closed Formula
Finite Automaton
Input Place
Label Transition System
Temporal Logic
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The decidability of the model checking problem for several μ-calculi and Petri nets is analysed. The linear time μ-calculus without atomic sentences is decidable; if simple atomic sentences are added, it becomes undecidable. A very simple subset of the modal μ-calculus is undecidable.
ISSN:0302-9743
1611-3349
DOI:10.1007/BFb0017477