Global ETD Search

1	Weighted tree automata and quantitative logics with a focus on ambiguity Paul, Erik 20 October 2017 (has links) We relate various restrictions of a quantitative logic to subclasses of weighted tree automata. The subclasses are defined by the level of ambiguity allowed in the automata. This yields a generalization of the results by Stephan Kreutzer and Cristian Riveros, who considered the same problem for weighted automata over words. Along the way we also prove that a finitely ambiguous weighted tree automaton can be decomposed into unambiguous ones and define and analyze polynomial ambiguity for tree automata. info:eu-repo/classification/ddc/000 ddc:000
2	Multi-weighted Automata Models and Quantitative Logics Perevoshchikov, Vitaly 06 May 2015 (has links) (PDF) Recently, multi-priced timed automata have received much attention for real-time systems. These automata extend priced timed automata by featuring several price parameters. This permits to compute objectives like the optimal ratio between rewards and costs. Arising from the model of timed automata, the multi-weighted setting has also attracted much notice for classical nondeterministic automata. The present thesis develops multi-weighted MSO-logics on finite, infinite and timed words which are expressively equivalent to multi-weighted automata, and studies decision problems for them. In addition, a Nivat-like theorem for weighted timed automata is proved; this theorem establishes a connection between quantitative and qualitative behaviors of timed automata. Moreover, a logical characterization of timed pushdown automata is given. multi-gewichtete Automaten quantitative Logik monadische Logik zweiter Stufe Zeitautomaten Omega-Automaten quantitative Sprachen Keller-Zeitautomaten multi-weighted automata quantitative logic monadic second-order logic timed automata omega-automata quantitative languages timed pushdown languages ddc:500
3	Multi-weighted Automata Models and Quantitative Logics Perevoshchikov, Vitaly 28 April 2015 (has links) Recently, multi-priced timed automata have received much attention for real-time systems. These automata extend priced timed automata by featuring several price parameters. This permits to compute objectives like the optimal ratio between rewards and costs. Arising from the model of timed automata, the multi-weighted setting has also attracted much notice for classical nondeterministic automata. The present thesis develops multi-weighted MSO-logics on finite, infinite and timed words which are expressively equivalent to multi-weighted automata, and studies decision problems for them. In addition, a Nivat-like theorem for weighted timed automata is proved; this theorem establishes a connection between quantitative and qualitative behaviors of timed automata. Moreover, a logical characterization of timed pushdown automata is given. info:eu-repo/classification/ddc/500 ddc:500

1

Page generated in 0.0617 seconds