\begin{thebibliography}{10}

\bibitem{AmparoreDBGM17}
{\sc Amparore, E.~G., Donatelli, S., Beccuti, M., Garbi, G., and Miner, A.~S.}
\newblock Decision diagrams for petri nets: Which variable ordering?
\newblock In {\em Proceedings of the International Workshop on Petri Nets and
  Software Engineering (PNSE'17), co-located with the38th International
  Conference on Application and Theory of Petri Nets and Concurrency Petri Nets
  2017 and the 17th International Conference on Application of Concurrency to
  System Design {ACSD} 2017, Zaragoza, Spain, June 25-30, 2017\/} (2017),
  D.~Moldt, L.~Cabac, and H.~R{\"{o}}lke, Eds., vol.~1846 of {\em {CEUR}
  Workshop Proceedings}, CEUR-WS.org, pp.~31--50.

\bibitem{BabarBDM10}
{\sc Babar, J., Beccuti, M., Donatelli, S., and Miner, A.~S.}
\newblock Greatspn enhanced with decision diagram data structures.
\newblock In {\em Applications and Theory of Petri Nets, 31st International
  Conference, {PETRI} {NETS} 2010, Braga, Portugal, June 21-25, 2010.
  Proceedings\/} (2010), J.~Lilius and W.~Penczek, Eds., vol.~6128 of {\em
  Lecture Notes in Computer Science}, Springer, pp.~308--317.

\bibitem{BabarM10}
{\sc Babar, J., and Miner, A.~S.}
\newblock Meddly: Multi-terminal and edge-valued decision diagram library.
\newblock In {\em {QEST} 2010, Seventh International Conference on the
  Quantitative Evaluation of Systems, Williamsburg, Virginia, USA, 15-18
  September 2010\/} (2010), {IEEE} Computer Society, pp.~195--196.

\bibitem{BiereCCZ99}
{\sc Biere, A., Cimatti, A., Clarke, E.~M., and Zhu, Y.}
\newblock Symbolic model checking without bdds.
\newblock In {\em Tools and Algorithms for Construction and Analysis of
  Systems, 5th International Conference, {TACAS} '99, Held as Part of the
  European Joint Conferences on the Theory and Practice of Software, ETAPS'99,
  Amsterdam, The Netherlands, March 22-28, 1999, Proceedings\/} (1999),
  R.~Cleaveland, Ed., vol.~1579 of {\em Lecture Notes in Computer Science},
  Springer, pp.~193--207.

\bibitem{BolligW96}
{\sc Bollig, B., and Wegener, I.}
\newblock Improving the variable ordering of obdds is np-complete.
\newblock {\em {IEEE} Trans. Computers 45}, 9 (1996), 993--1002.

\bibitem{Bryant86}
{\sc Bryant, R.~E.}
\newblock Graph-based algorithms for boolean function manipulation.
\newblock {\em {IEEE} Trans. Computers 35}, 8 (1986), 677--691.

\bibitem{CimattiCGGPRST02}
{\sc Cimatti, A., Clarke, E.~M., Giunchiglia, E., Giunchiglia, F., Pistore, M.,
  Roveri, M., Sebastiani, R., and Tacchella, A.}
\newblock Nusmv 2: An opensource tool for symbolic model checking.
\newblock In {\em Computer Aided Verification, 14th International Conference,
  {CAV} 2002,Copenhagen, Denmark, July 27-31, 2002, Proceedings\/} (2002),
  E.~Brinksma and K.~G. Larsen, Eds., vol.~2404 of {\em Lecture Notes in
  Computer Science}, Springer, pp.~359--364.

\bibitem{Clarke08}
{\sc Clarke, E.~M.}
\newblock The birth of model checking.
\newblock In {\em 25 Years of Model Checking - History, Achievements,
  Perspectives\/} (2008), O.~Grumberg and H.~Veith, Eds., vol.~5000 of {\em
  Lecture Notes in Computer Science}, Springer, pp.~1--26.

\bibitem{ClarkeE81}
{\sc Clarke, E.~M., and Emerson, E.~A.}
\newblock Design and synthesis of synchronization skeletons using
  branching-time temporal logic.
\newblock In {\em Logics of Programs, Workshop, Yorktown Heights, New York,
  USA, May 1981\/} (1981), D.~Kozen, Ed., vol.~131 of {\em Lecture Notes in
  Computer Science}, Springer, pp.~52--71.

\bibitem{ClarkeES86}
{\sc Clarke, E.~M., Emerson, E.~A., and Sistla, A.~P.}
\newblock Automatic verification of finite-state concurrent systems using
  temporal logic specifications.
\newblock {\em {ACM} Trans. Program. Lang. Syst. 8}, 2 (1986), 244--263.

\bibitem{ClarkeGH97}
{\sc Clarke, E.~M., Grumberg, O., and Hamaguchi, K.}
\newblock Another look at {LTL} model checking.
\newblock {\em Formal Methods in System Design 10}, 1 (1997), 47--71.

\bibitem{EmersonH86}
{\sc Emerson, E.~A., and Halpern, J.~Y.}
\newblock "sometimes" and "not never" revisited: on branching versus linear
  time temporal logic.
\newblock {\em J. {ACM} 33}, 1 (1986), 151--178.

\bibitem{FernandezMJJ92}
{\sc Fernandez, J., Mounier, L., Jard, C., and J{\'{e}}ron, T.}
\newblock On-the-fly verification of finite transition systems.
\newblock {\em Formal Methods in System Design 1}, 2/3 (1992), 251--273.

\bibitem{Holzmann97}
{\sc Holzmann, G.~J.}
\newblock The model checker {SPIN}.
\newblock {\em {IEEE} Trans. Software Eng. 23}, 5 (1997), 279--295.

\bibitem{HolzmannPy96}
{\sc Holzmann, G.~J., Peled, D.~A., and Yannakakis, M.}
\newblock On nested depth first search.
\newblock In {\em The Spin Verification System, Proceedings of a {DIMACS}
  Workshop, New Brunswick, New Jersey, USA, August, 1996\/} (1996),
  J.~Gr{\'{e}}goire, G.~J. Holzmann, and D.~A. Peled, Eds., vol.~32 of {\em
  {DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  {DIMACS/AMS}, pp.~23--31.

\bibitem{MDD}
{\sc Kam, T., Villa, T., and Brayton, R.}
\newblock Multi-valued decision diagrams: Theory and applications,"
  multiple-valued logic.
\newblock {\em Multiple-Valued Logic 4\/} (01 1998).

\bibitem{KantLMPBD15}
{\sc Kant, G., Laarman, A., Meijer, J., van~de Pol, J., Blom, S., and van Dijk,
  T.}
\newblock Ltsmin: High-performance language-independent model checking.
\newblock In {\em Tools and Algorithms for the Construction and Analysis of
  Systems - 21st International Conference, {TACAS} 2015, Held as Part of the
  European Joint Conferences on Theory and Practice of Software, {ETAPS} 2015,
  London, UK, April 11-18, 2015. Proceedings\/} (2015), C.~Baier and
  C.~Tinelli, Eds., vol.~9035 of {\em Lecture Notes in Computer Science},
  Springer, pp.~692--707.

\bibitem{Keller76}
{\sc Keller, R.~M.}
\newblock Formal verification of parallel programs.
\newblock {\em Commun. {ACM} 19}, 7 (1976), 371--384.

\bibitem{Lamport80}
{\sc Lamport, L.}
\newblock "sometime" is sometimes "not never" - on the temporal logic of
  programs.
\newblock In {\em Conference Record of the Seventh Annual {ACM} Symposium on
  Principles of Programming Languages, Las Vegas, Nevada, USA, January 1980\/}
  (1980), P.~W. Abrahams, R.~J. Lipton, and S.~R. Bourne, Eds., {ACM} Press,
  pp.~174--185.

\bibitem{SymbMC}
{\sc McMillan, K.~L.}
\newblock {\em Symbolic model checking}.
\newblock Kluwer, 1993.

\bibitem{Peled96}
{\sc Peled, D.~A.}
\newblock Combining partial order reductions with on-the-fly model-checking.
\newblock {\em Formal Methods in System Design 8}, 1 (1996), 39--64.

\bibitem{Pnueli77}
{\sc Pnueli, A.}
\newblock The temporal logic of programs.
\newblock In {\em 18th Annual Symposium on Foundations of Computer Science,
  Providence, Rhode Island, USA, 31 October - 1 November 1977\/} (1977), {IEEE}
  Computer Society, pp.~46--57.

\bibitem{Sistlac85}
{\sc Sistla, A.~P., and Clarke, E.~M.}
\newblock The complexity of propositional linear temporal logics.
\newblock {\em J. {ACM} 32}, 3 (1985), 733--749.

\bibitem{DijkP17}
{\sc van Dijk, T., and van~de Pol, J.}
\newblock Sylvan: multi-core framework for decision diagrams.
\newblock {\em {STTT} 19}, 6 (2017), 675--696.

\bibitem{Vardi95}
{\sc Vardi, M.~Y.}
\newblock An automata-theoretic approach to linear temporal logic.
\newblock In {\em Logics for Concurrency - Structure versus Automata (8th Banff
  Higher Order Workshop, Banff, Canada, August 27 - September 3, 1995,
  Proceedings)\/} (1995), F.~Moller and G.~M. Birtwistle, Eds., vol.~1043 of
  {\em Lecture Notes in Computer Science}, Springer, pp.~238--266.

\bibitem{VardiW94}
{\sc Vardi, M.~Y., and Wolper, P.}
\newblock Reasoning about infinite computations.
\newblock {\em Inf. Comput. 115}, 1 (1994), 1--37.

\end{thebibliography}
