Abstract
We have seen that network algebra with its flexibility is able to formalize a lot of apparently unrelated models used in computer science. The present chapter is dedicated to the search for a unique model for the full software field, if possible. The basic idea is to use mixtures of network algebras with their different Cantorian or Cartesian interpretations. The resulting mixed network algebra model (MixNA) looks very promising, but many technical problems are still open.
Justice and power must be brought together, so that whatever is just may be powerful, and whatever is powerful may be just.
Blaise Pascal
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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). Mixed Network Algebra. In: Network Algebra. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0479-7_13
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0479-7_13
Publisher Name: Springer, London
Print ISBN: 978-1-85233-195-5
Online ISBN: 978-1-4471-0479-7
eBook Packages: Springer Book Archive