EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues RAIRO-Theor. Inf. Appl., 24 4 (1990) 339-352 Article references

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 Mayr
Journal of Computer and System Sciences 91 82 (2018)
DOI: 10.1016/j.jcss.2017.09.004
See this article

A general account of coinduction up-to

Filippo Bonchi, Daniela Petrişan, Damien Pous and Jurriaan Rot
Acta Informatica 54 (2) 127 (2017)
DOI: 10.1007/s00236-016-0271-4
See this article

An experimental ambiguity detection tool

Sylvain Schmitz
Science of Computer Programming 75 (1-2) 71 (2010)
DOI: 10.1016/j.scico.2009.07.002
See this article

Decidability of Weak Bisimilarity for a Subset of BPA

Haiyan Chen
Electronic Notes in Theoretical Computer Science 212 241 (2008)
DOI: 10.1016/j.entcs.2008.04.065
See this article

An Experimental Ambiguity Detection Tool

Sylvain Schmitz
Electronic Notes in Theoretical Computer Science 203 (2) 69 (2008)
DOI: 10.1016/j.entcs.2008.03.045
See this article

Formal Methods and Hybrid Real-Time Systems

Xinxin Liu
Lecture Notes in Computer Science, Formal Methods and Hybrid Real-Time Systems 4700 472 (2007)
DOI: 10.1007/978-3-540-75221-9_22
See this article

Reflections on a Geometry of Processes

Clemens Grabmayer, Jan Willem Klop and Bas Luttik
Electronic Notes in Theoretical Computer Science 162 183 (2006)
DOI: 10.1016/j.entcs.2005.12.111
See this article

Decidability of performance equivalence for basic parallel processes

Sławomir Lasota
Theoretical Computer Science 360 (1-3) 172 (2006)
DOI: 10.1016/j.tcs.2006.02.020
See this article

CONCUR 2006 – Concurrency Theory

Clemens Grabmayer, Jan Willem Klop and Bas Luttik
Lecture Notes in Computer Science, CONCUR 2006 – Concurrency Theory 4137 16 (2006)
DOI: 10.1007/11817949_2
See this article

The Bisimulation Problem for Equational Graphs of Finite Out-Degree

Géraud Sénizergues
SIAM Journal on Computing 34 (5) 1025 (2005)
DOI: 10.1137/S0097539700377256
See this article

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)
DOI: 10.1016/S1571-0661(04)80531-0
See this article

A note on an expressiveness hierarchy for multi-exit iteration

Luca Aceto, Wan Fokkink and Anna Ingólfsdóttir
Information Processing Letters 87 (1) 17 (2003)
DOI: 10.1016/S0020-0190(03)00234-5
See this article

The complexity of bisimilarity-checking for one-counter processes

Antonín Kučera
Theoretical Computer Science 304 (1-3) 157 (2003)
DOI: 10.1016/S0304-3975(03)00081-1
See this article

CONCUR 2002 — Concurrency Theory

Sławomir Lasota
Lecture Notes in Computer Science, CONCUR 2002 — Concurrency Theory 2421 562 (2002)
DOI: 10.1007/3-540-45694-5_37
See this article

Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time

Antonı́n Kučera and Richard Mayr
Theoretical Computer Science 270 (1-2) 677 (2002)
DOI: 10.1016/S0304-3975(01)00094-9
See this article

Handbook of Process Algebra

Jan A. Bergstra, Wan Fokkink and Alban Ponse
Handbook of Process Algebra 333 (2001)
DOI: 10.1016/B978-044482830-9/50023-0
See this article

Pushdown automata, multiset automata, and Petri nets

Yoram Hirshfeld and Faron Moller
Theoretical Computer Science 256 (1-2) 3 (2001)
DOI: 10.1016/S0304-3975(00)00099-2
See this article

Machines, Computations, and Universality

Géraud Sénizergues
Lecture Notes in Computer Science, Machines, Computations, and Universality 2055 114 (2001)
DOI: 10.1007/3-540-45132-3_7
See this article

Bisimulation Trees and the Decidability of Weak Bisimulations

Yoram Hirshfeld
Electronic Notes in Theoretical Computer Science 5 2 (1997)
DOI: 10.1016/S1571-0661(05)80674-7
See this article

An Equational Axiomatization for Multi-exit Iteration

Luca Aceto and Wan Fokkink
Information and Computation 137 (2) 121 (1997)
DOI: 10.1006/inco.1997.2645
See this article

A polynomial algorithm for deciding bisimilarity of normed context-free processes

Yoram Hirshfeld, Mark Jerrum and Faron Moller
Theoretical Computer Science 158 (1-2) 143 (1996)
DOI: 10.1016/0304-3975(95)00064-X
See this article

Algebraic Methodology and Software Technology

Wan Fokkink
Lecture Notes in Computer Science, Algebraic Methodology and Software Technology 1101 180 (1996)
DOI: 10.1007/BFb0014315
See this article

Algebra of Communicating Processes

Javier Blanco
Workshops in Computing, Algebra of Communicating Processes 242 (1995)
DOI: 10.1007/978-1-4471-2120-6_10
See this article

Y. Hirshfeld, M. Jerrum and F. Moller
623 (1994)
DOI: 10.1109/SFCS.1994.365729
See this article

Deciding bisimilarity of normed context-free processes is in Σp2

Dung T. Huynh and Lu Tian
Theoretical Computer Science 123 (2) 183 (1994)
DOI: 10.1016/0304-3975(92)00078-6
See this article

On deciding some equivalences for concurrent processes

Dung T. Huynh and Lu Tian
RAIRO - Theoretical Informatics and Applications 28 (1) 51 (1994)
DOI: 10.1051/ita/1994280100511
See this article

A note on the complexity of deciding bisimilarity of normed unary processes

Dung T. Huynh and Lu Tian
Theoretical Computer Science 131 (2) 441 (1994)
DOI: 10.1016/0304-3975(94)90183-X
See this article

Theoretical Aspects of Computer Software

Hans Hüttel
Lecture Notes in Computer Science, Theoretical Aspects of Computer Software 789 454 (1994)
DOI: 10.1007/3-540-57887-0_110
See this article

D.T. Huynh and Lu Tian
3 (1993)
DOI: 10.1109/ICCI.1993.315412
See this article

S. Christensen, Y. Hirshfeld and F. Moller
386 (1993)
DOI: 10.1109/LICS.1993.287569
See this article

A short proof of the decidability of bisimulation for normed bpa-processes

Jan Friso Groote
Information Processing Letters 42 (3) 167 (1992)
DOI: 10.1016/0020-0190(92)90142-I
See this article