3169 search results - page 149 / 634 » Robust Timed Automata |
ENTCS
2008
15 years 2 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
113
Voted
ENTCS
2006
15 years 2 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
149
Voted
IPL
2008
15 years 2 months ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
109
Voted
GMP
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract. This paper presents the mathematical framework, and develops algorithms accordingly, to continuously and robustly track the intersection curves of two deforming parametri...
121
Voted
COCOA
2009
Springer
15 years 9 months ago
2009
Springer
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...