Output details
11 - Computer Science and Informatics
University of Kent
Article title
Incompleteness of Relational Simulations in the Blocking Paradigm
Type
D - Journal article
Title of journal
Science of Computer Programming
Article number
-
Volume number
75
Issue number
-
First page of article
182
ISSN of journal
0167-6423
Year of publication
2010
Number of additional authors
1
Additional information
<07> In the use of state-based formalisms like Z for distributed systems, the blocking paradigm has been used as an alternative refinement semantics for Z since the 1980s. The “obvious” simulation rules had been derived for this in the 1990s, and published and proved complete in 2001. This paper is the first to contradict this and show these rules are incomplete, pointing out the cause of this and the error in the 2001 proof. This provides a foundational reason for state-based formalisms with a behavioural interpretation, such as in model-based development, to take CSP as the basis of their semantics.
Interdisciplinary
-
Cross-referral requested
-
Research group
P - Programming Languages and Systems Group
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
