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...
Na minha lista:
| Principais autores: | , , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Logical Methods in Computer Science e.V.
2018-12-01
|
| coleção: | Logical Methods in Computer Science |
| Assuntos: | |
| Acesso em linha: | https://lmcs.episciences.org/3106/pdf |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|