Abstract
We introduce a new logic called Monitor Logic and show that it is expressively equivalent to Quantitative Monitor Automata.
BibTeX - Entry
@InProceedings{paul:LIPIcs:2017:8113,
author = {Erik Paul},
title = {{Monitor Logics for Quantitative Monitor Automata}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {14:1--14:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8113},
URN = {urn:nbn:de:0030-drops-81133},
doi = {10.4230/LIPIcs.MFCS.2017.14},
annote = {Keywords: Quantitative Monitor Automata, Nested Weighted Automata, Monitor Logics, Weighted Logics}
}
Keywords: |
|
Quantitative Monitor Automata, Nested Weighted Automata, Monitor Logics, Weighted Logics |
Collection: |
|
42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) |
Issue Date: |
|
2017 |
Date of publication: |
|
01.12.2017 |