Universal Coinductive Characterisations of Process Semantics
暂无分享,去创建一个
[1] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[2] D. F. Escrig,et al. Bisimulations up-to for the linear time branching time spectrum , 2005 .
[3] Stephen D. Brookes,et al. Possible futures, acceptances, refusals, and communicating processes , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[4] Jan Friso Groote,et al. Structured Operational Semantics and Bisimulation as a Congruence , 1992, Inf. Comput..
[5] Gordon D. Plotkin,et al. A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..
[6] R. V. Glabbeek. CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes , 2001 .
[7] D. F. Escrig,et al. (Bi)simulations up-to characterise process semantics , 2009 .
[8] David de Frutos Escrig,et al. Simulations Up-to and Canonical Preorders , 2007 .
[9] Luca Aceto,et al. Ready to Preorder: Get Your BCCSP Axiomatization for Free! , 2007, CALCO.
[10] David Park,et al. Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.
[11] Luca Aceto,et al. Nested Semantics over Finite Trees are Equationally Hard: Invited Talk , 2003, EXPRESS.
[12] W. Fokkink,et al. Finite equational bases in process algebra: results and open questions , 2005 .
[13] David de Frutos-Escrig,et al. Bisimulations Up-to for the Linear Time Branching Time Spectrum , 2005, CONCUR.