Equivalences and Preorders of Transition Systems
暂无分享,去创建一个
[1] Anne Dicky,et al. An Algebraic Characterization of Transition System Equivalences , 1989, Inf. Comput..
[2] Robin Milner,et al. Algebraic laws for nondeterminism and concurrency , 1985, JACM.
[3] A. Arnold. Systèmes de transitions finis et sémantique des processus communicants , 1990 .
[4] Joseph Y. Halpern,et al. “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.
[5] Kim G. Larsen,et al. A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[6] Rocco De Nicola,et al. Three logics for branching bisimulation , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.
[7] Kim G. Larsen,et al. Graphical Versus Logical Specifications , 1990, Theor. Comput. Sci..
[8] Matthew Hennessy,et al. The Power of the Future Perfect in Program Logics , 1984, Inf. Control..
[9] A. Prasad Sistla,et al. Deciding Full Branching Time Logic , 1985, Inf. Control..