From post

A Paradigm for Detecting Quiescent Properties in Distributed Computations.

, и . Logics and Models of Concurrent Systems, том 13 из NATO ASI Series, стр. 325-341. Springer, (1984)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

A Distributed Graph Algorithm: Knot Detection., и . ACM Trans. Program. Lang. Syst., 4 (4): 678-686 (1982)Distributed Deadlock Detection, , и . ACM Trans. Comput. Syst., 1 (2): 144-156 (1983)A Linear Tree Partitioning Algorithm., и . SIAM J. Comput., 6 (1): 151-154 (1977)Verified Software: Theories, Tools, Experiments Vision of a Grand Challenge Project., и . VSTTE, том 4171 из Lecture Notes in Computer Science, стр. 1-18. Springer, (2005)Active and Concurrent Topology Maintenance., , и . DISC, том 3274 из Lecture Notes in Computer Science, стр. 320-334. Springer, (2004)A Denotational Semantic Theory of Concurrent Systems.. Logic, Rewriting, and Concurrency, том 9200 из Lecture Notes in Computer Science, стр. 493-518. Springer, (2015)A principle of algorithm design on limited problem domain.. DAC, стр. 479-483. ACM, (1976)Toward a theory of maximally concurrent programs (shortened version)., и . PODC, стр. 319-328. ACM, (2000)Workflow Patterns in Orc., , и . COORDINATION, том 4038 из Lecture Notes in Computer Science, стр. 82-96. Springer, (2006)A nontrivial example of concurrent processing: Distributed simulation., и . COMPSAC, стр. 822-826. IEEE, (1978)