Model checking flat freeze LTL on one-counter automataReportar como inadecuado




Model checking flat freeze LTL on one-counter automata - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Reference: Lechner, A, Mayr, R, Ouaknine, J et al., (2016). Model checking flat freeze LTL on one-counter automata. 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016).Citable link to this page:

 

Model checking flat freeze LTL on one-counter automata

Abstract: 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 full generality and PSPACE-complete for the special case of deterministic one-counter automata. Several years ago, Demri and Sangnier investigated the model checking problem for the flat fragment of Freeze LTL on several classes of counter automata and posed the decidability of model checking flat Freeze LTL on one-counter automata as an open problem. In this paper we resolve this problem positively, utilising a known reduction to a reachability problem on one-counter automata with parameterised equality and disequality tests. Our main technical contribution is to show decidability of the latter problem by translation to Presburger arithmetic.

Publication status:PublishedPeer Review status:Peer reviewedVersion:Publisher's versionDate of acceptance:2016-04-15Notes:© Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, and James Worrell; licensed under Creative Commons License CC-BY

Bibliographic Details

Publisher: Schloss Dagstuhl – Leibniz Center for Informatics

Publisher Website: https://www.dagstuhl.de/en/

Host: 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016)see more from them

Publication Website: http://www.easyconferences.eu/icalp2016/

Volume: 59

Issue Date: 2016-08Identifiers

Doi: https://doi.org/10.4230/LIPIcs.CONCUR.2016.29

Issn: 1868-8969

Uuid: uuid:45951abe-d7ac-4424-a7f5-4111c53736a6

Urn: uri:45951abe-d7ac-4424-a7f5-4111c53736a6

Pubs-id: pubs:627106 Item Description

Type: conference-paper;

Version: Publisher's versionKeywords: One-counter automata disequality tests reachability freeze LTL Presburger arithmetic

Relationships





Autor: Lechner, A - - - Mayr, R - - - Ouaknine, J - Oxford, MPLS, Computer Science - - - Pouly, A - - - Worrell, J - Oxford, MPLS, Compu

Fuente: https://ora.ox.ac.uk/objects/uuid:45951abe-d7ac-4424-a7f5-4111c53736a6



DESCARGAR PDF




Documentos relacionados