Object based Petri nets are becoming increasingly popular in many fields of computer science. The possibility to model real-world objects as separate Petri nets supports the need for modular design of complex systems. So far object net approaches have been based on the presumption that the object nets’ structure remains unchanged in all processes. This paper sheds some light on possible extensi...

There is an increasing interest both in the Object-Oriented and the Petri net community for an integration of the concepts of the two approaches. Although the proposals for « objects and Petri nets » are numerous and widely different, there seems to be two major trends « Objects inside Petri net » versus « Petri net inside Objects ». We state here the basic paradigm of these two trends, and bri...

We define encodings of a Process Hitting into a Petri Net and conversely. It results notably that • the Process Hitting is a sub-class of Petri Nets; • any safe Petri Net can be encoded into a weakly-bisimilar Process Hittings with 3 priority classes. We finally discuss the use of the encoding of a Petri Net into a Process Hitting for providing efficient static analysis of dynamical properties.

The tool Snoopy provides a unifying Petri net framework which has particularly many application scenarios in systems and synthetic biology. The framework consists of two levels: uncoloured and coloured. Each level comprises a family of related Petri net classes, sharing structure, but being specialized by their kinetic information. Petri nets of all net classes within one level can be converted...

We consider asynchronously composed I/O-Petri nets (AIOPNs) with built-in communication channels. They are equipped with a compositional semantics in terms of asynchronous I/O-transition systems (AIOTSs) admitting infinite state spaces. We study various channel properties that deal with the production and consumption of messages exchanged via the communication channels and establish useful rela...

Since the ability to describe dynamic in high level, Petri Nets has already been used extensively in logic circuits and systems community for state analysis. As others formal methods, extending Petri Nets to analog circuits analysis requires continuous feature enhanced. In this paper, the object of study is dynamic of circuits with random nonlinear feature (such as random noise and random inter...

In this paper, we revisit the conjecture of [1], stating that ε-free Petri nets with transfer arcs are strictly more expressive than ε-free Petri nets with reset arcs. In [1], an ε-free Petri net with transfer arcs is provided, whose language is conjectured not to be recognizable by any ε-free Petri net with reset arcs. We show that this latter conjecture is flawed, by exhibiting an ε-free Petr...

In the domain of concurrent object-oriented programming (COOP) there is a strong need for a formalism to describe concurrency. Such a formalism is ooered by Petri nets, which however lack thorough modularisation techniques for coping with models for large systems. An appropriate combination of COOP and Petri nets is required in order to proot from the strength of both methods. This paper gives ...

A new approach to model multi-agent systems with hierarchical colored Petri nets is introduced. Every agent has its colored Petri net system, when agents are composed into a MAS, we get hierarchical colored Petri net system of the multi-agent system, properties of the hierarchical colored Petri net system, such as reachability, deadlock detection and avoidance, fairness can be used to analyze d...

In this paper, we study some classes of Petri net deenable !-languages. We consider several types of accepting conditions on Petri nets, corresponding to those considered on nite automata in the theory of !-regular languages. Then, we establish a neat correspondence between the classes of Petri net deenable !-languages and the classes of nite automata deenable !-languages. Moreover, each class ...