Temporal predicate transition nets—a new formalism for specifying and verifying concurrent systems

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.

Keywords:

• Petri nets
• predicate transition nets
• temporal predicate transition nets
• temporal logic
• specification
• verification

C.R.Categories:

• D.2.1
• D.2.2
• F.3.1

¹This research was partially supported by an National Science Foundation EPSCoR grant ST1-8610675, U.S.A.

¹This research was partially supported by an National Science Foundation EPSCoR grant ST1-8610675, U.S.A.

Notes

¹This research was partially supported by an National Science Foundation EPSCoR grant ST1-8610675, U.S.A.