A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Safety properties are an interesting subset of general temporal properties for systems. In the linear time paradigm, model checking of safety properties is simpler than the general case, because safety properties can be captured by finite automata. This work discusses the theoretical and some of the practical issues related to model checking LTL properties. Our first contribution is a theorem relating abstraction for Coloured Petri nets as defined by Lakos  and preservation of safetydoi:10.1007/3-540-44829-2_5 fatcat:zlkczcjjdfeijoekb66ohrtpe4