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

He, X. (1992). Temporal predicate transition nets—a new formalism for specifying and verifying concurrent systems . INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 45(3-4), 171-184. 10.1080/00207169208804127

cited authors

  • He, X

authors

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. © 1992, Taylor & Francis Group, LLC. All rights reserved.

publication date

  • January 1, 1992

published in

Digital Object Identifier (DOI)

start page

  • 171

end page

  • 184

volume

  • 45

issue

  • 3-4