Abstract
Place/Transactor nets, or P/Ta-nets for short, are a special development of Petri nets. Their prominent feature is a change of second order: The token flow as the change of the contents of places (first order change of states) is well-known from other net models; in P/Ta-nets we have on top of that a variation of the intensity of every flow (a change of second order), depending on the contents of some selected Places. Such Places, so-called K-Places, are adjoined like an inscription to every flow arc. P/Ta-nets are described in detail, as well as their (historical) background, and their significance for numerical simulations. Some examples of programming with P/Ta-nets in the field of applications are given. Relations to other types of nets are sketched, and some general causal features in simulation, especially on the use of random numbers, are reflected.
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.
References
S. Drees/ D. Gomm/ H. Plünnecke/ W. Reisig/ R. Walter: Bibliography of Net Theory. 101 p. Arbeitspapiere der GMD No. 212; GMD (1986)
E. Pless/ H. Plünnecke: A Bibliography of Net Theory, 2nd Ed., GMD Report ISF-80.05 (1980)
E. Best/ C. Fernández: Notations and Terminology on Petri Nets. Arbeitspap. d.GMD No. 195 (1986)
H. Fuss: P-Ta-Netze zur Simulation von asynchronen Flüssen. in: LNCS 26, pp.326–335 (1975)
H. Fuss: AFMG — Ein asynchroner Fluss-Modell-Generator. Berichte d. GMD 100. GMD (1975)
H. Fuss: Abbildungen zwischen Puffer-Transaktions-Netzen und einfacheren Netzen. Techn. Report ISF. GMD (1981)
H. Fuss: Reversal Simulation with Place-Transactor-Nets. in: H. Wedde (Ed.): Adequate Modeling of Systems. Proc. Int. Working Conf. on Model Realism, pp.222–232, Springer (1983)
H. Fuss: Improvement of Simulations by Place-Transactor-Nets. in A. Jávor (Ed.) Simulation in Research and Development, pp.85–91 IMACS. N. Holland (1985)
H. Fuss: Simulating ‘Fair’ Random Numbers. in: Proc. 2.Eur. Sim. Congr., pp.252–257, SCS (1986)
D. Jefferson: Virtual Time. in: ACM Transact. Progr. Lang. & Syst., Vol.7, No.3, pp.404–425 (1985)
W. Krelle/ D. Beckerhoff/ H. Langer/ H. Fuss: Ein Prognosesystem für die wirtschaftliche Entwicklung der Bundesrepublik Deutschland. 355 S. A. Hain, Meisenheim/Glahn (1969)
A. Maggiolo-Schettini/ H. Wedde/ J. Winkowski: Modeling a Solution for a Control Problem in Distributed Systems by Restrictions. TCS 13, pp.61–83, N. Holl. (1981)
C.A. Petri: General Net Theory. in: B. Shaw (Ed.): Computing System Design, pp.131–170, Univ. Newcastle/Tyne (1976)
C.A. Petri: Concurrency. in: LNCS 84, pp.251–260; Springer 1980
C.A. Petri: Concurrency Theory. in: Advanced Course on Petri Nets (Sept.’86) Bad Honnef, pp.1–21 (Preprints as course material to the participants, GMD (1986); proceedings to appear at Springer 1987)
P. Reynolds (Ed.) Distributed Simulation 1985, Proceedings, 111p. SCS Simulation Series Vol.15, No.2, Simulation Councils Inc. (1985)
R. Valk: Self-Modifying Nets, a Natural Extension of Petri Nets. pp.464–476 in: LNCS 62, (1978)
K. Voss: Using Predicate/Transition-Nets to Model and Analyze Distributed Database Systems. Transact. on Softw. Engin., Vol.Se-6, pp.539–544. IEEE 1980
H. Wedde: Lose Kopplung von System-Komponenten. Berichte d. GMD 96; GMD (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fuss, H. (1987). Numerical Simulations with Place/Transactor-Nets. In: Voss, K., Genrich, H.J., Rozenberg, G. (eds) Concurrency and Nets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72822-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-72822-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-72824-2
Online ISBN: 978-3-642-72822-8
eBook Packages: Springer Book Archive