Communicating sequential processes
Communicating sequential processes
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Specification-oriented semantics for communicating processes
Acta Informatica
Extensional equivalence for transition systems
Acta Informatica
Communication and concurrency
A classical mind
The Unified Modeling Language reference manual
The Unified Modeling Language reference manual
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Combining Independent Specifications
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
A uniform mathematical theory for real-time distributed computing
A uniform mathematical theory for real-time distributed computing
On the automatic verification of non-standard measures of consistency
IWFM'03 Proceedings of the 6th international conference on Formal Methods
Relational Concurrent Refinement with Internal Operations
Electronic Notes in Theoretical Computer Science (ENTCS)
Taking our own medicine: applying the refinement calculus to state-rich refinement model checking
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
CSP-based counter abstraction for systems with node identifiers
Science of Computer Programming
| Hi-index | 0.00 |
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.In this paper, we begin by motivating the need for alternative measures of consistency. We then identify the failures class-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.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.