[2] Michael Köhler-Bußmeier. On the complexity of the reachability problem for safe, elementary hornets. Fundamenta Informaticae, 126, 2013. [3] Michael Köhler-Bußmeier and Frank Heitmann. Complexity results for

of communication channels for object nets. Fundamenta Informaticae, 93(1-

stochastic or continuous descriptions, and show that the stochastic and continuous models approximate each other. Although our framework is based on Petri nets, it can be applied more widely to other formalisms which are used to model and analyse biochemical networks. Motivation Biochemical reaction systems

to the classical representation of PN. Timed Petri nets and, in particular, Stochastic Petri nets (SPN) are the object of the second part of the notes. Finally, some fully developed examples enlighten peculiar aspects which di#erentiate PNs from other modelling techniques usual in reliability analysis. In few

Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the “token game ” is too intensional, even in its more abstract interpretations in term of nonsequential processes and monoidal

This volume consists of the contributions to the first international workshop on organizational modeling (OrgMod’09). The workshop took place as a satelite event of the 30th International Conference on Application and Theory

Abstract. State space generation suffers from the typical combinatorial explosion problem when dealing with industrial specifications. In particular, memory consumption while storing the state space must be tackled to verify safety properties. Decision Diagrams are a way to tackle this problem. However, their performance strongly rely on the way variables encode a system. Another way to fight combinatorial explosion is to hierarchically encode the state space of a system. This paper presents how we mix the two techniques via the hierarchization of a precomputed variable order. This way we obtain a hierarchical static order for the variables encoding a system. This heuristic was implemented and exhibits good performance.

exponen-tially with the size of the task set making exact schedulability analysis of this execution model a com-putationally expensive proposition. The formal method of Time Petri Net (TPN) has previously been used for schedulability analysis of preemptive and non-preemptive models. TPNs for P

Agents are abstractions for real-world autonomous and cooperating entities. Agent-oriented software development is the most promising approach for the development of complex systems. On the other hand, Petri nets are a good formalism for describing concurrency, synchronisation and causality. After

results. The paper also contains two decidability results. One concerns the Petri nets which are deterministic up to bisimilarity, the other concerns semilinear bisimulations and extends the result of [4] for Basic Parallel Processes. 1 Introduction The topic of the paper belongs to an interesting