Structural and Behavioural Equivalences of Networks
Number of Authors: 1
1990 (English)Report (Refereed)
We define an algebraic language for networks of synchronously communicating processes. A node in the Network may have several ports; a port is either external to the whole network or connected through a link to another port. The language contains two types of operations: parallel composition of two networks, and interlinking of two external ports within a network. We interpret this language in two ways: first we give a structural semantics, where terms are mapped to graphs representing the structure of networks, and second we give a behavioural semantics, where terms are mapped to behaviour schemes. A schema corresponds to a behaviour parameterised on the behaviours of the network nodes. These semantics give rise to structural and behavioural equivalences. We compare the equivalences and give sound and complete axiomatisations.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1990, 1. , 31 p.
SICS Research Report, ISSN 0283-3638 ; R90:15
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-21348OAI: oai:DiVA.org:ri-21348DiVA: diva2:1041382
Original report number R90015. (Revised and extended version of a paper that appeared under the same title in the Proceedings of the 17th Colloquium on Automata, Languages and Programming, Warwick University, July 1990; Published as Springer Verlag LNCS 443 pages 540-552.)2016-10-312016-10-31Bibliographically approved