Graphes canoniques de graphes algébriques
From MaRDI portal
Publication:3479542
DOI10.1051/ita/1990240403391zbMath0701.68082OpenAlexW1499210811MaRDI QIDQ3479542
Publication date: 1990
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92362
Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Related Items
A note on the complexity of deciding bisimilarity of normed unary processes ⋮ A polynomial algorithm for deciding bisimilarity of normed context-free processes ⋮ An equational axiomatization for multi-exit iteration ⋮ An experimental ambiguity detection tool ⋮ A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ On the decidability of process equivalences for the π-calculus ⋮ Infinite results ⋮ Bisimulation collapse and the process taxonomy ⋮ The complexity of bisimilarity-checking for one-counter processes. ⋮ Deciding Bisimilarity of Full BPA Processes Locally ⋮ Unnamed Item ⋮ On deciding some equivalences for concurrent processes ⋮ Decidability of bisimulation equivalence for normed pushdown processes ⋮ A short proof of the decidability of bisimulation for normed BPA- processes ⋮ A general account of coinduction up-to ⋮ Pushdown automata, multiset automata, and Petri nets ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes ⋮ Decidability of performance equivalence for basic parallel processes ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time ⋮ A note on an expressiveness hierarchy for multi-exit iteration ⋮ Decidability of bisimulation equivalence for normed pushdown processes ⋮ Reflections on a Geometry of Processes ⋮ Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
Cites Work
