Abstract
In this paper, a new type of high-level Petri nets is defined, which is a combination of predicate transition nets and first order temporal logic. By combining these two formalisms together, we can explicitly specify the structure, and specify and verify various properties of concurrent systems in the same framework, which we cannot achieve by using either one of the formalisms alone. Therefore a more powerful formalism for the specification and verification of concurrent systems is obtained. The application of temporal predicate transition nets is illustrated through the specification and verification of the five dining philosophers problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
