Embedded Software for SoC - Grupo de Mecatrônica EESC/USP

274 Chapter 20
3.
4.
5.
6.
7.
8.
9.
10.
11.
Eckerle, Jurgen and Lais. “New Methods for Sequential Hashing with Supertrace.” Technical
Report, Institut fur Informatik, Universitat Freiburg, Germany, 1998.
J. Esparza, S. Römer and W. Vogler. “An Improvement of McMillan’s Unfoding
Algorithm.” In TACAS’96, 1996.
P. Godefroid. Partial Order Methods for the Verification of Concurrent Systems. An
Approach to the State-Explosion Problem. Ph.D. thesis, Universite de Liege, 1995.
R. Jain. “A comparison of Hashing Schemes for Address Lookup in Computer Networks.”
IEEE Trans. On Communications, 4(3): 1570-1573, 1992.
T. Murata. “Petri Nets: Properties, Analysis and Applications.” Proceedings of the IEEE,
Vol. 77, No. 4, pp. 541–580, 1989.
K. Schmidt. “Integrating Low Level Symmetries into Reachability Analysis.” In Tools and
Algorithms for the Construction and Analysis of Systems, pp. 315–330, Springer Verlag,
2000.
SPIN. http://spinroot.com/spin/whatispin.html, 2003.
U. Stern and D. L. Dill. “Combining State Space Caching and Hash Compaction.” In
GI/ITG/GME Workshop, 1996.
K. Strehl et al. “FunState – An Internal Design Representation for Codesign.” IEEE Trans.
on VLSI Systems, Vol. 9, No. 4, pp. 524–544, August 2001.