M. Bakera, S. Edelkamp, P. Kissmann & C.D. Renner (2009):
Solving μ-Calculus Parity Games by Symbolic Planning.
In: MoChArt 2008,
LNCS 5348.
Springer,
doi:10.1007/978-3-642-00431-5_2.
S.C.C Blom & J.C. van de Pol (2008):
Symbolic Reachability for Process Algebras with Recursive Data Types.
In: ICTAC 2008,
LNCS 5160.
Springer,
doi:10.1007/978-3-540-85762-4_6.
S.C.C. Blom, J.C. van de Pol & M. Weber (2010):
LTSmin: Distributed and Symbolic Reachability.
In: CAV 2010,
LNCS 6174.
Springer,
doi:10.1007/978-3-642-14295-6_31.
J.C. Bradfield & C. Stirling (2001):
Modal logics and mu-calculi: An introduction.
In: J.A. Bergstra, A. Ponse & S.A. Smolka: Handbook of Process Algebra, chapter 4.
Elsevier,
pp. 293–330,
doi:10.1016/B978-044482830-9/50022-9.
J.R. Burch, E.M. Clarke, D.E. Long, K.L. McMillan & D.L. Dill (1994):
Symbolic Model Checking for Sequential Circuit Verification.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 13(4),
pp. 401–424,
doi:10.1109/43.275352.
G. Ciardo, G. Lüttgen & R. Siminiceanu (2001):
Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation.
In: TACAS 2001,
LNCS 2031.
Springer,
doi:10.1007/3-540-45319-9_23.
A. Cimatti, E. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani & A. Tacchella (2002):
NuSMV Version 2: An OpenSource Tool for Symbolic Model Checking.
In: CAV 2002,
LNCS 2404.
Springer,
doi:10.1007/3-540-45657-0_29.
O. Friedmann & M. Lange (2009):
Solving Parity Games in Practice.
In: ATVA 2009,
LNCS 5799.
Springer,
doi:10.1007/978-3-642-04761-9_15.
E. Grädel, W. Thomas & T. Wilke (2002):
Automata Logics, and Infinite Games.
LNCS 2500.
Springer,
doi:10.1007/3-540-36387-4.
J.F. Groote & M.A. Reniers (2001):
Algebraic process verification.
In: J.A. Bergstra, A. Ponse & S.A. Smolka: Handbook of Process Algebra, chapter 17.
Elsevier,
pp. 1151–1208,
doi:10.1016/B978-044482830-9/50035-7.
J.F. Groote & T.A.C. Willemse (2005):
Model-checking processes with data.
Science of Computer Programming 56(3),
doi:10.1016/j.scico.2004.08.002.
Y.L. Hwong, J.J.A. Keiren, V.J.J. Kusters, S. Leemans & T.A.C. Willemse (2013):
Formalising and analysing the control software of the Compact Muon Solenoid Experiment at the Large Hadron Collider.
Science of Computer Programming,
doi:10.1016/j.scico.2012.11.009.
G. Kant & J.C. van de Pol (2012):
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games.
In: Graphite 2012,
EPTCS 99,
doi:10.4204/EPTCS.99.7.
R. Mazala (2002):
Infinite Games.
In: graedel2002:automata,
pp. 197–204,
doi:10.1007/3-540-36387-4_2.
R.K. Ranjan, A. Aziz, R.K. Brayton, B. Plessier & C. Pixley (1995):
Efficient BDD Algorithms for FSM Synthesis and Verification.
In: IEEE/ACM Proceedings International Workshop on Logic Synthesis, Lake Tahoe (NV).
W. Zielonka (1998):
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees.
Theoretical Computer Science 200(1–2),
doi:10.1016/S0304-3975(98)00009-7.
doi = "10.1016/S0304-3975(98)00009-7",.
eptcs@eptcs.org