On the power of bounded concurrency I

DOI10.1145/176584.176587zbMath0813.68138OpenAlexW2107552120MaRDI QIDQ4305671

Doron Drusinsky, David Harel

Publication date: 13 October 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/176584.176587

zbMATH Keywords

Petri netssuccinctnessstatechartsomega-automatabounded cooperative concurrencydeterministic concurrent automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (22)

Concurrency in timed automata ⋮ Complexity results for two-way and multi-pebble automata and their logics ⋮ A survey of timed automata for the development of real-time systems ⋮ HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems ⋮ Improved model checking of hierarchical systems ⋮ Unnamed Item ⋮ Statechartable Petri nets ⋮ Hierarchical Network Formation Games ⋮ Embedding finite automata within regular expressions ⋮ On the complexity of verifying concurrent transition systems ⋮ Monotonic hybrid systems ⋮ A Parametrized Analysis of Algorithms on Hierarchical Graphs ⋮ A Rice-style theorem for parallel automata ⋮ Program repair without regret ⋮ Parameterized Complexity Results for 1-safe Petri Nets ⋮ \(\varepsilon\)-transitions in concurrent timed automata ⋮ \( \omega \)-automata ⋮ Alternating finite automata and star-free languages ⋮ Alternation and bounded concurrency are reverse equivalent. ⋮ On the complexity of verifying concurrent transition systems ⋮ Is your model checker on time? On the complexity of model checking for timed modal logics ⋮ Concise representations of regular languages by degree and probabilistic finite automata

This page was built for publication: On the power of bounded concurrency I