70 likes | 157 Views
Discover how automata algorithms simplify search processes, including Class Graph (CG), Strategy Graph (SG), and Traversal Automaton (TA) to optimize bus route planning. Explore terminology and strategies to efficiently guide object traversal.
E N D
Bus Route ExampleMeta Information Simplifies Search Karl Lieberherr
Automata as algorithms • Sometimes an Automaton is the best algorithm • The limited expressiveness makes it easier to develop the algorithm. • Use an automaton to guide the search.
Terminology • Class graph CG: simplified UML class diagram • Strategy graph SG: structural query about where to go • Traversal automaton TA: to guide the object traversal
BR: BusRoute V: Village BS: BusStop B: Bus P: Person =: otherwise CG BR BS B V P P SG BR BS How many persons wait at a bus stop BS P V TA BR BS P qinit qBR qBS qP = = = = qStuck any symbol
iBR i1V i1BS i1P i2P i1B i3P i4P i5P i2BS i6P i7P i8P i9P i1BS i2V
U BR: BusRoute V: Village BS: BusStop B: Bus P: Person C: Covered U: Uncovered =: otherwise CG C BR BS B V P P SG BR U How many persons wait at an uncovered bus stop V,BS U P TA BR U P qinit qBR qU qP = = = = qStuck any symbol
iBR i1V i1BS i1P i2P i1B i1U i3P i4P i5P i2U i6P i7P i8P i9P i1C i2V