A Context-Free Process as a Pushdown Automaton

DOI10.1007/978-3-540-85361-9_11zbMATH Open1160.68452OpenAlexW1584306444MaRDI QIDQ3541013FDOQ3541013

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

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

Recommendations

• A basic parallel process as a parallel pushdown automaton
• scientific article; zbMATH DE number 794257
• scientific article; zbMATH DE number 59504
• A mechanisation of some context-free language theory in HOL4
• A process-theoretic look at automata

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

• Structural operational semantics.
• Process algebra for synchronous communication
• Branching time and abstraction in bisimulation semantics
• Process Algebra
• On the consistency of Koomen's fair abstraction rule
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• Infinite results
• Impossible futures and determinism
• Title not available (Why is that?)
• Algebraic process verification.
• Decidability of bisimulation equivalence for process generating context-free languages
• CONCUR 2005 – Concurrency Theory
• Title not available (Why is that?)

Cited In (9)

• A basic parallel process as a parallel pushdown automaton
• A process-theoretic look at automata
• Mechanisation of PDA and grammar equivalence for context-free languages
• Characterizing contrasimilarity through games, modal logic, and complexity
• A game characterization for contrasimilarity
• Sequential composition in the presence of intermediate termination (extended abstract)
• The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
• Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
• Pushdown Automata and Context-Free Grammars in Bisimulation Semantics

This page was built for publication: A Context-Free Process as a Pushdown Automaton

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