OB(PN)2: an object based petri net programming notation

  • Authors:
  • Johan Lilius

  • Affiliations:
  • -

  • Venue:
  • Concurrent object-oriented programming and petri nets
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present the object-based language OB(PN)2, together with its semantics, defined as a translation into a class of highlevel Petri nets. This translation defines the semantics of a OB(PN)2 program as a net, which can be analyzed using existing reachability analysis tools. The OB(PN)2 language is an extension of B(PN)2 as defined by Best and Hopkins, and the semantics is inspired by the B(PN)2 semantics defined in terms of M-nets. The semantics is interesting from two points of view: it lays the foundations for the development of automatic verification methods of concurrent programs written in object-oriented languages, and it can be seen as a set of rules for the translation of object-oriented specifications written in an object-oriented specification formalism into Petri-nets. The translation relies on the CCS-like composition operators defined for M-nets. Each program construct is translated to a box (a special kind of net) or an operation for combining boxes. Thus in essence each program is translated into an expression in the algebra of boxes.