Doron Drusinsky, David harel  Home/Search
Context Related
| wisdom.weizmann.ac...dedConcurrency.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisdom.weizmann.ac.il/~dharel/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the descriptive succinctness of three fundamental notions for modeling concurrency: nondeterminism and pure parallelism, the two facets of alternation, and bounded cooperative concurrency, whereby a system configuration consists of a bounded number of cooperating states. Our results are couched in the general framework of finite-state automata, but hold for appropriate versions of most concurrent models of computation, such as Petri nets, statecharts or finite-state versions of... (Update)
Cited by: More
Succinctness of Hierarchical State Diagrams in Absence of.. - Wasowski (2004) (Correct)
Flattening Statecharts without Explosions - Wasowski (2004) (Correct)
Concurrency Counts - Kupferman, Ta-Shma, Vardi (2001) (Correct)
Similar documents based on text: More All
0.9: Alternation and Bounded Concurrency are Reverse Equivalent - Hirst, Lewenstein (Correct)
0.7: Complexity Results for Two-Way and Multi-Pebble Automata and .. - Globerman, Harel (1996) (Correct)
0.4: Timed Cooperating Automata - Lanotte, Maggiolo-Schettini, Peron (2000) (Correct)
Related documents from co-citation: More All
15: Statecharts: A visual formalism for complex systems - Harel - 1987
10: Journal of the Association for Computing Machinery (context) - Chandra, Kozen et al. - 1981
7: Reasoning about infinite computations - Vardi, Wolper - 1994
BibTeX entry: (Update)
D. Drusinsky and D. Harel. On the power of bounded concurrency I: Finite automata. Journal of the ACM, 41(3), 517-539, 1994. http://citeseer.ist.psu.edu/drusinsky94power.html More
@article{ drusinsky94power,
author = "Doron Drusinsky and David Harel",
title = "On the Power of Bounded Concurrency {I}: {Finite} Automata",
journal = "Journal of the ACM",
volume = "41",
number = "3",
pages = "517--539",
year = "1994",
url = "citeseer.ist.psu.edu/drusinsky94power.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.wisdom.weizmann.ac.il/~dharel/SCANNED.PAPERS/): More
Propositional Dynamic Logic of Nonregular Programs - Harel, Pnueli, Stavi (1983) (Correct)
Statecharts: A Visual Formalism For Complex Systems - Harel (1987) (Correct)
Beauty is in the Genes of the Beholder - Harel, Unger, Sussman (1984) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC