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