摘要: Several probabilistic simulation relations for probabili stic systems are defined and evaluated according to two criteria: compositionality and preservation of" interesting" …
acm.org参考文章(23)
Rob J. van Glabbeek, W. P. Weijland, Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract). ifip congress. pp. 613- 618 ,(1989)
Sudhanshu Aggarwal, Shay Kutten, Time Optimal Self-Stabilizing Spanning Tree Algorithms foundations of software technology and theoretical computer science. pp. 400- 410 ,(1993) , 10.1007/3-540-57529-4_72
David Park, Concurrency and Automata on Infinite Sequences Theoretical Computer Science. pp. 167- 183 ,(1981) , 10.1007/BFB0017309
Michael J. Fischer, Lenore D. Zuck, Reasoning about Uncertainty in Fault-tolerant Distributed Systems Systems, Proceedings of a Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems. pp. 142- 158 ,(1988) , 10.1007/3-540-50302-1_11
Nancy Lynch, Frits Vaandrager, FORWARD AND BACKWARD SIMULATIONS PART II: TIMING-BASED SYSTEMS real time theory in practice rex workshop. pp. 397- 446 ,(1991) , 10.1007/BFB0032002
Roberto Segala, Modeling and verification of randomized distributed real-time systems Massachusetts Institute of Technology. ,(1996)
Amir Pnueli, The temporal semantics of concurrent programs Theoretical Computer Science. ,vol. 13, pp. 45- 60 ,(1981) , 10.1016/0304-3975(81)90110-9
Kim G. Larsen, Arne Skou, Bisimulation through probabilistic testing Information & Computation. ,vol. 94, pp. 1- 28 ,(1991) , 10.1016/0890-5401(91)90030-6
Matthew Hennessy, Robin Milner, Algebraic laws for nondeterminism and concurrency Journal of the ACM. ,vol. 32, pp. 137- 161 ,(1985) , 10.1145/2455.2460
James Aspnes, Maurice Herlihy, Fast randomized consensus using shared memory Journal of Algorithms. ,vol. 11, pp. 441- 461 ,(1990) , 10.1016/0196-6774(90)90021-6