APA (7th ed.) Citation

Esparza, J. (1996). Reachibility in live and safe free-choice Petri nets is NP-complete. SFB 342.

Chicago Style (17th ed.) Citation

Esparza, Javier. Reachibility in Live and Safe Free-choice Petri Nets Is NP-complete. München: SFB 342, 1996.

MLA (9th ed.) Citation

Esparza, Javier. Reachibility in Live and Safe Free-choice Petri Nets Is NP-complete. SFB 342, 1996.

Warning: These citations may not always be 100% accurate.