Sciweavers

122 search results - page 13 / 25
» Weighted automata with discounting
Sort
View
ACTA
2004
87views more  ACTA 2004»
13 years 7 months ago
P systems with symport/antiport simulating counter automata
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...
Pierluigi Frisco, Hendrik Jan Hoogeboom
FOSSACS
2011
Springer
12 years 11 months ago
Minimizing Deterministic Lattice Automata
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...
Shulamit Halamish, Orna Kupferman
SCP
2010
126views more  SCP 2010»
13 years 6 months ago
Component simulation-based substitutivity managing QoS and composition issues
Several scientic bottlenecks have been identied in existing component-based approaches. em, we focus on the identication of a relevant abstraction for the component expression ...
Pierre-Cyrille Héam, Olga Kouchnarenko, J&e...
AAAI
2010
13 years 9 months ago
An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in repeated games with discounting. The process starts with a s...
Andriy Burkov, Brahim Chaib-draa
REX
1991
13 years 11 months ago
The Theory of Timed Automata
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
Rajeev Alur, David L. Dill