Counter abstraction in the CSP-FDR settingReportar como inadecuado

Counter abstraction in the CSP-FDR setting - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Reference: Tomasz Mazur and Gavin Lowe, (2009). Counter abstraction in the CSP/FDR setting. Electronic Notes in Theoretical Computer Science, 250 (1), 171–186.Citable link to this page:


Counter abstraction in the CSP/FDR setting

Abstract: In this paper we consider an adaptation of counter abstraction for the CSP/FDR setting. The technique allows us to transform a concurrent system with an unbounded number of agents into a finite-state abstraction. The systems to which the method can be applied are composed of many identical node processes that run in parallel with a controller process. Refinement checks on the abstract state machine can be performed automatically in the traces and stable failures models using the FDR model checker. We illustrate the method on an example based on a multiprocessor operating system.

Publication status:PublishedPeer Review status:Peer reviewedVersion:Publisher's version Funder: Engineering and Physical Sciences Research Council   Notes:© 2009 Elsevier B.V. Open access under CC BY-NC-ND license.

Bibliographic Details

Publisher: Elsevier

Publisher Website:

Host: Electronic Notes in Theoretical Computer Sciencesee more from them

Publication Website:

Issue Date: 2009-09

Copyright Date: 2009



Issn: 1571-0661

Urn: uuid:05a7172f-d055-4ea6-8baf-0c8d70068b8d Item Description

Type: Article: post-print;

Language: en

Version: Publisher's versionKeywords: counter abstraction model checking parameterised verification CSPSubjects: Mathematics Tiny URL: ora:9754


Autor: Tomasz Mazur - institutionUniversity of Oxford facultyMathematical, Physical and Life Sciences Division - Department of Computer



Documentos relacionados