## On the Relationship Between Process Algebra and Input/Output Automata (Extended Abstract) (1991)

Venue: | In Proceedings 6 th Annual Symposium on Logic in Computer Science |

Citations: | 42 - 1 self |

### BibTeX

@INPROCEEDINGS{Vaandrager91onthe,

author = {Frits W. Vaandrager},

title = {On the Relationship Between Process Algebra and Input/Output Automata (Extended Abstract)},

booktitle = {In Proceedings 6 th Annual Symposium on Logic in Computer Science},

year = {1991},

pages = {387--398},

publisher = {IEEE Computer Society Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

) Frits W. Vaandrager MIT Laboratory for Computer Science Cambridge, MA 02139, USA frits@theory.lcs.mit.edu Abstract The relation between process algebra and I/O automata models is investigated in a general setting of structured operational semantics (SOS). For a series of (approximations of) key properties of I/O automata, syntactic constraints on inference rules are proposed which guarantee these properties. A first result is that, in a setting without assumptions about actions, the well-known trace and failure preorders are substitutive for any set of rules in a format due to De Simone. Next additional constraints are imposed which capture the notion of internal actions and guarantee substitutivity of the testing preorders of De Nicola and Hennessy, and also of a preorder related to the failure semantics with fair abstraction of unstable divergence of Bergstra, Klop and Olderog. Subsequent constraints guarantee that input actions are always enabled and output actions cannot be bl...

### Citations

200 |
Bisimulation canâ€™t be traced
- Bloom, Istrail, et al.
- 1995
(Show Context)
Citation Context ...to start from a particular calculus (i.e. a language together with a set of inference rules) and next derive the properties of the operational semantics induced by this calculus [14, 21]. Recent work =-=[6, 7, 13, 27]-=- however shows that very strong results can be obtained if one takes the opposite approach which starts from a desired property, and then looks for the weakest syntactic constraints on calculi which g... |

113 |
Process Algebra. Cambridge Tracts in Theoretical Computer Science 18
- Baeten, Weijland
- 1990
(Show Context)
Citation Context ...given, finite action signature. This work was supported by ONR contract N00014-85-K0168. 0 1 Introduction This paper studies the relationship between the algebraic theory of processes as described in =-=[2, 14, 15, 21]-=- and the input/output automata models of [16, 17, 19, 20, 26]. Apparently, these two formalisms for concurrent /reactive systems, process algebra and I/O models for short, have been developed on diffe... |

56 | Bisimulation can't be traced: preliminary report
- Bloom, Istrail, et al.
- 1988
(Show Context)
Citation Context ...to start from a particular calculus (i.e. a language together with a set of inference rules) and next derive the properties of the operational semantics induced by this calculus [14, 21]. Recent work =-=[6, 7, 13, 27]-=- however shows that very strong results can be obtained if one takes the opposite approach which starts from a desired property, and then looks for the weakest syntactic constraints on calculi which g... |

54 |
Permutations of transitions: an event structure semantics for CCS and SCCS
- Boudol, Castellani
- 1989
(Show Context)
Citation Context ...of trees of transitions and the leftmost term in transitions. In order to emphasize this similarity and to facilitate reasoning about proofs, a special syntax for proofs is introduced in the style of =-=[8]-=-. 4 Internal Actions All the preorders of the previous section are based on notions of observation which assume that all actions are equally visible. Often however it is realistic to assume that certa... |

46 |
Appraising fairness in languages for distributed programming
- Apt, Francez, et al.
- 1988
(Show Context)
Citation Context ...r it will be argued in detail why this notion of fairness is reasonable and useful. The following lemma, whose formulation is due to [18], implies that the fairness notion is feasible in the sense of =-=[1]-=-. Lemma 5.11. Let T be a finite execution fragment and let oe be a sequence of input actions. Then there exists a E such that T E is a fair execution and Edin(S) = oe. For nontrivial calculi like IOC ... |

22 |
Readies and failures in the algebra of communicating processes
- Bergstra, Klop, et al.
- 1988
(Show Context)
Citation Context ...der is a substitutive. These results generalize and somehow explain similar results that have been obtained previously for a large number of individual calculi in De Simone's format (see for instance =-=[10, 4]-=-). Section 4 studies certain trace and failure preorders in the presence of internal actions. The main results of this section are that the testing preorders of [11, 14] and also a preorder that is re... |

17 |
Failurs without chaos: a new process semantics for fair abstraction
- Bergstra, Klop, et al.
- 1987
(Show Context)
Citation Context ...ernal actions. The main results of this section are that the testing preorders of [11, 14] and also a preorder that is related to the failure semantics with fair abstraction of unstable divergence of =-=[3]-=- are substitutive for any De Simone calculus that satisfies certain additional constraints. These simple constraints explain very nicely why certain preorders are compositional for the operators of CS... |

9 |
Strong process equivalence in the presence of hidden moves
- Bloom
- 1990
(Show Context)
Citation Context ...R which is exactly the same except that it has a premis x i \Gamma! y i instead. As far as I know, the notion of an operator testing an argument, and also the non-blocking constraint are due to Bloom =-=[5]-=-. The notion of clearing rules occurred earlier in the work of Parrow [23] in the setting of `static' operators. My constraints are much less restrictive than the ones imposed by Parrow, since he allo... |