{"version.version":"0.0.7","version.cm_url":"https://github.com/ceurws/ceur-spt","spt.html_url":"/Vol-272/paper-5.html","spt.description":null,"spt.id":"Vol-272/paper-5","spt.wikidataid":null,"spt.title":"Combining a Reachability Graph and a Reduction Rule Approach for Verification of EPCs","spt.pdfUrl":"https://ceur-ws.org/Vol-272/BPM07DemoProgramPaper4.pdf","spt.volume":{"number":272,"acronym":"BPM Conference 2007 Demonstration Program","wikidataid":"Q113545932","title":"BPM Conference 2007 Demonstration Program","description":"Proceedings of BPM'07 Demonstration Program","url":"http://ceur-ws.org/Vol-272/","date":"2007-08-17","dblp":"conf/bpm/2007d","k10plus":null,"urn":"urn:nbn:de:0074-272-8"},"spt.session":null,"cvb.id":"Vol-272/paper-5","cvb.title":"Combining a Reachability Graph and a Reduction Rule Approach for Verification of EPCs","cvb.type":null,"cvb.position":null,"cvb.pagesFrom":null,"cvb.pagesTo":null,"cvb.authors":"","cvb.vol_number":"272","cvb.pdf_name":"BPM07DemoProgramPaper4.pdf","cvb.pages":null,"cvb.fail":null,"dblp.dblp_publication_id":"https://dblp.org/rec/conf/bpm/Mendling07","dblp.dblp_proceeding_id":"https://dblp.org/rec/conf/bpm/2007d","dblp.volume_number":272,"dblp.title":"Combining a Reachability Graph and a Reduction Rule Approach for Verification of EPCs.","dblp.authors":[{"dblp_author_id":"https://dblp.org/pid/m/JanMendling","label":"Jan Mendling","wikidata_id":"Q57312382","orcid_id":"0000-0002-7260-524X","gnd_id":"136506313"}],"dblp.pdf_id":"Vol-272/BPM07DemoProgramPaper4"}