Elsevier

Theoretical Computer Science

Volume 597, 13 September 2015, Pages 18-39
Theoretical Computer Science

Error-pruning in interface automata☆

https://doi.org/10.1016/j.tcs.2015.06.047Get rights and content
Under an Elsevier user license
open archive

Abstract

De Alfaro and Henzinger introduced interface automata to model and study behavioural types. These come with alternating simulation as refinement and with a specific parallel composition: if one component receives an unexpected input, this is regarded as an error and the resp. error states are removed with a special pruning operation. In this paper, we return to the foundations of interface automata and study how refinement and parallel composition should be defined best.

We take as basic requirement that an implementation must be error-free, if the specification is. For three variants of error-free, we consider the coarsest precongruence for parallel composition respecting the basic requirement. We find that pruning proves to be relevant in all cases and point out an important subtlety for systems that are not input-deterministic.

Keywords

Concurrency
Interface automata
Parallel composition
Optimistic/pessimistic approach
Fully abstract precongruence

Cited by (0)

☆

This research was supported by DFG-project 'Foundations of Heterogenous Specifications Using State Machines and Temporal Logic' VO 615/12-1. An extended abstract with the same title has appeared in SOFSEM 2014, LNCS 8327, pp. 162–173.

Copyright © 2015 Elsevier B.V. All rights reserved.