Abstract
Place-transition nets are often used to model concurrent systems. The increase of the number of concurrent events in a system, can make the analyses unfeasable. The substitution of a subnet, modelling a subsystem, by an equivalent but simpler net, is a way to reduce the analysis complexity.
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.
Similar content being viewed by others
References
Andre.C; Armand.P; Boeri.F: Synchronic relations and application in parallel computation Digital Processes, 5, 1979,pp 99–133
Andr80]: Andre.C: Systèmes à evolutions parallèles: modélisation par réseaux de Petri à Capacité et analyse par abstraction. Thèse d’Etat, Nice, (à paraître).
Rapport Scientifique final-ATP Automatique et Robotique Décision 3278 - Nice, Février 1980.
Hack.M: Petri net languages, MIT TR-159, March 76
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andre, C. (1982). Behaviour of a Place-Transition Net on a Subset of Transitions. In: Girault, C., Reisig, W. (eds) Application and Theory of Petri Nets. Informatik-Fachberichte, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68353-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-68353-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11189-4
Online ISBN: 978-3-642-68353-4
eBook Packages: Springer Book Archive