A hierarchy of failures-based models: theory and application
<p>Consistency between a process and its specification expressed in CSP is typically presented as a refinement check. Within the traces model consistency is measured by examining only the traces of the systems, whilst in the finer stable failures model the possibility of subsequently refusing...
| Hoofdauteurs: | , |
|---|---|
| Formaat: | Journal article |
| Taal: | English |
| Gepubliceerd in: |
Elsevier
2005
|
| Onderwerpen: |
| _version_ | 1826282218955210752 |
|---|---|
| author | Bolton, C Lowe, G |
| author_facet | Bolton, C Lowe, G |
| author_sort | Bolton, C |
| collection | OXFORD |
| description | <p>Consistency between a process and its specification expressed in CSP is typically presented as a refinement check. Within the traces model consistency is measured by examining only the traces of the systems, whilst in the finer stable failures model the possibility of subsequently refusing a combination of events is also taken into consideration.</p> <p>In this paper, we begin by motivating the need for alternative measures of consistency. We then identify the <em>failures class</em>—a class of semantic models for describing concurrent systems in which each model is associated with a predicate that determines how much availability information is recorded. We show how refinement within members of this class corresponds to confirmation of non-standard measures of consistency, and identify application areas for these measures of consistency. We show how refinement in each model can be automatically tested.</p> <p>We also carry out a theoretical examination of the failures class. We prove that the class forms a complete lattice, and investigate the positions of particular models within that lattice. We also identify the maximal subset of the language over which each model is compositional.</p> |
| first_indexed | 2024-03-07T00:40:32Z |
| format | Journal article |
| id | oxford-uuid:82dec6d7-8250-4f9f-87d0-335447bf6b8c |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T00:40:32Z |
| publishDate | 2005 |
| publisher | Elsevier |
| record_format | dspace |
| spelling | oxford-uuid:82dec6d7-8250-4f9f-87d0-335447bf6b8c2022-03-26T21:40:27ZA hierarchy of failures-based models: theory and applicationJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:82dec6d7-8250-4f9f-87d0-335447bf6b8cTheory and automated verificationCommunication Sequential Processing (CSP)Computer science (mathematics)EnglishOxford University Research Archive - ValetElsevier2005Bolton, CLowe, G<p>Consistency between a process and its specification expressed in CSP is typically presented as a refinement check. Within the traces model consistency is measured by examining only the traces of the systems, whilst in the finer stable failures model the possibility of subsequently refusing a combination of events is also taken into consideration.</p> <p>In this paper, we begin by motivating the need for alternative measures of consistency. We then identify the <em>failures class</em>—a class of semantic models for describing concurrent systems in which each model is associated with a predicate that determines how much availability information is recorded. We show how refinement within members of this class corresponds to confirmation of non-standard measures of consistency, and identify application areas for these measures of consistency. We show how refinement in each model can be automatically tested.</p> <p>We also carry out a theoretical examination of the failures class. We prove that the class forms a complete lattice, and investigate the positions of particular models within that lattice. We also identify the maximal subset of the language over which each model is compositional.</p> |
| spellingShingle | Theory and automated verification Communication Sequential Processing (CSP) Computer science (mathematics) Bolton, C Lowe, G A hierarchy of failures-based models: theory and application |
| title | A hierarchy of failures-based models: theory and application |
| title_full | A hierarchy of failures-based models: theory and application |
| title_fullStr | A hierarchy of failures-based models: theory and application |
| title_full_unstemmed | A hierarchy of failures-based models: theory and application |
| title_short | A hierarchy of failures-based models: theory and application |
| title_sort | hierarchy of failures based models theory and application |
| topic | Theory and automated verification Communication Sequential Processing (CSP) Computer science (mathematics) |
| work_keys_str_mv | AT boltonc ahierarchyoffailuresbasedmodelstheoryandapplication AT loweg ahierarchyoffailuresbasedmodelstheoryandapplication AT boltonc hierarchyoffailuresbasedmodelstheoryandapplication AT loweg hierarchyoffailuresbasedmodelstheoryandapplication |