A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
From MaRDI portal
Publication:5167836
DOI10.1007/978-3-662-43951-7_15zbMath1409.68158arXiv1506.06038OpenAlexW49543784MaRDI QIDQ5167836
Vitaly Perevoshchikov, Manfred Droste
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.06038
discountingquantitative logicaverage behaviorweighted timed automataNivat's theoremlinearly priced timed automata
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (13)
Weight Assignment Logic ⋮ Weighted Register Automata and Weighted Logic on Data Words ⋮ A Logical Characterization of Timed Pushdown Languages ⋮ Logics for Weighted Timed Pushdown Automata ⋮ Decomposition and factorization of chemical reaction transducers ⋮ A Nivat theorem for weighted picture automata and weighted MSO logics ⋮ Multi-weighted automata and MSO logic ⋮ Weighted register automata and weighted logic on data words ⋮ A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic ⋮ A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties ⋮ Weighted Symbolic Automata with Data Storage ⋮ Weighted operator precedence languages ⋮ Weighted automata
This page was built for publication: A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
