2467 search results - page 137 / 494 » Finite State Machines |
168
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
150
click to vote
WIA
2004
Springer
16 years 8 days ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
176
click to vote
ENTCS
2006
15 years 7 months ago
2006
We define a compositional operational semantics for state machines and their composition in UML. Each state machine describes the behavior of an object of a class. If a class of a...
176
click to vote
JCT
2006
15 years 7 months ago
2006
MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B....
194
click to vote
ICTAC
2005
Springer
16 years 13 days ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...