@inproceedings{
    Heljanko:Concur2001,
    editor = "Larsen, Kim Guldstrand and Nielsen, Mogens",
    author = "Heljanko, Keijo",
    publisher = "Springer-Verlag",
    title = "Bounded Reachability Checking with Process Semantics",
    url = "http://users.ics.tkk.fi/kepa/publications/",
    series = "Lecture Notes in Computer Science",
    booktitle = "Proceedings of the 12th International Conference on Concurrency Theory (Concur'2001)",
    year = "2001",
    abstract = "Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems. More specifically, we translate the bounded reachability problem for 1-safe Petri nets into constrained Boolean circuit satisfiability. We consider three semantics: process, step, and interleaving semantics. We show that process semantics has often the best performance for bounded reachability checking.",
    month = "August",
    volume = "2154",
    juforank = "1",
    flags = "SA-LO-00-02 SA-IN-98-01",
    address = "Aalborg, Denmark",
    keywords = "bounded model checking, process semantics, reachability, Petri nets",
    pages = "218--232"
}