398 search results - page 56 / 80 » Spider Diagrams of Order |
FM
2001
Springer
14 years 2 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
ICSM
1999
IEEE
14 years 2 months ago
1999
IEEE
In order to maintain the consistency between sources and documentation, while at the same time providing documentation at the design level, it is necessary to generate documentati...
VLSID
1996
IEEE
14 years 2 months ago
1996
IEEE
Reduced Ordered Binary Decision Diagrams ROBDDs have traditionally been built in a bottom-up fashion. In this scheme, the intermediate peak memory utilization is often larger than...
TYPES
1994
Springer
14 years 1 months ago
1994
Springer
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
AIPS
2008
14 years 5 days ago
2008
The heuristics used for planning and search often take the pattern databases generated from abstracted versions of the given state space. Pattern databases are typically stored p ...