Compositional Design Methodology with Constraint

[1]  Martin Leucker,et al.  Don't Know in Probabilistic Systems , 2006, SPIN.

[2]  Joost-Pieter Katoen,et al.  Compositional Abstraction for Stochastic Systems , 2009, FORMATS.

[3]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[4]  Thomas A. Henzinger,et al.  Compositional Methods for Probabilistic Systems , 2001, CONCUR.

[5]  Thomas A. Henzinger,et al.  Interface automata , 2001, ESEC/FSE-9.

[6]  Thomas A. Henzinger,et al.  Synchronous and Bidirectional Component Interfaces , 2002, CAV.

[7]  Holger Hermanns,et al.  Interactive Markov Chains , 2002, Lecture Notes in Computer Science.

[8]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[9]  James H. Davenport,et al.  The complexity of quantifier elimination and cylindrical algebraic decomposition , 2007, ISSAC '07.

[10]  Kim G. Larsen,et al.  On determinism in modal transition systems , 2009, Theor. Comput. Sci..

[11]  Suzana Andova,et al.  Process Algebra with Probabilistic Choice , 1999, ARTS.

[12]  Serge Haddad,et al.  Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[13]  Hirokazu Anai,et al.  SyNRAC: a maple toolbox for solving real algebraic constraints , 2007, ACCA.

[14]  Lijun Zhang,et al.  Probabilistic CEGAR , 2008, CAV.

[15]  Thomas A. Henzinger,et al.  The Embedded Systems Design Challenge , 2006, FM.

[16]  Saugata Basu,et al.  New results on quantifier elimination over real closed fields and applications to constraint databases , 1999, JACM.

[17]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[18]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[19]  Krishnendu Chatterjee,et al.  Model-Checking omega-Regular Properties of Interval Markov Chains , 2008, FoSSaCS.

[20]  Frank Ciesinski,et al.  On Probabilistic Computation Tree Logic , 2004, Validation of Stochastic Systems.

[21]  Joost-Pieter Katoen,et al.  Three-Valued Abstraction for Continuous-Time Markov Chains , 2007, CAV.

[22]  Thomas A. Henzinger,et al.  Interface theories with component reuse , 2008, EMSOFT '08.

[23]  Joost-Pieter Katoen,et al.  Process algebra for performance evaluation , 2002, Theor. Comput. Sci..

[24]  Thomas A. Henzinger,et al.  INTERFACE-BASED DESIGN , 2005 .

[25]  Kim G. Larsen,et al.  Modal I/O Automata for Interface and Product Line Theories , 2007, ESOP.

[26]  Wang Yi,et al.  Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.

[27]  Axel Legay,et al.  Modal interfaces: unifying interface automata and modal specifications , 2009, EMSOFT '09.

[28]  Kim G. Larsen,et al.  Modal Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[29]  Mahesh Viswanathan,et al.  Model-Checking Markov Chains in the Presence of Uncertainties , 2006, TACAS.

[30]  Kim G. Larsen,et al.  Compositional Verification of Probabilistic Processes , 1992, CONCUR.

[31]  Manuel Núñez,et al.  An Overview of Probabilistic Process Algebras and their Equivalences , 2004, Validation of Stochastic Systems.

[32]  Kim Guldstrand Larsen,et al.  Specification and refinement of probabilistic processes , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[33]  Christopher W. Brown.  Simple CAD Construction and its Applications , 2001, J. Symb. Comput..