Petri nets: an introduction
Statecharts: A visual formalism for complex systems
Science of Computer Programming
On the power of cooperative concurrency
International Conference on Concurrency on Concurrency 88
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the power of bounded concurrency II: pushdown automata
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Communicating sequential processes
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Thesis for Bounded Concurrency
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
On the Power of Communication in Alternating Machines
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Complexity Results for Multi-Pebble Automata and their Logics
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
On the power of bounded concurrency II: pushdown automata
Journal of the ACM (JACM)
Executable object modeling with statecharts
Proceedings of the 18th international conference on Software engineering
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Model checking of hierarchical state machines
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Workflow, transactions and datalog
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the complexity of verifying concurrent transition systems
Information and Computation
Design of embedded systems: formal models, validation, and synthesis
Readings in hardware/software co-design
On Object Systems and Behavioral Inheritance
IEEE Transactions on Software Engineering
Timed Automata with Monotonic Activities
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Communicating Hierarchical State Machines
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Extended Temporal Logic Revisited
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Theoretical Computer Science
Flattening statecharts without explosions
Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Journal of Computer and System Sciences
Transformations of Timed Cooperating Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Statecharts in the making: a personal account
Proceedings of the third ACM SIGPLAN conference on History of programming languages
Embedding finite automata within regular expressions
Theoretical Computer Science
Viewcharts: Syntax and Semantics
Informatica
Statecharts in the making: a personal account
Communications of the ACM - Being Human in the Digital Age
A Rice-style theorem for parallel automata
Information and Computation
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
On Succinctness of Hierarchical State Diagrams in Absence of Message Passing
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Architectural design, behavior modeling and run-time verification of network embedded systems
Proceedings of the 12th Monterey conference on Reliable systems on unreliable networked platforms
Parameterized complexity results for 1-safe Petri nets
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Improved model checking of hierarchical systems
Information and Computation
Improved model checking of hierarchical systems
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Finding shortest witnesses to the nonemptiness of automata on infinite words
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
Transformations of Timed Cooperating Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Fundamenta Informaticae
A new method for describing the syntax and semantics of VIEWCHARTS
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Hi-index | 0.01 |
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 concurrent programming languages. We exhibit exhaustive sets of upper and lower bounds on the relative succinctness of these features over &Sgr;* and &Sgr;&ohgr;, establishing that:(1) Each of the three features represents an exponential saving in succinctness of the representation, in a manner that is independent of the other two and additive with respect to them.(2) Of the three, bounded concurrency is the strongest, representing a similar exponential saving even when substituted for each of the others.For example, we prove exponential upper and lower bounds on the simulation of deterministic concurrent automata by AFAs, and triple-exponential bounds on the simulation of alternating concurrent automata by DFAs.