Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Symbolic reachability analysis

In the context of reachability analysis, this graph is called symbolic reachability graph of the automaton A and can be searched using shortest path search techniques as widely used in computer science. Hence, the task of finding the cost-optimal schedule is to find the shortest (or cheapest) path in a (priced) symbolic reachability graph. [Pg.226]

BDDs, FSMs, Reachability Analysis, Symbolic Breadth-First Traversals, Parallel Computing... [Pg.167]

Although quite successful, symbolic methods cannot complete the reachability analysis of large FSMs, because ... [Pg.168]

See other pages where Symbolic reachability analysis is mentioned: [Pg.225]    [Pg.152]    [Pg.155]    [Pg.225]    [Pg.152]    [Pg.155]    [Pg.227]    [Pg.220]    [Pg.222]    [Pg.233]    [Pg.123]   
See also in sourсe #XX -- [ Pg.225 ]



SEARCH



Reachability analysis

© 2024 chempedia.info