Interactive Tree Decomposition Tool for Reducing System Analysis Complexity

[1]  John S. Baras,et al.  Performance Analysis of Time-Critical Peer-to-Peer Communications in IEEE 802.15.4 Networks , 2011, 2011 IEEE International Conference on Communications (ICC).

[2]  Louis Ibarra,et al.  The clique-separator graph for chordal graphs , 2009, Discret. Appl. Math..

[3]  Marin D. Guenov,et al.  Complexity and Cost Effectiveness Measures for Systems Design , 2002 .

[4]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[5]  Edmund M. Clarke,et al.  Compositional model checking , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[6]  S. Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[7]  Hans L. Bodlaender,et al.  Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.

[8]  John S. Baras,et al.  Compositional Analysis of Dynamic Bayesian Networks and Applications to CPS , 2012 .

[9]  Aleksandra Tepeh.  Ibarra, Louis The clique-separator graph for chordal graphs. Discrete Appl. Math. 157 (2009), no. 8, 1737-1749 , 2011 .

[10]  Stephen C.-Y. Lu,et al.  Complexity in design of technical systems , 2009 .

[11]  Finn V. Jensen,et al.  Bayesian Networks and Decision Graphs , 2001, Statistics for Engineering and Information Science.

[12]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[13]  J. Pearl.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1989, Morgan Kaufmann series in representation and reasoning.