Abstractions of net models
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.
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- Keller, R.M. "Vector replacement systems: a formalism for modeling asynchronous systems", TR 117, Comp. Sci. Lab, Princeton Univ., Dec. 1972.Google Scholar
- ___ "Towards a theory of universal speed-independent modules", IEEE TR Comp, Jan. 1974, pp. 21–33.Google Scholar
- 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.Google Scholar
- ___ "Nets in Modeling and Simulation" (In this proceeding).Google Scholar
- Schwetman, H.D., "Hybrid Simulation Models of Computer Systems", CACM, V.21, No. 9, Sept. 1978, pp. 718–723.Google Scholar