T. Chen, B. Ploeger, J. van de Pol & T. A. C. Willemse (2007):
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems.
In: Proceedings of the 18th International Conference on Concurrency Theory,
CONCUR'07.
Springer-Verlag,
Berlin, Heidelberg,
pp. 120–135.
Available at http://dl.acm.org/citation.cfm?id=2392200.2392211.
E. Clarke, O. Grumberg, S. Jha, Y. Lu & H. Veith (2003):
Counterexample-guided Abstraction Refinement for Symbolic Model Checking.
J. ACM 50(5),
pp. 752–794,
doi:10.1145/876638.876643.
E. M. Clarke, Jr., O. Grumberg & D. A. Peled (1999):
Model Checking.
MIT Press,
Cambridge, MA, USA.
S. Cranen, B. Luttik & T. A. C. Willemse (2013):
Proof Graphs for Parameterised Boolean Equation Systems,
pp. 470–484.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
doi:10.1007/978-3-642-40184-8_33.
E. Grädel, P. G. Kolaitis, L. Libkin, M. Marx, J. Spencer, M. Y. Vardi, Y. Venema & S. Weinstein (2005):
Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series).
Springer-Verlag New York, Inc.,
Secaucus, NJ, USA.
S. Graf & H. Saidi (1997):
Construction of abstract state graphs with PVS,
pp. 72–83.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
doi:10.1007/3-540-63166-6_10.
J. F. Groote & T. Willemse (2004):
Parameterised Boolean Equation Systems,
pp. 308–324.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
doi:10.1007/978-3-540-28644-8_20.
J. F. Groote & T. A. C. Willemse (2005):
Model-checking Processes with Data.
Sci. Comput. Program. 56(3),
pp. 251–273,
doi:10.1016/j.scico.2004.08.002.
J. F. Groote & T. A. C. Willemse (2005):
Parameterised boolean equation systems.
Theoretical Computer Science 343(3),
pp. 332 – 369,
doi:10.1016/j.tcs.2005.06.016.
R. P. J. Koolen, T. A. C. Willemse & H. Zantema (2015):
Using SMT for Solving Fragments of Parameterised Boolean Equation Systems,
pp. 14–30.
Springer International Publishing,
Cham,
doi:10.1007/978-3-319-24953-7_3.
B. Ploeger, J. W. Wesselink & T. A. C. Willemse (2011):
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems.
Information and Computation 209(4),
pp. 637 – 663,
doi:10.1016/j.ic.2010.11.025.
M. Presburger (1931):
Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt.
publisher not identified.
Available at https://books.google.co.jp/books?id=7agKHQAACAAJ.
eptcs@eptcs.org