Compact representation of large performability models based on extended BDDs
暂无分享,去创建一个
[1] Masahiro Fujita,et al. Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation , 1997, Formal Methods Syst. Des..
[2] Jean-Claude Fernandez,et al. An Implementation of an Efficient Algorithm for Bisimulation Equivalence , 1990, Sci. Comput. Program..
[3] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.
[4] Markus Siegle,et al. Technique and tool for symbolic representation and manipulation of stochastic transition systems , 1998, Proceedings. IEEE International Computer Performance and Dependability Symposium. IPDS'98 (Cat. No.98TB100248).
[5] Jane Hillston,et al. A compositional approach to performance modelling , 1996 .
[6] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[7] Scott A. Smolka,et al. CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.
[8] Yung-Te Lai,et al. Edge-valued binary decision diagrams for multi-level hierarchical verification , 1992, DAC '92.
[9] H. Hermanns,et al. Syntax , Semantics , Equivalences , and Axioms for MTIPP y , 1994 .
[10] Scott A. Smolka,et al. CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.