@inproceedings(bakera2009:solving,
 author       = "M.~Bakera and S.~Edelkamp and P.~Kissmann and C.D. Renner",
 year         = "2009",
 title        = "{Solving $\mu $-Calculus Parity Games by Symbolic Planning}",
 booktitle    = "MoChArt 2008",
 series       = "LNCS\xspace ",
 volume       = "5348",
 publisher    = "Springer",
 doi          = "10.1007/978-3-642-00431-5\_2",
)
@inproceedings(blom2008:symbolic,
 author       = "S.C.C Blom and {J.C.} {van de Pol}",
 year         = "2008",
 title        = "{Symbolic Reachability for Process Algebras with Recursive Data Types}",
 booktitle    = "ICTAC 2008",
 series       = "LNCS\xspace ",
 volume       = "5160",
 publisher    = "Springer",
 doi          = "10.1007/978-3-540-85762-4\_6",
)
@inproceedings(blom2010:ltsmin,
 author       = "S.C.C. Blom and {J.C.} {van de Pol} and M.~Weber",
 year         = "2010",
 title        = "{LTSmin: Distributed and Symbolic Reachability}",
 booktitle    = "CAV 2010",
 series       = "LNCS\xspace ",
 volume       = "6174",
 publisher    = "Springer",
 doi          = "10.1007/978-3-642-14295-6\_31",
)
@incollection(bradfield2001:modal,
 author       = "J.C. Bradfield and C.~Stirling",
 year         = "2001",
 title        = "{Modal logics and mu-calculi: An introduction}",
 editor       = "J.A. Bergstra and A.~Ponse and S.A. Smolka",
 booktitle    = "Handbook of Process Algebra",
 chapter      = "4",
 publisher    = "Elsevier",
 pages        = "293--330",
 doi          = "10.1016/B978-044482830-9/50022-9",
)
@article(burch1994:symbolic,
 author       = "J.R. Burch and E.M. Clarke and D.E. Long and K.L. McMillan and D.L. Dill",
 year         = "1994",
 title        = "{Symbolic Model Checking for Sequential Circuit Verification}",
 journal      = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
 volume       = "13",
 number       = "4",
 pages        = "401--424",
 doi          = "10.1109/43.275352",
)
@inproceedings(ciardo2001:saturation,
 author       = "G.~Ciardo and G.~L\"{u}ttgen and R.~Siminiceanu",
 year         = "2001",
 title        = "{Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation}",
 booktitle    = "TACAS 2001",
 series       = "LNCS\xspace ",
 volume       = "2031",
 publisher    = "Springer",
 doi          = "10.1007/3-540-45319-9\_23",
)
@inproceedings(cimatti2002:nusmv2,
 author       = "A.~Cimatti and E.~Clarke and E.~Giunchiglia and F.~Giunchiglia and M.~Pistore and M.~Roveri and R.~Sebastiani and A.~Tacchella",
 year         = "2002",
 title        = "{NuSMV Version 2: An OpenSource Tool for Symbolic Model Checking}",
 booktitle    = "CAV 2002",
 series       = "LNCS\xspace ",
 volume       = "2404",
 publisher    = "Springer",
 doi          = "10.1007/3-540-45657-0\_29",
)
@inproceedings(friedmann2009:solving,
 author       = "O.~Friedmann and M.~Lange",
 year         = "2009",
 title        = "{Solving Parity Games in Practice}",
 booktitle    = "ATVA 2009",
 series       = "LNCS\xspace ",
 volume       = "5799",
 publisher    = "Springer",
 doi          = "10.1007/978-3-642-04761-9\_15",
)
@book(graedel2002:automata,
 editor       = "E.~Gr\"{a}del and W.~Thomas and T.~Wilke",
 year         = "2002",
 title        = "{Automata Logics, and Infinite Games}",
 series       = "LNCS\xspace ",
 volume       = "2500",
 publisher    = "Springer",
 doi          = "10.1007/3-540-36387-4",
)
@incollection(groote2001:algebraic,
 author       = "J.F. Groote and M.A. Reniers",
 year         = "2001",
 title        = "{Algebraic process verification}",
 editor       = "J.A. Bergstra and A.~Ponse and S.A. Smolka",
 booktitle    = "Handbook of Process Algebra",
 chapter      = "17",
 publisher    = "Elsevier",
 pages        = "1151--1208",
 doi          = "10.1016/B978-044482830-9/50035-7",
)
@article(groote2005:modelchecking,
 author       = "J.F. Groote and T.A.C. Willemse",
 year         = "2005",
 title        = "{Model-checking processes with data}",
 journal      = "Science of Computer Programming",
 volume       = "56",
 number       = "3",
 doi          = "10.1016/j.scico.2004.08.002",
)
@article(groote2005:parameterised,
 author       = "J.F. Groote and T.A.C. Willemse",
 year         = "2005",
 title        = "{Parameterised boolean equation systems}",
 journal      = "Theoretical Computer Science",
 volume       = "343",
 number       = "3",
 doi          = "10.1016/j.tcs.2005.06.016",
)
@article(hwong2013:formalising,
 author       = "Y.L. Hwong and J.J.A. Keiren and V.J.J. Kusters and S.~Leemans and T.A.C. Willemse",
 year         = "2013",
 title        = "{Formalising and analysing the control software of the Compact Muon Solenoid Experiment at the Large Hadron Collider}",
 journal      = "Science of Computer Programming",
 doi          = "10.1016/j.scico.2012.11.009",
)
@inproceedings(kant2012:efficient,
 author       = "G.~Kant and {J.C.} {van de Pol}",
 year         = "2012",
 title        = "{Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games}",
 booktitle    = "Graphite 2012",
 series       = "EPTCS",
 volume       = "99",
 doi          = "10.4204/EPTCS.99.7",
)
@incollection(mazala2002:infinite,
 author       = "R.~Mazala",
 year         = "2002",
 title        = "{Infinite Games}",
 booktitle    = "\textnormal {\cite {graedel2002:automata}}",
 pages        = "197--204",
 doi          = "10.1007/3-540-36387-4\_2",
)
@inproceedings(ranjan1995:efficient,
 author       = "R.K. Ranjan and A.~Aziz and R.K. Brayton and B.~Plessier and C.~Pixley",
 year         = "1995",
 title        = "{Efficient BDD Algorithms for FSM Synthesis and Verification}",
 booktitle    = "IEEE/ACM Proceedings International Workshop on Logic Synthesis, Lake Tahoe (NV)",
)
@article(zielonka1998:infinite,
 author       = "W.~Zielonka",
 year         = "1998",
 title        = "{Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees}",
 journal      = "Theoretical Computer Science",
 volume       = "200",
 number       = "1--2",
 doi          = "10.1016/S0304-3975(98)00009-7",
 note         = "\write \rebib { doi = "10.1016/S0304-3975(98)00009-7",}",
)