Specifying and verifying temporal behavior of high assurance systems using reachability tree logic

The paper presents our reachability tree logic (RTL) and its integration with temporal Petri nets to specify and verify the temporal behavior of high assurance systems. In addition, we demonstrate how to reduce the complexity of a model checking algorithm by using the reachability tree. We have implemented a specification and verification toolkit called NCUPN (National Central University Petri Nets toolkit) using Java. NCUPN is now available on the Internet via http://140.115.50.137.