A Context-Free Process as a Pushdown Automaton
From MaRDI portal
Publication:3541013
DOI10.1007/978-3-540-85361-9_11zbMath1160.68452OpenAlexW1584306444MaRDI QIDQ3541013
P. J. A. van Tilburg, Pieter J. L. Cuijpers, Jos C. M. Baeten
Publication date: 25 November 2008
Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85361-9_11
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (5)
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity ⋮ A Basic Parallel Process as a Parallel Pushdown Automaton
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the consistency of Koomen's fair abstraction rule
- Impossible futures and determinism
- Decidability of bisimulation equivalence for process generating context-free languages
- Process algebra for synchronous communication
- Process Algebra
- Branching time and abstraction in bisimulation semantics
- CONCUR 2005 – Concurrency Theory
- Infinite results
This page was built for publication: A Context-Free Process as a Pushdown Automaton