Sciweavers

36 search results - page 3 / 8
» Symbolic Exploration of transition Hierarchies
Sort
View
INFOVIS
2005
IEEE
13 years 12 months ago
Elastic Hierarchies: Combining Treemaps and Node-Link Diagrams
We investigate the use of elastic hierarchies for representing trees, where a single graphical depiction uses a hybrid mixture, or “interleaving”, of more basic forms at diffe...
Shengdong Zhao, Michael J. McGuffin, Mark H. Chign...
CONCUR
2001
Springer
13 years 10 months ago
Symbolic Computation of Maximal Probabilistic Reachability
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
AVI
2008
13 years 8 months ago
Timeline trees: visualizing sequences of transactions in information hierarchies
In many applications transactions between the elements of an information hierarchy occur over time. For example, the product offers of a department store can be organized into pro...
Michael Burch, Fabian Beck, Stephan Diehl
TACAS
2009
Springer
106views Algorithms» more  TACAS 2009»
14 years 1 months ago
Hierarchical Set Decision Diagrams and Regular Models
Abstract. This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic modelchecking. We encod...
Yann Thierry-Mieg, Denis Poitrenaud, Alexandre Ham...
APN
2010
Springer
13 years 11 months ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Thomas Chatain, Eric Fabre