We provide three methods of verifying concurrent systems which are tolerant of faults in their operating environment - algebraic, logical and transformational. The first is an extension of the bisimulation equivalence, the second is rooted in the Hennessy-Milner logic, and the third involves transformations of CCS processes. Based on the common semantic model of labelled transition systems, which is also used to model faults, all three methods are proved equivalent for certain classes of faults.
CITATION STYLE
Janowski, T. (1994). Fault-tolerant bisimulation and process transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 863 LNCS, pp. 373–392). Springer Verlag. https://doi.org/10.1007/3-540-58468-4_174
Mendeley helps you to discover research relevant for your work.