Reflections on a Geometry of Processes

DOI10.1016/J.ENTCS.2005.12.111zbMATH Open1316.68092OpenAlexW2157938157MaRDI QIDQ5262964FDOQ5262964

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

zbMATH Keywords

geometryperiodicityprocess algebraqueuestackbagprocess graph

Mathematics Subject Classification ID

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

• Process Algebra
• Title not available (Why is that?)
• Bisimulation collapse and the process taxonomy
• The theory of ends, pushdown automata, and second-order logic
• Bisimulation equivalence is decidable for all context-free processes
• Graphes canoniques de graphes algébriques
• Decidability of bisimulation equivalence for process generating context-free languages
• On the regular structure of prefix rewriting
• A short proof of the decidability of bisimulation for normed BPA- processes
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Reflections on a Geometry of Processes

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