85 search results - page 7 / 17 » Partial Higher-dimensional Automata |
LATIN
1992
Springer
15 years 1 months ago
1992
Springer
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
106
click to vote
CAV
2003
Springer
15 years 2 months ago
2003
Springer
We consider the problem of synthesizing controllers for timed systems modeled using timed automata. The point of departure from earlier work is that we consider controllers that ha...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs (if any exists) a maximal p-periodic partial word contained in w with ...
FORMATS
2008
Springer
14 years 11 months ago
2008
Springer
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies ...
MST
2008
14 years 9 months ago
2008
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...