Abstract
The one-way behaviour we are studying here is “half” of the standard input-output behaviour. The latter is defined in terms of input-output paths, while the former uses all finite and infinite paths connecting one of the network interfaces. Actually, there are two dual versions of the one-way behaviour: the input behaviour,which considers all paths starting from the network’s inputs, and the output behaviour, which takes into account all the paths arriving at the network’s outputs.
Those who write clearly have readers; those who write obscurely have commentators.
Albert Camus
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag London
About this chapter
Cite this chapter
Ştefănescu, G. (2000). Elgot theories. In: Network Algebra. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0479-7_6
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0479-7_6
Publisher Name: Springer, London
Print ISBN: 978-1-85233-195-5
Online ISBN: 978-1-4471-0479-7
eBook Packages: Springer Book Archive