Space upper bound analysis for transformation from elementary reference-net system to low-level P/T nets

Elementary Reference-nett Systems (ERS) is a class of Object-Oriented Petri Nets that follows the nets-within-nets paradigm. It combines theoretical properties as well as numerous practical needs for multi-agent-systems specification. However, it comes with some constraints that limit their expressiveness for automatic verification purposes due to the highly expressive nature of the underlying class of Petri nets. This article presents a set of transformation procedure from ERS to basic Petri nets in order to make verification feasible. It further establishes the space upper bound for the transformation which shows that the state space of the transformed P/T net grows exponentially as the number of object nets increases.Keywords: Petri nets, object orientation, agent systems, interaction, mobility, transformatio

Towards Efficient Verification of Elementary Object Systems

Elementary Object Systems (EOS) is a class of Object Petri Nets that follows the “nets-within-nets” paradigm. It combines several practical as well as theoretical properties for the needs of multi-agent-systems. However, it comes with some constraints that limit their expressiveness for automatic verification purposes due to the highly expressive nature of the underlying class of Petri nets. In this paper, we proposed a set of transformation rules from EOS to basic Petri nets nets and show isomorphism of the state spaces in order to make verification feasible

Modelling and Analysis of Distributed Program Execution in BETA Using Coloured Petri Nets

Recently, abstractions supporting distributed program execution in the object-oriented language BETA have been designed. A BETA object on one computer may invoke a remote object, i.e., an object hosted by another computer. In this project, the formalism of Coloured Petri Nets (CP-nets or CPN) is used to describe and analyse the protocol for remote object invocation. In the first place, we build a model in order to describe, understand, and improve the protocol. Remote object invocation in BETA is modelled on the level of threads (lightweight processes) with emphasis on the competition for access to critical regions and shared resources. Secondly, the model is analysed. It is formally proved that it has a set of desirable properties, e.g., absence of dead markings.Topics: Systemdesign and verfication using nets; higher-level nets models; computer tools for nets; experience with using nets, case studies; application of nets to protocols

Towards Efficient Verification of Elementary Object Systems

Elementary Object Systems (EOS) is a class of Object Petri Nets that follows the “nets-within-nets” paradigm. It combines several practical as well as theoretical properties for the needs of multi-agent-systems. However, it comes with some constraints that limit their expressiveness for automatic verification purposes due to the highly expressive nature of the underlying class of Petri nets. In this paper, we proposed a set of transformation rules from EOS to basic Petri nets nets and show isomorphism of the state spaces in order to make veri- fication feasible

Modeling of Object-Oriented Programs with Petri Net Structured Objects

The article presents a method for constructing a model of an object-oriented program in terms of multilabeled Petri nets. Only encapsulation - one of the three concepts of object-oriented paradigm - is considered. To model a different aspects of encapsulation a Petri net structured object is proposed. It consists of a Petri net defining its behavior and a set of organized access points specifying its structural properties. Formal composition operations to construct a program model from the models of its methods, classes, objects, functions, and modules are introduced and a source code translation algorithm to Petri net representation is proposed. A special section of the article considers in detail a process of model construction of a real object-oriented program (OOP). Source code of the program, figures with Petri net objects modeling different elements of the program and the resulting model of the program are presented

Internet enabled modelling of extended manufacturing enterprises using the process based techniques

The paper presents the preliminary results of an ongoing research project on Internet enabled process-based modelling of extended manufacturing enterprises. It is proposed to apply the Open System Architecture for CIM (CIMOSA) modelling framework alongside with object-oriented Petri Net models of enterprise processes and object-oriented techniques for extended enterprises modelling. The main features of the proposed approach are described and some components discussed. Elementary examples of object-oriented Petri Net implementation and real-time visualisation are presented

Object classification methods for application in FPGA based vehicle video detector

The paper presents a discussion of properties of object classification methods utilized in processing video streams from a camera. Methods based on feature extraction, model fitting and invariant determination are evaluated. Petri nets are used for modelling the processing flow. Data objects and transitions are defined which are suitable for efficient implementation in FPGA circuits. Processing characteristics and problems of the implementations are shown. An invariant based method is assessed as most suitable for application in a vehicle video detector

Decision Problems for Petri Nets with Names

We prove several decidability and undecidability results for nu-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of nu-PN strictly surpasses that of P/T nets. We prove that nu-PN are Well Structured Transition Systems. In particular, we obtain decidability of coverability and termination, so that the expressive power of Turing machines is not reached. Moreover, they are strictly Well Structured, so that the boundedness problem is also decidable. We consider two properties, width-boundedness and depth-boundedness, that factorize boundedness. Width-boundedness has already been proven to be decidable. We prove here undecidability of depth-boundedness. Finally, we obtain Ackermann-hardness results for all our decidable decision problems.Comment: 20 pages, 7 figure