Søren Christensen (1993):
Decidability and Decomposition in Process Algebras.
School of Informatics, University of Edinburgh.
Søren Christensen, Yoram Hirshfeld & Faron Moller (1993):
Bisimulation Equivalence is Decidable for Basic Parallel Processes.
In: CONCUR,
pp. 143–157,
doi:10.1007/3-540-57208-2_11.
Wojciech Czerwinski, Piotr Hofman & Slawomir Lasota (2011):
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes.
In: CONCUR,
pp. 528–542,
doi:10.1007/978-3-642-23217-6_35.
S. Eilenberg & M. P. Schützenberger (1969):
Rational sets in commutative monoids.
Journal of Algebra 13,
pp. 173–191,
doi:10.1016/0021-8693(69)90070-2.
Javier Esparza (1997):
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes.
Fundam. Inform. 31(1),
pp. 13–25,
doi:10.3233/FI-1997-3112.
Seymour Ginsburg & Edwin H. Spanier (1966):
Semigroups, Presburger Formulas, and Languages.
Pacific Journal of Mathematics 16,
pp. 285 – 296.
R.J. van Glabbeek (2001):
The Linear Time – Branching Time Spectrum I; The Semantics of Concrete, Sequential Processes.
In: J.A. Bergstra, A. Ponse & S.A. Smolka: Handbook of Process Algebra, chapter 1.
Elsevier,
pp. 3–99.
Available at http://Boole.stanford.edu/pub/DVI/spectrum1.dvi.gz.
Will Harwood, Faron Moller & Anton Setzer (2006):
Weak Bisimulation Approximants.
In: CSL,
pp. 365–379,
doi:10.1007/11874683_24.
Yoram Hirshfeld (1993):
Petri Nets and the Equivalence Problem.
In: CSL,
pp. 165–174,
doi:10.1007/BFb0049331.
Yoram Hirshfeld (1996):
Bisimulation trees and the decidability of weak bisimulations.
Electr. Notes Theor. Comput. Sci. 5,
pp. 2–13,
doi:10.1016/S1571-0661(05)80674-7.
Yoram Hirshfeld, Mark Jerrum & Faron Moller (1996):
A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes.
Mathematical Structures in Computer Science 6(3),
pp. 251–259,
doi:10.1017/S0960129500000992.
Hans Hüttel (1994):
Undecidable Equivalences for Basic Parallel Processes.
In: TACS,
pp. 454–464,
doi:10.1007/3-540-57887-0_110.
Hans Hüttel, Naoki Kobayashi & Takashi Suto (2009):
Undecidable equivalences for basic parallel processes.
Inf. Comput. 207(7),
pp. 812–829,
doi:10.1016/j.ic.2008.12.011.
Petr Jančar (2003):
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete.
In: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science.
IEEE Computer Society,
Washington, DC, USA,
pp. 218,
doi:10.1109/LICS.2003.1210061.
Robin Milner (1989):
Communication and concurrency.
PHI Series in computer science.
Prentice Hall.
JiríSrba (2002):
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard.
In: STACS,
pp. 535–546,
doi:10.1007/3-540-45841-7_44.
Colin Stirling (1998):
The Joys of Bisimulation.
In: MFCS,
pp. 142–151,
doi:10.1007/BFb0055763.
Colin Stirling (2001):
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes.
In: FoSSaCS,
pp. 379–393,
doi:10.1007/3-540-45315-6_25.
Jitka Stríbrná (1998):
Decidability and complexity of equivalences for simple process algebras.
School of Informatics, University of Edinburgh.
eptcs@eptcs.org