Model Checking Flat Freeze LTL on One-Counter Automata
Freeze LTL is a temporal logic with registers that is suitable for specifying properties of data words. In this paper we study the model checking problem for Freeze LTL on one-counter automata. This problem is known to be undecidable in general and PSPACE-complete for the special case of determinist...
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
Logical Methods in Computer Science e.V.
2018-12-01
|
| Collection: | Logical Methods in Computer Science |
| Sujets: | |
| Accès en ligne: | https://lmcs.episciences.org/3106/pdf |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|