2632 search results - page 72 / 527 » Alternating Timed Automata |
115
click to vote
CAV
2006
Springer
15 years 5 months ago
2006
Springer
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
139
click to vote
LICS
1997
IEEE
15 years 5 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...
121
click to vote
CONCUR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
105
click to vote
EOR
2007
15 years 1 months ago
2007
In a steel tube mill where an endless stream of steel tube is supplied from a manufacturing facility, trim waste is never made regardless of cutting patterns used and the standard...
120
click to vote
ARCS
2008
Springer
15 years 3 months ago
2008
Springer
: The task of the creatures in the "creatures' exploration problem" is to visit all empty cells in an environment with a minimum number of steps. We have analyzed th...