A basic parallel process as a parallel pushdown automaton

DOI10.1016/J.ENTCS.2009.06.012MaRDI QIDQ5170665zbMATH OpenOpenAlexFDO

Authors P. J. A. van Tilburg, Jos C. M. Baeten, P. J. L. Cuijpers

Publication date 23 July 2014

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2009.06.012

zbMATH Keywords

automata theorybasic parallel processparallel pushdown automatonprocess algebra

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 794257
• A Context-Free Process as a Pushdown Automaton
• The regular viewpoint on PA-processes
• scientific article; zbMATH DE number 1304991
• scientific article; zbMATH DE number 2106350

Cites work

• A Context-Free Process as a Pushdown Automaton
• Branching time and abstraction in bisimulation semantics
• CONCUR 2005 – Concurrency Theory
• scientific article; zbMATH DE number 177854 (Why is no real title available?)
• Infinite results
• Process Algebra
• Process algebra for synchronous communication
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• Structural operational semantics.

Cited in

(5)

• Automate parallèle à homotopie près. I. (Concurrent process up to homotopy. I)
• Register-machine based processes
• A Context-Free Process as a Pushdown Automaton
• scientific article; zbMATH DE number 794257 (Why is no real title available?)
• Parallel pushdown automata and commutative context-free grammars in bisimulation semantics (extended abstract)

This page was built for publication: A basic parallel process as a parallel pushdown automaton

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170665)