License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CALCO.2017.7
URN: urn:nbn:de:0030-drops-80468
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8046/
Cirstea, Corina ;
Shimizu, Shunsuke ;
Hasuo, Ichiro
Parity Automata for Quantitative Linear Time Logics
Abstract
We initiate a study of automata-based model checking for previously proposed quantitative linear time logics interpreted over coalgebras. Our results include: (i) an automata-theoretic characterisation of the semantics of these logics, based on a notion of extent of a quantitative parity automaton, (ii) a study of the expressive power of Buchi variants of such automata, with implications on the expressiveness of fragments of the logics considered, and (iii) a naive algorithm for computing extents, under additional assumptions on the domain of truth values.
BibTeX - Entry
@InProceedings{cirstea_et_al:LIPIcs:2017:8046,
author = {Corina Cirstea and Shunsuke Shimizu and Ichiro Hasuo},
title = {{Parity Automata for Quantitative Linear Time Logics}},
booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)},
pages = {7:1--7:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-033-0},
ISSN = {1868-8969},
year = {2017},
volume = {72},
editor = {Filippo Bonchi and Barbara K{\"o}nig},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8046},
URN = {urn:nbn:de:0030-drops-80468},
doi = {10.4230/LIPIcs.CALCO.2017.7},
annote = {Keywords: coalgebra, quantitative logic, linear time logic, parity automaton}
}
Keywords: |
|
coalgebra, quantitative logic, linear time logic, parity automaton |
Collection: |
|
7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) |
Issue Date: |
|
2017 |
Date of publication: |
|
17.11.2017 |