@misc{
    PROD3309,
    author = {Anderson, Lasse and Helander, Johannes and Heljanko, Keijo and Janhunen, Tomi and J{\"{u}}rgens, Robert and Kangas, Ismo and Nurmela, Kari J. and Oksanen, Kenneth and Pesonen, Olavi and Rauhamaa, Marko and Reilly, James and Suonsivu, Heikki and Valkealahti, Kimmo and Varpaaniemi, Kimmo and V{\"{a}}is{\"{a}}nen, Pauli},
    title = "{P}{R}{O}{D} 3.3.09 --- An Advanced Tool for Efficient Reachability Analysis",
    url = "http://www.tcs.hut.fi/Software/prod/",
    abstract = "PROD is a reachability analysis tool that can be used in UNIX (any system of that kind) and in Windows (3.1, 3.11, '95, NT). PROD supports stubborn-set-aided on-the-fly verification of linear time temporal logic formulas and off-line-without-reduction verification of computation tree logic formulas.",
    month = "February",
    note = "Software",
    keywords = "reachability analysis, on-the-fly verification, predicate/transition nets, stubborn set method, linear time temporal logic, computation tree logic",
    flags = "public,SOFTWARE,ANNA-MARIA",
    year = "2001",
    howpublished = "Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland"
}