Results 11 to 20 of about 842,589 (329)
Weighted tree automata and weighted logics
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heiko Vogler
exaly +3 more sources
Nested Weighted Automata [PDF]
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015 Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed ...
Krishnendu Chatterjee +2 more
core +5 more sources
Weighted Automata over Vector Spaces [PDF]
International Conference on Automata and Formal Languages, 2023 In this paper we deal with three models of weighted automata that take weights in the field of real numbers. The first of these models are classical weighted finite automata, the second one are crisp-deterministic weighted automata, and the third one are
Nada Damljanovic +2 more
semanticscholar +3 more sources
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings [PDF]
Logical Methods in Computer Science, 2023 This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating automata and prove ...
Gustav Grabolle
doaj +3 more sources
Weighted Automata and Weighted Logics [PDF]
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Droste, Manfred, Gastin, Paul
openaire +4 more sources
Featured Weighted Automata [PDF]
2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE), 2017 A featured transition system is a transition system in which the transitions are annotated with feature expressions: Boolean expressions on a finite number of given features. Depending on its feature expression, each individual transition can be enabled when some features are present, and disabled for other sets of features.
Fahrenberg, Uli, Legay, Axel
openaire +4 more sources
Probabilistic Weighted Automata [PDF]
, 2009 Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). The value of an infinite word w is computed as the maximal value of all runs over w, and the value of a run as the maximum, limsup, liminf, limit average, or discounted sum of ...
Chatterjee, Krishnendu +2 more
openaire +5 more sources
Weighted automata and weighted logics with discounting
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manfred Droste, George Rahonis
openaire +3 more sources
Bisimulation Metrics for Weighted Automata
CoRR, 2017 We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale's linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA. Our development is based on spectral properties of sets of linear operators.
Balle, Borja +2 more
openaire +5 more sources
Aperiodic Weighted Automata and Weighted First-Order Logic [PDF]
International Symposium on Mathematical Foundations of Computer Science, 2019 By fundamental results of Sch\"utzenberger, McNaughton and Papert from the 1970s, the classes of first-order definable and aperiodic languages coincide. Here, we extend this equivalence to a quantitative setting.
M. Droste, P. Gastin
semanticscholar +3 more sources