Deadlock and Reachability Checking with Finite Complete Prefixes
No Thumbnail Available
URL
Journal Title
Journal ISSN
Volume Title
Helsinki University of Technology |
Licentiate thesis
Checking the digitized thesis and permission for publishing
Instructions for the author
Instructions for the author
Authors
Date
1999
Department
Major/Subject
Digitaalitekniikka
Mcode
Tik-79
Degree programme
Language
en
Pages
vi + 79
Series
Description
Supervisor
Ojala, LeoThesis advisor
Niemelä, IlkkaKeywords
computer aided verification, tietokoneavusteinen verifiointi, Petri nets, Petri-verkot, finite complete prefixes, äärelliset täydelliset prefiksit, net unfoldings, verkkojen suoristus, model checking, mallintarkastus, deadlocks, lukkiumat, reachability, saavutettavuus, logic programs, logiikkaohjelmat, stable model semantics, stabiilien mallien semantiikka, computational complexity, laskennallinen vaativuus