IMPLEMENTATION OF SYMBOLIC MODEL CHECKING FOR

[1]  Holger Hermanns,et al.  A Markov Chain Model Checker , 2000, TACAS.

[2]  Thomas Filkorn,et al.  Generating BDDs for symbolic model checking in CCS , 2005, Distributed Computing.

[3]  Jesse Hoey,et al.  SPUDD: Stochastic Planning using Decision Diagrams , 1999, UAI.

[4]  Edmund M. Clarke,et al.  Symbolic Model Checking with Partitioned Transistion Relations , 1991, VLSI.

[5]  Marta Z. Kwiatkowska,et al.  Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM , 2001, CAV.

[6]  Gianfranco Ciardo,et al.  Storage Alternatives for Large Structured State Spaces , 1997, Computer Performance Evaluation.

[7]  Peter W. Glynn,et al.  Computing Poisson probabilities , 1988, CACM.

[8]  Christel Baier,et al.  Model Checking Continuous-Time Markov Chains by Transient Analysis , 2000, CAV.

[9]  Saharon Shelah,et al.  Reasoning with Time and Chance , 1982, Inf. Control..

[10]  R. I. Bahar,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[11]  Zohar Manna,et al.  Formal verification of probabilistic systems , 1997 .

[12]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[13]  Kishor S. Trivedi,et al.  Stochastic Petri Net Models of Polling Systems , 1990, IEEE J. Sel. Areas Commun..

[14]  G. Ciardo,et al.  ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS , 1996 .

[15]  Sérgio Vale Aguiar Campos,et al.  ProbVerus: Probabilistic Symbolic Model Checking , 1999, ARTS.

[16]  Massoud Pedram,et al.  Edge Valued Binary Decision Diagrams , 1996 .

[17]  Stephen Gilmore,et al.  The PEPA Workbench: A Tool to Support a Process Algebra-based Approach to Performance Modelling , 1994, Computer Performance Evaluation.

[18]  Robert K. Brayton,et al.  Verifying Continuous Time Markov Chains , 1996, CAV.

[19]  Kishor S. Trivedi,et al.  A Decomposition Approach for Stochastic Reward Net Models , 1993, Perform. Evaluation.

[20]  M. Siegle,et al.  Multi Terminal Binary Decision Diagrams to Represent and Analyse Continuous Time Markov Chains , 1999 .

[21]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[22]  Christel Baier,et al.  On the Logical Characterisation of Performability Properties , 2000, ICALP.

[23]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[24]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[25]  Christel Baier,et al.  Model checking performability properties , 2002, Proceedings International Conference on Dependable Systems and Networks.

[26]  Henrik Ejersbo Jensen,et al.  Reachability Analysis of Probabilistic Systems by Successive Refinements , 2001, PAPM-PROBMIV.

[27]  J. Hillston.  The nature of synchronisation , 1994 .

[28]  Markus Siegle.  Compositional Representation and Reduction of Stochastic Labelled Transition Systems based on Decision Node BDDs , 1999, MMB.

[29]  P. Buchholz,et al.  Complexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models , 1997 .

[30]  Olivier Coudert,et al.  A Performance Study of BDD-Based Model Checking , 1998, FMCAD.

[31]  Christel Baier,et al.  The Algebraic Mu-Calculus and MTBDDs , 1998 .

[32]  Enrico Macii,et al.  Algebric Decision Diagrams and Their Applications , 1997, ICCAD '93.

[33]  R. Segala,et al.  Symbolic Model Checking of Concurrent Probabilistic Systems Using MTBDDs and Simplex , 1999 .

[34]  Maurice Herlihy,et al.  Fast Randomized Consensus Using Shared Memory , 1990, J. Algorithms.

[35]  Joost-Pieter Katoen,et al.  Faster and Symbolic CTMC Model Checking , 2001, PAPM-PROBMIV.

[36]  Holger Hermanns,et al.  Compositional performance modelling with the TIPPtool , 2000, Perform. Evaluation.

[37]  Mihalis Yannakakis,et al.  Markov Decision Processes and Regular Events (Extended Abstract) , 1990, ICALP.

[38]  Marta Z. Kwiatkowska,et al.  Probabilistic symbolic model checking with PRISM: a hybrid approach , 2004, International Journal on Software Tools for Technology Transfer.

[39]  Beate Bollig,et al.  Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.

[40]  Edmund M. Clarke,et al.  A quantitative approach to the formal verification of real-time systems , 1996 .

[41]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[42]  Enrico Macii,et al.  Markovian analysis of large finite state machines , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[43]  Stavros Tripakis,et al.  The Tool KRONOS , 1996, Hybrid Systems.

[44]  John N. Tsitsiklis,et al.  An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..

[45]  Thomas Kropf,et al.  Using MTBDDs for discrete timed symbolic model checking , 1997, Proceedings European Design and Test Conference. ED & TC 97.

[46]  Peter Buchholz,et al.  Compact representations of probability distributions in the analysis of Superposed GSPNs , 2001, Proceedings 9th International Workshop on Petri Nets and Performance Models.

[47]  Frits W. Vaandrager,et al.  Root Contention in IEEE 1394 , 1999, ARTS.

[48]  Thomas A. Henzinger,et al.  Reactive Modules , 1999, Formal Methods Syst. Des..

[49]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[50]  Amir Pnueli,et al.  Verification of multiprocess probabilistic protocols , 2005, Distributed Computing.

[51]  Daniel N. Osherson,et al.  Eliminating Incoherence from Subjective Estimates of Chance , 2002, KR.

[52]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[53]  Holger Hermanns,et al.  Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation , 1999, ARTS.

[54]  Marta Z. Kwiatkowska,et al.  A Symbolic Out-of-Core Solution Method for Markov Models , 2002, Electron. Notes Theor. Comput. Sci..

[55]  C. Y. Lee.  Representation of switching circuits by binary-decision programs , 1959 .

[56]  Luca de Alfaro,et al.  From Fairness to Chance , 1998, PROBMIV.

[57]  Rance Cleaveland,et al.  TwoTowers: A Tool Integrating Functional and Performance Analysis of Concurrent Systems , 1998, FORTE.

[58]  Daniel Lehmann,et al.  On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.

[59]  Marta Z. Kwiatkowska,et al.  PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.

[60]  Luca de Alfaro,et al.  Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation , 2000, TACAS.

[61]  Enrico Macii,et al.  Probabilistic Analysis of Large Finite State Machines , 1994, 31st Design Automation Conference.

[62]  Christel Baier,et al.  Approximate Symbolic Model Checking of Continuous-Time Markov Chains , 1999, CONCUR.

[63]  Vitaly Shmatikov,et al.  Probabilistic analysis of anonymity , 2002, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15.

[64]  Masahiro Fujita,et al.  Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation , 1997, Formal Methods Syst. Des..

[65]  Vasiliki Hartonas-Garmhausen.  Probabilistic symbolic model checking with engineering models and applications , 1998 .

[66]  Andrea Bianco,et al.  Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.

[67]  Adnan Aziz,et al.  It Usually Works: The Temporal Logic of Stochastic Systems , 1995, CAV.

[68]  Brigitte Plateau.  On the stochastic structure of parallelism and synchronization models for distributed algorithms , 1985, SIGMETRICS 1985.

[69]  Christel Baier,et al.  Symbolic Model Checking for Probabilistic Processes , 1997, ICALP.

[70]  Christel Baier,et al.  Model checking for a probabilistic branching time logic with fairness , 1998, Distributed Computing.

[71]  Nancy A. Lynch,et al.  Proving time bounds for randomized distributed algorithms , 1994, PODC '94.

[72]  Somesh Jha,et al.  Verification of the Futurebus+ cache coherence protocol , 1993, Formal Methods Syst. Des..

[73]  Shuzo Yajima,et al.  The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams , 1993, ISAAC.

[74]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[75]  Masahiro Fujita,et al.  Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping , 1993, 30th ACM/IEEE Design Automation Conference.

[76]  Massoud Pedram,et al.  Factored Edge-Valued Binary Decision Diagrams , 1997, Formal Methods Syst. Des..

[77]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .

[78]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[79]  Sandeep K. Shukla,et al.  Formal analysis and validation of continuous-time Markov chain based system level power management strategies , 2002, Seventh IEEE International High-Level Design Validation and Test Workshop, 2002..

[80]  Michael O. Rabin,et al.  N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable , 1982, J. Comput. Syst. Sci..

[81]  Holger Hermanns,et al.  On the use of MTBDDs for performability analysis and verification of stochastic systems , 2003, J. Log. Algebraic Methods Program..

[82]  Hans A. Hansson.  Time and probability in formal design of distributed systems , 1991, DoCS.

[83]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[84]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[85]  Micha Sharir,et al.  Probabilistic temporal logics for finite and bounded models , 1984, STOC '84.

[86]  Micha Sharir,et al.  Termination of Probabilistic Concurrent Program , 1983, TOPL.

[87]  Peter Kemper.  Numerical Analysis of Superposed GSPNs , 1996, IEEE Trans. Software Eng..

[88]  Frits W. Vaandrager,et al.  Proof-Checking a Data Link Protocol , 1994, TYPES.

[89]  Jesse Hoey,et al.  APRICODD: Approximate Policy Construction Using Decision Diagrams , 2000, NIPS.

[90]  Oded Maler,et al.  On the Representation of Probabilities over Structured Domains , 1999, CAV.

[91]  Sarma B. K. Vrudhula,et al.  Formal Verification Using Edge-Valued Binary Decision Diagrams , 1996, IEEE Trans. Computers.

[92]  Mihalis Yannakakis,et al.  Verifying temporal properties of finite-state probabilistic programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[93]  Thomas Kropf,et al.  Using MTBDDs for Compostion and Model Checking of Real-Time Systems , 1998, FMCAD.

[94]  Conrado Daws,et al.  Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM , 2002, International Journal on Software Tools for Technology Transfer.

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