Janowski, Tomasz (1994) Fault-tolerant bisimulation and process transformations. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)

Preview

PDF (Department of Computer Science Research Report) WRAP_cs-rr-270.pdf - Other - Requires a PDF viewer. Download (385Kb) | Preview

Request Changes to record.

Abstract

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.

Item Type:	Report
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH):	Fault-tolerant computing, Computer multitasking -- Mathematical models, Computer systems -- Verification
Series Name:	Department of Computer Science research report
Publisher:	University of Warwick. Department of Computer Science
Official Date:	1994
Dates:	Date Event 1994 Completion
Number:	Number 270
Number of Pages:	27
DOI:	CS-RR-270
Institution:	University of Warwick
Theses Department:	Department of Computer Science
Status:	Not Peer Reviewed
Publication Status:	Unpublished
Funder:	University of Warwick, Overseas Research Students Awards Scheme (ORSAS)
Related URLs:	Organisation

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads