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 presents an Interval Decision Diagram (IDD) based approach to realize symbolically transient analysis of Continuous Time Markov Chains (CTMC) which are derived from stochastic Petri nets. Matrix-vector and vector-matrix multiplication are the major tasks when doing exact analysis of CTMCs. We sketch a simple algorithm which uses explicitly the Petri net structure and offers the oppor...

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

Petri, C. A. , Kommunikation mit automaten, Schriften des Institutes fur Instrumentelle Mathematik, Bonn, 1962. Callou, G. , Macial, P. , Tutsch, D. , Araujo, J. , Ferreira, J. and Souza, R. , A Petri net-based approach to the quantification of data center dependability. In: Petri nets—Manufacturing and Computer Science (Ed. : Pawel Pawlewski), 2012, 313-336. Dassow, J. , Mavlankulov, G. , Othm...

This paper presents the EXHOST-PIPE software: an extension of PIPE – Platform Independent Petri net Editor – that complies with our own specifications. The new version supports the two kinds of Petri nets we have developed: particle Petri nets and plan Petri nets. EXHOST-PIPE also supports colours, modularity, time, guards, differential equations. . . The Petri net player has been extended and ...