Reflections on a Geometry of Processes
From MaRDI portal
Publication:5262964
DOI10.1016/J.ENTCS.2005.12.111zbMath1316.68092OpenAlexW2157938157MaRDI QIDQ5262964
Bas Luttik, Jan Willem Klop, Clemens Grabmayer
Publication date: 10 July 2015
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.2005.12.111
Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- On the regular structure of prefix rewriting
- The theory of ends, pushdown automata, and second-order logic
- A short proof of the decidability of bisimulation for normed BPA- processes
- Bisimulation equivalence is decidable for all context-free processes
- Decidability of bisimulation equivalence for process generating context-free languages
- Graphes canoniques de graphes algébriques
- Process Algebra
- Bisimulation collapse and the process taxonomy
This page was built for publication: Reflections on a Geometry of Processes