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 ...

Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues. We first relate different notions of diagnosability and opacity. We consider in particular fairness issues and extend the definition of Germanos et al. [ACM TECS, 2015] of weakly fair diagnosability for safe Petri nets to general...

|Stochastic Petri nets (SPNs) with generally distributed ring times can model a large class of systems, but simulation is the only feasible approach for their solution. We explore a hierarchy of SPN classes where modeling power is reduced in exchange for an increasingly eecient solution. Generalized stochastic Petri nets (GSPNs), deter-ministic and stochastic Petri nets (DSPNs), semi-Markovian ...

We compare various classes of Petri net languages. We present a new constructive proof of the equivalence, from the point of view of descriptive power, of “general” Petri nets and “restricted” Petri nets (no multiple arcs nor self-loops are allowed in the latter class). We also comment on the descriptive power of Petri nets versus that of finitely recursive processes.

Stochastic Petri nets (SPNs) with generally distributed firing times can model a large class of systems, but simulation is the only feasible approach for their solution. We explore a hierarchy of SPN classes where modeling power is reduced in exchange for an increasingly efficient solution. Generalized stochastic Petri nets (GSPNs), deterministic and stochastic Petri nets (DSPNs), semi-Markovia...