Communicating sequential processes
Communicating sequential processes
Proc. of the European symposium on programming on ESOP 86
Extensional equivalence for transition systems
Acta Informatica
Observation equivalence as a testing equivalence
Theoretical Computer Science
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Algebraic theory of processes
Testing equivalence as a bisimulation equivalence
Proceedings of the international workshop on Automatic verification methods for finite state systems
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Handbook of Process Algebra
Testing Equivalence for Processes
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Weakest-Congruence Results for Livelock-Preserving Equivalences
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
The Linear Time-Branching Time Spectrum (Extended Abstract)
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
An Approach to the Design of Distributed Systems with B AMN
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
Refinement in Object-Z and CSP
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Relational Concurrent Refinement with Internal Operations
Electronic Notes in Theoretical Computer Science (ENTCS)
More Relational Concurrent Refinement: Traces and Partial Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Data refinement and singleton failures refinement are not equivalent
Formal Aspects of Computing
Relational concurrent refinement part II: Internal operations and outputs
Formal Aspects of Computing
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Relational Concurrent Refinement: Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational concurrent refinement: timed refinement
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
| Hi-index | 0.00 |
An integration of state-based and behavioural formalisms can be obtained by imposing a concurrency semantics on a relational formalism. The data refinement theory for relational languages then provides a method for verifying the concurrent refinement relation. In this paper we investigate how divergence can be modelled relationally, and in particular show how differing process algebraic interpretations of divergence can be embedded in a relational framework. In doing so we derive relational simulation conditions for process algebraic refinement incorporating divergence.