Bisimulation for Communicating Piecewise Deterministic Markov Processes (CPDPs)
暂无分享,去创建一个
[1] van der Arjan Schaft,et al. Proceedings of the 16th International Symposium on Mathematical Theory of Networks and Systems , 2004 .
[2] S. Shankar Sastry,et al. Hybrid Systems with Finite Bisimulations , 1997, Hybrid Systems.
[3] Kim G. Larsen,et al. Bisimulation through Probabilistic Testing , 1991, Inf. Comput..
[4] K. Parthasarathy,et al. Probability measures on metric spaces , 1967 .
[5] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[6] Pedro R. D'Argenio,et al. Algebras and Automata for Timed and Stochastic Systems , 1999 .
[7] Arjan van der Schaft,et al. Communicating Piecewise Deterministic Markov Processes , 2003, ADHS.
[8] Holger Hermanns,et al. Interactive Markov Chains , 2002, Lecture Notes in Computer Science.
[9] A. Schaft,et al. Stochastic equivalence of CPDP-automata and piecewise deterministic Markov processes , 2005 .
[10] George J. Pappas. Bisimilar linear systems , 2003, Autom..
[11] Mark H. A. Davis. Piecewise-deterministic Markov processes , 1993 .
[12] Mark H. Davis. Markov Models and Optimization , 1995 .
[13] Arjan van der Schaft,et al. Bisimulation of Dynamical Systems , 2004, HSCC.
[14] Thomas A. Henzinger,et al. Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.
[15] Panos J. Antsaklis,et al. Hybrid Systems V , 1999, Lecture Notes in Computer Science.
[16] Arjan van der Schaft,et al. Equivalence of hybrid dynamical systems , 2004 .