2001
DOI: 10.1016/s0304-3975(00)00169-9
|View full text |Cite
|
Sign up to set email alerts
|

Refinement and state machine abstraction

Abstract: Most SVRC technical reports are available via anonymous ftp, from svrc.it.uq.edu.au in the directory /pub/techreports. Abstracts and compressed postscript les are available via http://svrc.it.uq.edu.au

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
12
0

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(13 citation statements)
references
References 16 publications
1
12
0
Order By: Relevance
“…In [10], a refinement semantics is presented for so-called demonic specifications that lifts the refinement of operations defined in formal specifiation languages such as Z and VDM to the refinement of state machines. The semantics is consistent with the conventional refinement semantics for the system underlying a specification in Z [14].…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…In [10], a refinement semantics is presented for so-called demonic specifications that lifts the refinement of operations defined in formal specifiation languages such as Z and VDM to the refinement of state machines. The semantics is consistent with the conventional refinement semantics for the system underlying a specification in Z [14].…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we build on the relational approach of [10] to further investigate the completeness of refinement. As refinement semantics we will use the partial ordering on prefix-closed and demonic languages introduced in [10].…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations