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

Petri nets are used to study many types of networked systems. [1] have designed a software tool for analysis and simulation of Petri nets. We extend this tool to handle a form of Petri net known as Predicate Transition (PrT) nets. We implement mechanisms that automate the process of folding a Petri net to a PrT net and finding invariants. We can compute invariants for systems that use either Pe...

Biometric Identification Protocol with Random Parameter is modelled in the current paper by using Petri Nets, namely with the modern extension of Petri Nets-Colored Petri Nets. The purpose of modelling Biometric Identification Protocol with Random Parameter by the use of Petri Nets is to reveal the following aspects of the functioning model: The efficiency of the model; Behaviour; The existence...

We show that the so-called ‘Petri nets are monoids’ approach initiated by Meseguer and Montanari can be extended from ordinary place/transition Petri nets to contextual nets by considering suitable nonfree monoids of places. The algebraic characterizations of net concurrent computations we provide cover both the collective and the individual token philosophy, uniformly along the two interpretat...

In this paper the dynamic modeling of repairable and standby components of complex systems is analyzed using Petri Nets and ladder logic diagrams. The use of Petri Nets as modelling of a complex system avoids two basic disadvantages of Markov chain analysis. First, the Petri Net model does not grow in size as increasing the number of components and second, Markov chain has been limited to the e...

System analysis is often needed with respect to both qualitative and quantitative aspects. In the last decades, several formalisms have been developed that attempt to combine these aspects in one description. Present emphasis is on Stochastic Petri Nets. Amongst others, one disadvantage of these formalisms lies with the diiculties when describing scheduling strategies with Petri Net elements. T...

In this paper we aim to set up a framework for object Petri net semantics, allowing the modification of object net structures at runtime. The approach uses linear logic Petri nets (LLPNs) and performs the structure modification on a linear logic encoding of the object net. In addition, Valk’s self-modifying Petri nets are shown to be subsumed by LLPNs. We expand on the existing theory of Farwer...

This paper presents a new class of model in the field of topical algebra whose time evolution belongs to intervals. The lower and upper bounds depend on the maximization, minimization and addition operations, simultaneously. A motivation for the current study is the modelling of Time Petri nets like Time Stream Petri Nets and P-time Petri nets which extend Timed Petri Nets and generalize the se...

In this article I will prove undecidability results for elementary object net systems (Eos). Object nets are Petri nets which have Petri nets as tokens – an approach which is called the “nets-within-nets” paradigm. Eos are special object net system which have a two leveled structure.