Time-Abstracting Bisimulation for Probabilistic Timed Automata
暂无分享,去创建一个
[1] Bengt Jonsson,et al. A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.
[2] Andrea Maggiolo-Schettini,et al. Weak bisimulation for probabilistic timed automata and applications to security , 2003, First International Conference onSoftware Engineering and Formal Methods, 2003.Proceedings..
[3] Marta Z. Kwiatkowska,et al. Automatic verification of real-time systems with discrete probability distributions , 1999, Theor. Comput. Sci..
[4] Christel Baier,et al. Deciding Bisimilarity and Similarity for Probabilistic Processes , 2000, J. Comput. Syst. Sci..
[5] William H. Sanders,et al. Optimal state-space lumping in Markov chains , 2003, Inf. Process. Lett..
[6] Rajeev Alur,et al. Model-Checking in Dense Real-time , 1993, Inf. Comput..
[7] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[8] Andrea Bianco,et al. Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.
[9] Marta Z. Kwiatkowska,et al. Symbolic model checking for probabilistic timed automata , 2007, Inf. Comput..
[10] Stavros Tripakis,et al. Analysis of Timed Systems Using Time-Abstracting Bisimulations , 2001, Formal Methods Syst. Des..
[11] R. Segala,et al. Automatic Verification of Real-Time Systems with Discrete Probability Distributions , 1999, ARTS.
[12] Robert E. Tarjan,et al. Three Partition Refinement Algorithms , 1987, SIAM J. Comput..
[13] Marta Z. Kwiatkowska,et al. Probabilistic symbolic model checking with PRISM: a hybrid approach , 2004, International Journal on Software Tools for Technology Transfer.