Communicating sequential processes
Communicating sequential processes
A timed model for communicating sequential processes
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Proc. of the European symposium on programming on ESOP 86
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Fixed points without completeness
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Forward and backward simulations I.: untimed systems
Information and Computation
Forward and backward simulations II.: timing-based systems
Information and Computation
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Timewise refinement for communicating processes
Science of Computer Programming
ACM SIGSOFT Software Engineering Notes
The timed failures-stability model for CSP
Theoretical Computer Science
Communication and Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Handbook of Process Algebra
Timewise Refinement for Communicating Processes
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
An Overview and Synthesis on Timed Process Algebras
Proceedings of the Real-Time: Theory in Practice, REX Workshop
A uniform mathematical theory for real-time distributed computing
A uniform mathematical theory for real-time distributed computing
More Relational Concurrent Refinement: Traces and Partial Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational concurrent refinement part II: Internal operations and outputs
Formal Aspects of Computing
Modelling Divergence in Relational Concurrent Refinement
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Relational Concurrent Refinement: Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Data refinement in a state-based language such as Z is defined using a relational model in terms of the behaviour of abstract programs. Downward and upward simulation conditions form a sound and jointly complete methodology to verify relational data refinements, which can be checked on an event-by-event basis rather than per trace. In models of concurrency, refinement is often defined in terms of sets of observations, which can include the events a system is prepared to accept or refuse, or depend on explicit properties of states and transitions. By embedding such concurrent semantics into a relational one, eventwise verification methods for such refinement relations can be derived. In this paper we continue our program of deriving simulation conditions for process algebraic refinement by considering how notions of time should be embedded into a relational model, and thereby deriving relational notions of timed refinement.