Show simple item record  

dc.contributor.authorMalik, Robi
dc.contributor.authorStreader, David
dc.contributor.authorReeves, Steve
dc.coverage.spatialConference held at Taipei, Taiwanen_NZ
dc.identifier.citationMalik, R., Streader, D. & Reeves, S. (2004). Fair testing revisited: A process-algebraic characterisation of conflicts. In F. Wang(Ed.), Proceedings of Second International Conference, ATVA 2004, Taipei, Taiwan, ROC, October 31-November 3, 2004. (pp. 120-134). Berlin: Springer.en_US
dc.description.abstractThis paper studies conflicts from a process-algebraic point of view and shows how they are related to the testing theory of fair testing. Conflicts have been introduced in the context of discrete event systems, where two concurrent systems are said to be in conflict if they can get trapped in a situation where they are waiting or running endlessly, forever unable to complete their common task. In order to analyse complex discrete event systems, conflict-preserving notions of refinement and equivalence are needed. This paper characterises an appropriate refinement, called the conflict preorder, and provides a denotational semantics for it. Its relationship to other known process preorders is explored, and it is shown to generalise the fair testing preorder in process-algebra for reasoning about conflicts in discrete event systems.en_US
dc.publisherSpringer, Berlinen_US
dc.sourceATVA 2004en_NZ
dc.subjectcomputer scienceen_US
dc.subjectfair testingen_US
dc.titleFair testing revisited: A process-algebraic characterisation of conflictsen_US
dc.typeConference Contributionen_US
dc.relation.isPartOf2nd International Symposium on Automated Technology for Verification and Analysisen_NZ
pubs.finish-date2004-11-03en_NZ, Germanyen_NZ
pubs.volumeLNCS 3299en_NZ

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record