Classical automata theory suffices for specifying and verifying concurrent digital systems, contrary to early process algebra critiques, via re-examination of 1950s-1960s methods.
Concurrency and Automata on Infinite Sequences
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Standard Automata Theory and Process Algebra
Classical automata theory suffices for specifying and verifying concurrent digital systems, contrary to early process algebra critiques, via re-examination of 1950s-1960s methods.