Abstract
Reductions of concurrent systems reduce the degree of parallelism by introducing indivisible sequences of operations, which reduces the complexity of the system. If fundamental properties are preserved, this method simplifies analysis and verification. Reductions are given for transition systems, place/transition nets and parallel programs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berthelot, G., Roucairol, G.: Reduction of Petri Nets. in: Proc. of the Symp. on MFCS 76, Lect. Notes in Computer Sci. 45, pp 202–209, Springer Berlin, (1976).
Berthelot, G.: Verification de réseaux de Petri. Thèse de 3° cycle, Institut de Programmation, Univ. Paris 6, (1978).
Berthelot, G.: Preuves de non-blocage de programmes paralléles par reduction de réseaux de Petri. in: Proc. of the 1st European Conference on Parallel and Distributed Processing, J.C.Syre ed., CEPADUES publ., (1979)
Byrn, W.H.: Sequential Processes, Deadlocks, and Semaphore Primitives. TR7-75, Havard Univ., Cambridge, Mass., (1975).
Cotronis, J.Y., Lauer, P.E.: Verification of Concurrent Systems of Processes. in: Proc. of the International Computing Symposium 1977, Liège; (1977).
Dadda, L.: The Synthesis of Petri Nets for Controlling Purposes and the Reduction of their Complexity. in: Proc. of the EUROMICRO Conf. North-Holland pub., (1976).
Gostelow, K., Gerf, V.G., Estrin, G., Volansky, S.,: Proper Termination of Flow of Control in Programs involving Concurrent Processes. SIGPLAN Notices 7,11,72 (1972).
Jantzen,M., Valk,R.: Formal Properties of Place Transition Nets. in: these Proceedings.
Keller, R.M.: A Fundamental Theorem of Asynchronous Parallel Computation. in: Parallel Processing, Lecture Notes in Computer Sci., 24, pp 102–112, Springer, Berlin, (1975).
Kowalk, W., Valk, R.: On Reductions of Parallel Programs. in: Automata, Languages and Programming, Lecture Notes in Computer Sci. 71, pp 356–369, Springer, Berlin, (1979).
Kwong, Y.S.: On Reduction of Asynchronous Systems., Theor. Computer Sci. 5, pp 25–50, (1977).
Lipton, R.J.: Reduction: A Method of Proving Properties of Parallel Programs, Comm. ACM 18, pp 717–721, (1975).
Memmi, G., Roucairol, G.: Linear Algebra in Net Theory. in: these Proceedings.
Owicki, S., Gries, P.: An Axiomatic Proof Technique for Parallel Programs I. Acta Informatica 6, pp319–340, (1976).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berthelot, G., Roucairol, G., Valk, R. (1980). Reductions of nets and parallel programs. 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_28
Download citation
DOI: https://doi.org/10.1007/3-540-10001-6_28
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