Abstract
The representation of a detailed model by one with less detail, but preserving input/output behavior, is an essential element in understanding, designing, and analyzing large systems. This paper presents a mechanizable approach to such abstraction, for a limited class of net models. The work is based on Pro-Nets, an application-oriented outgrowth of place/transition nets.
This work was jointly supported by NSF Grant No. MCS77-22819, by the University of Washington, and by the Nederlandse Organisatie voor Zuiver - Wetenschappelijk Onderzoek (the ZWO).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Horning, J.J., Randell, B. "Process Structuring", Computing Surveys, V. 5, No. 1, Mar. 1973, pp. 5–30.
Karp, R.M., Miller, R.E. "Parallel program schemata: a mathematical model for parallel computation", IEEE Conf. Record, 8th Annual Symp. on Switching and Automata Theory, Oct. 1967, pp. 55–61.
Keller, R.M. "Vector replacement systems: a formalism for modeling asynchronous systems", TR 117, Comp. Sci. Lab, Princeton Univ., Dec. 1972.
___ "Towards a theory of universal speed-independent modules", IEEE TR Comp, Jan. 1974, pp. 21–33.
Noe, J.D. "Abstraction Levels with Pro Nets: An Algorithm and Examples". TR 77-03-01, revised 9/12/77, Dept. of Computer Science, Univ. of Washington, Seattle, Wa. 98195.
___ "Nets in Modeling and Simulation" (In this proceeding).
Schwetman, H.D., "Hybrid Simulation Models of Computer Systems", CACM, V.21, No. 9, Sept. 1978, pp. 718–723.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Noe, J.D. (1980). Abstractions of net models. In: Brauer, W. (eds) Net Theory and Applications. Lecture Notes in Computer Science, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10001-6_33
Download citation
DOI: https://doi.org/10.1007/3-540-10001-6_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10001-0
Online ISBN: 978-3-540-39322-1
eBook Packages: Springer Book Archive