10 citations · 15 across the 3 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2015
Weight Assignment Logic
Vitaly Perevoshchikov
We introduce a weight assignment logic for reasoning about quantitative languages of infinite words. This logic is an extension of the classical MSO logic and permits to describe q…
cs.FL2015★ 10 cited
A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
Manfred Droste, Vitaly Perevoshchikov
Weighted timed automata (WTA) model quantitative aspects of real-time systems like continuous consumption of memory, power or financial resources. They accept quantitative timed la…