A polynomial algorithm for deciding bisimilarity of normed context-free processes
Authors:
- 20 May 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 158 (1-2) , 143-159
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel ProcessesMathematical Structures in Computer Science, 1996
- Deciding bisimilarity of normed context-free processes is in Σp2Theoretical Computer Science, 1994
- Decidability questions for bisimilarity of Petri nets and some related problemsLecture Notes in Computer Science, 1994
- Decidability of bisimulation equivalence for process generating context-free languagesJournal of the ACM, 1993
- A fast algorithm to decide on the equivalence of stateless DPDARAIRO - Theoretical Informatics and Applications, 1993
- Unique decomposition of processesTheoretical Computer Science, 1993
- Graphes canoniques de graphes algébriquesRAIRO - Theoretical Informatics and Applications, 1990
- Algebra of communicating processes with abstractionTheoretical Computer Science, 1985
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976