1343 search results - page 15 / 269 » Learning Weighted Automata |
107
click to vote
ENTCS
2007
14 years 10 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
81
Voted
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
Links are established between three widely used modeling frameworks for reactive systems: the ioco theory of Tretmans, the interface automata of De Alfaro and Henzinger, and Mealy ...
ACTA
2004
14 years 10 months ago
2004
The generative capability of several variants of P systems with symport/antiport is studied via the simulation of counter automata. This leads to the reduction of the complexity, e...
165
click to vote
FOSSACS
2011
Springer
14 years 2 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...