Skip to main content
Conference Proceedings

Blocage et vivacité dans les réseaux a pile-file

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1984) 166 LNCS 151-162
DOI: 10.1007/3-540-12920-0_14
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that under certain structural conditions in a finite biparti valued graph the absence of local deadlock is equivalent to the possibility for the system to have an infinite behaviour.

Cite

CITATION STYLE

APA

Finkel, A. (1984). Blocage et vivacité dans les réseaux a pile-file. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 166 LNCS, pp. 151–162). Springer Verlag. https://doi.org/10.1007/3-540-12920-0_14

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