Report
An Algebraic Theory of Interface Automata
- Abstract:
-
We formulate a compositional specification theory for interface automata, where a component model specifies the allowed sequences of input and output interactions with the environment. A trace-based linear-time refinement is provided, which is the weakest preorder preserving substitutivity of components, and is weaker than the classical alternating simulation defined on interface automata. Since our refinement allows a component to be refined by refusing to produce any output, we also define ...
Expand abstract
Actions
Authors
Bibliographic Details
- Publisher:
- DCS
- Publication date:
- 2013-01-01
Item Description
- UUID:
-
uuid:f5c78dc5-47e9-4b06-aa4c-26dc8e3b4250
- Local pid:
- cs:6522
- Deposit date:
- 2015-03-31
Terms of use
- Copyright date:
- 2013
If you are the owner of this record, you can report an update to it here: Report update to this record