Citation: | WANG Chao, WU Jinzhao, TAN Hongyan, “Revised Singleton Failures Equivalence for Labelled Transition Systems,” Chinese Journal of Electronics, vol. 24, no. 3, pp. 498-501, 2015, doi: 10.1049/cje.2015.07.010 |
S.D. Brookes, C.A. Hoare and A.W. Roscoe, "A theory of communicating sequential processes", Journal of the ACM (JACM), Vol.31, No.3, pp.560-599, 1984.
|
S. Dunne, "Termination without√ in CSP", FM 2011: Formal Methods, Springer, pp.278-292, 2011.
|
R.J. van Glabbeek, U. Goltz and J. Schicke-Uffmann, "On characterising distributability", arXiv preprint arXiv:1309.3883, 2013.
|
W. Chao, L. Yi, W. JinZhao and T. HongYan, "Approximate failures semantics for polynomial labelled transition systems", Journal of Donghua University (English Edition), Vol.6, pp. 472-476, 2013.
|
W. Chao, W. JinZhao and T. HongYan, "Approximate trace and singleton failures equivalences for transition systems", Journal of Systems Engineering and Electronics, 2015.
|
S. Reeves and D. Streader, "Data refinement and singleton failures refinement are not equivalent", Formal Aspects of Computing, Vol.20, No.3, pp.295-301, 2008.
|
E.A. Boiten, "Introducing extra operations in refinement", Formal Aspects of Computing, Vol.26, No.2, pp.305-317, 2014.
|
J. Derrick and E. Boiten, "Relational concurrent refinement part III: Traces, partial relations and automata", Formal Aspects of Computing, Vol.26, No.2, pp.407-432, 2014.
|
F.S. de Boer, J.N. Kok, C. Palamidessi and J.J. Rutten, "The failure of failures in a paradigm for asynchronous communication", CONCUR'91, Springer, pp.111-126, 1991.
|
C. Bolton and J. Davies, "A singleton failures semantics for communicating sequential processes", Formal Aspects of Computing, Vol.18, No.2, pp.181-210, 2006.
|
R.J. Van Glabbeek, "The linear time-branching time spectrum i-the semantics of concrete, sequential processes", Handbook of Process Algebra, Chapter 1, Citeseer, 2001.
|
Formal Systems Europe. Ltd, "Failures-divergence refinement, FDR2 user manual", available at http://www.fsel.com/documentation/ fdr2, 2010.
|
T. Gibson-Robinson, P. Armstrong, A. Boulgakov and A.W. Roscoe, "FDR3A modern refinement checker for CSP", Tools and Algorithms for the Construction and Analysis of Systems, Springer, pp.187-201, 2014.
|
M. Butler and M. Leuschel, "Combining CSP and B for specification and property verification", FM 2005: Formal Methods, Springer, pp.221-236, 2005.
|
V. Korolev, A. Joshi, V. Korolev, et al., "PROB: A tool for tracking provenance and reproducibility of big data experiments", Reproduce'14. HPCA 2014, Vol.11, pp.264-286, 2014.
|
R. Milner, "Communication and concurrency", Prentice Hall New York etc., 1989.
|