Graphes canoniques de graphes algébriques
RAIRO-Theor. Inf. Appl., 24 4 (1990) 339-352
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
Antonín Kučera and Richard MayrJournal of Computer and System Sciences 91 82 (2018)
https://doi.org/10.1016/j.jcss.2017.09.004
A general account of coinduction up-to
Filippo Bonchi, Daniela Petrişan, Damien Pous and Jurriaan RotActa Informatica 54 (2) 127 (2017)
https://doi.org/10.1007/s00236-016-0271-4
An experimental ambiguity detection tool
Sylvain SchmitzScience of Computer Programming 75 (1-2) 71 (2010)
https://doi.org/10.1016/j.scico.2009.07.002
Decidability of Weak Bisimilarity for a Subset of BPA
Haiyan ChenElectronic Notes in Theoretical Computer Science 212 241 (2008)
https://doi.org/10.1016/j.entcs.2008.04.065
An Experimental Ambiguity Detection Tool
Sylvain SchmitzElectronic Notes in Theoretical Computer Science 203 (2) 69 (2008)
https://doi.org/10.1016/j.entcs.2008.03.045
Formal Methods and Hybrid Real-Time Systems
Xinxin LiuLecture Notes in Computer Science, Formal Methods and Hybrid Real-Time Systems 4700 472 (2007)
https://doi.org/10.1007/978-3-540-75221-9_22
Decidability of performance equivalence for basic parallel processes
Sławomir LasotaTheoretical Computer Science 360 (1-3) 172 (2006)
https://doi.org/10.1016/j.tcs.2006.02.020
Reflections on a Geometry of Processes
Clemens Grabmayer, Jan Willem Klop and Bas LuttikElectronic Notes in Theoretical Computer Science 162 183 (2006)
https://doi.org/10.1016/j.entcs.2005.12.111
CONCUR 2006 – Concurrency Theory
Clemens Grabmayer, Jan Willem Klop and Bas LuttikLecture Notes in Computer Science, CONCUR 2006 – Concurrency Theory 4137 16 (2006)
https://doi.org/10.1007/11817949_2
The Bisimulation Problem for Equational Graphs of Finite Out-Degree
Géraud SénizerguesSIAM Journal on Computing 34 (5) 1025 (2005)
https://doi.org/10.1137/S0097539700377256
A note on an expressiveness hierarchy for multi-exit iteration
Luca Aceto, Wan Fokkink and Anna IngólfsdóttirInformation Processing Letters 87 (1) 17 (2003)
https://doi.org/10.1016/S0020-0190(03)00234-5
The complexity of bisimilarity-checking for one-counter processes
Antonín KučeraTheoretical Computer Science 304 (1-3) 157 (2003)
https://doi.org/10.1016/S0304-3975(03)00081-1
Modifications of Expansion Trees for Weak Bisimulation in BPA
Jitka Stříbrná and Ivana ČernáElectronic Notes in Theoretical Computer Science 68 (6) 19 (2003)
https://doi.org/10.1016/S1571-0661(04)80531-0
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
Antonı́n Kučera and Richard MayrTheoretical Computer Science 270 (1-2) 677 (2002)
https://doi.org/10.1016/S0304-3975(01)00094-9
CONCUR 2002 — Concurrency Theory
Sławomir LasotaLecture Notes in Computer Science, CONCUR 2002 — Concurrency Theory 2421 562 (2002)
https://doi.org/10.1007/3-540-45694-5_37
Machines, Computations, and Universality
Géraud SénizerguesLecture Notes in Computer Science, Machines, Computations, and Universality 2055 114 (2001)
https://doi.org/10.1007/3-540-45132-3_7
Pushdown automata, multiset automata, and Petri nets
Yoram Hirshfeld and Faron MollerTheoretical Computer Science 256 (1-2) 3 (2001)
https://doi.org/10.1016/S0304-3975(00)00099-2
Handbook of Process Algebra
Jan A. Bergstra, Wan Fokkink and Alban PonseHandbook of Process Algebra 333 (2001)
https://doi.org/10.1016/B978-044482830-9/50023-0
Bisimulation Trees and the Decidability of Weak Bisimulations
Yoram HirshfeldElectronic Notes in Theoretical Computer Science 5 2 (1997)
https://doi.org/10.1016/S1571-0661(05)80674-7
An Equational Axiomatization for Multi-exit Iteration
Luca Aceto and Wan FokkinkInformation and Computation 137 (2) 121 (1997)
https://doi.org/10.1006/inco.1997.2645
Algebraic Methodology and Software Technology
Wan FokkinkLecture Notes in Computer Science, Algebraic Methodology and Software Technology 1101 180 (1996)
https://doi.org/10.1007/BFb0014315
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Yoram Hirshfeld, Mark Jerrum and Faron MollerTheoretical Computer Science 158 (1-2) 143 (1996)
https://doi.org/10.1016/0304-3975(95)00064-X
Algebra of Communicating Processes
Javier BlancoWorkshops in Computing, Algebra of Communicating Processes 242 (1995)
https://doi.org/10.1007/978-1-4471-2120-6_10
On deciding some equivalences for concurrent processes
Dung T. Huynh and Lu TianRAIRO - Theoretical Informatics and Applications 28 (1) 51 (1994)
https://doi.org/10.1051/ita/1994280100511
A note on the complexity of deciding bisimilarity of normed unary processes
Dung T. Huynh and Lu TianTheoretical Computer Science 131 (2) 441 (1994)
https://doi.org/10.1016/0304-3975(94)90183-X
623 (1994)
https://doi.org/10.1109/SFCS.1994.365729
Theoretical Aspects of Computer Software
Hans HüttelLecture Notes in Computer Science, Theoretical Aspects of Computer Software 789 454 (1994)
https://doi.org/10.1007/3-540-57887-0_110
Deciding bisimilarity of normed context-free processes is in Σp2
Dung T. Huynh and Lu TianTheoretical Computer Science 123 (2) 183 (1994)
https://doi.org/10.1016/0304-3975(92)00078-6
386 (1993)
https://doi.org/10.1109/LICS.1993.287569
3 (1993)
https://doi.org/10.1109/ICCI.1993.315412
A short proof of the decidability of bisimulation for normed bpa-processes
Jan Friso GrooteInformation Processing Letters 42 (3) 167 (1992)
https://doi.org/10.1016/0020-0190(92)90142-I