A Basic Parallel Process as a Parallel Pushdown Automaton

DOI10.1016/j.entcs.2009.06.012zbMath1291.68276OpenAlexW2136323078MaRDI QIDQ5170665

P. J. A. van Tilburg, Jos C. M. Baeten, Pieter 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 theoryprocess algebrabasic parallel processparallel pushdown automaton

Mathematics Subject Classification ID

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

Cites Work

• A Context-Free Process as a Pushdown Automaton
• Process algebra for synchronous communication
• Process Algebra
• Branching time and abstraction in bisimulation semantics
• CONCUR 2005 – Concurrency Theory
• Infinite results
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Basic Parallel Process as a Parallel Pushdown Automaton