We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as conflict-free, BPP, normal Petri nets and more. A new decomposition approach is applied to developing an integer linear programming formulation for characterizing the reachability sets of such Petri nets. Consequentl...

The increasing number of Petri net variants naturally leads to the question whether the term “Petri net” is more than a common name for very different concepts. This contribution tries to identify aspects common to all or at least to most Petri nets. It concentrates on those features where Petri nets significantly differ from other modeling languages, i.e. we ask where the use of Petri nets lea...

Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling an...

This paper presents a modeling methodology for designing networked agents systems. It focuses on the agent hybrid state representation, its dynamic behavior, and its interaction with neighbor agents. The agent’s internal state as well as the communication interface between agents is modeled using timed hybrid Petri nets. The methodology is illustrated through the modeling of a case study relate...

The product form results recently published for Stochastic Petri Nets are combined with the well known product form results for Queueing Networks in the model formalism of Queueing Petri Nets yielding the class of product form Queueing Petri Nets. This model class includes Stochastic Petri Nets with product form solution and BCMP Queueing Networks as special cases. We introduce an arrival theor...

In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...

In this paper, we study the expressive power of several monotonic extensions of Petri nets. We compare the expressive power of Petri nets, Petri nets extended with nonblocking arcs and Petri nets extended with transfer arcs, in terms of ω-languages. We show that the hierarchy of expressive powers of those models is strict. To prove these results, we propose original techniques that rely on well...

Nested Petri nets (NP-nets) is an extension of the Petri nets formalism within the “nets-within-nets” approach, when tokens in a marking are themselves Petri nets which have autonomous behavior and synchronize with the system net. The formalism of NP-nets allows modeling multi-level multi-agent systems with a dynamic structure in a natural way. In this paper we define branching processes and un...

This paper introduces Petri Nets (Peterson 1981) into the vexed question of lexical semantic representation. We argue that Petri Nets can offer new insights into the organization of lexical meaning. Petri Nets can furthermore be translated directly into linear logic, thus ensuring compatibility with the glue logic semantic construction already defined within LFG (Dalrymple 1999). The potential ...

Lopes, Bruno; Haeusler, Edward Hermann (advisor); Dowek, Gilles (coadvisor). Extending Propositional Dynamic Logic for Petri Nets. Rio de Janeiro, 2014. 101p. D.Sc. Thesis — Departamento de Informática, Pontif́ıcia Universidade Católica do Rio de Janeiro. Propositional Dynamic Logic (PDL) is a multi-modal logic used for specifying and reasoning on sequential programs. Petri Net is a widely used ...