Mobile computing systems, service-based systems and some other with mobile interacting components have recently received much attention. However, because of their characteristics such as mobility disconnection, it is difficult to model analyze them by using a structure-fixed model. This work proposes new Petri net called Variable Net (VPN) for modeling analyzing these systems. The definition, f...

Constraint Handling Rules (CHR) is a declarative rulebased concurrent committed-choice programming language. Petri nets are a well-known formalism for modeling and analysis of concurrent processes. We aim to develop a framework to exploit Petri nets as a tool for the modeling and analysis of CHR programs. In this paper, we show that place/transition nets can easily be embedded into CHR and we d...

We show that there are Σ 3 -complete languages of infinite words accepted by non-deterministic Petri nets with Büchi acceptance condition, or equivalently by Büchi blind counter automata. This shows that ω-languages accepted by non-deterministic Petri nets are topologically more complex than those accepted by deterministic Petri nets.

This paper shows a way to use stochastic Petri nets as formal availability models instead of Markov chains. Advantages of stochastic Petri nets over Markov models are illustrated on example models. The ability of stochastic Petri nets to represent the structure of modelled design and its use in further research is introduced.

An extension of Petri nets with a statechart-like AND/OR state hierarchy is defined and studied. The resulting net variant, statechart nets, is shown to coincide, under certain conditions, with a strict subclass of safe nets in which concurrency is structured. Next, syntactic constraints on statechart nets are defined that guarantee absence of deadlocks and livelocks. Such syntactic constraints...