Parity Automata for Quantitative Linear Time Logics
書誌事項
- タイトル
- Parity Automata for Quantitative Linear Time Logics
- 著者
- Corina Cirstea, Shunsuke Shimizu, Ichiro Hasuo
説明
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.
収録刊行物
-
- Proc. CALCO 2017, Leibniz International Proceedings in Informatics
-
Proc. CALCO 2017, Leibniz International Proceedings in Informatics 72 2017
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1010000781867611780
-
- 資料種別
- journal article
-
- データソース種別
-
- KAKEN
- OpenAIRE