Skip to main content
Conference Proceedings

Reductions of nets and parallel programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1980) 84 LNCS 277-290
DOI: 10.1007/3-540-10001-6_28
23Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Berthelot, G., Roucairol, G., & Valk, R. (1980). Reductions of nets and parallel programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 84 LNCS, pp. 277–290). Springer Verlag. https://doi.org/10.1007/3-540-10001-6_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free