As digital systems are introduced to nuclear power plants, issues related with reliability analyses of these digital systems are being raised. One of these issues is that static Fault Tree (FT) and Event Tree (ET) approach cannot properly account for dynamic interactions in the digital systems, such as multiple top events, logic loops and time delay. This study proposes an approach to analyzing...

Programming the behavior of multi-robot systems is a challenging task which has a key role in developing effective systems in many application domains. In this paper, we present Petri Net Plans (PNPs), a language based on Petri Nets (PNs), which allows for intuitive and effective robot and multi-robot behavior design. PNPs are very expressive and support a rich set of features that are critical...

We set the ground for research on a timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. The novelty is that, rather than a single global clock, we use a set of unrelated clocks — possibly one per place — allowing a local timing as well as distributed time synchronisation. We give a formal...

Scheduling of flexible manufacturing systems is one of problems in NP-Hard optimization. The aim of scheduling of these systems is to maximize the system efficiency by finding an optimal planning for a better cooperation among various processes. In recent years many algorithms proposed to solve this problem, and most of them are based on heuristic methods. In This paper we have proposed a new a...

This paper introduces a new semantics for FIFO buffers (usually called channels) in a parallel programming language, B(PN). This semantics is given in terms of M-nets, which form an algebra of labelled high-level Petri nets. The proposed approach uses the asynchronous link operator, newly introduced in the algebra of M-nets, and repairs some drawbacks of the original M-net semantics. Channels a...

This paper presents an environment to automatically generate coordination rules from coloured Petri nets models.

Structural product form and decomposition results for stochastic Petri nets are surveyed, unified and extended. The contribution is threefold. First, the literature on structural results for product form over the number of tokens at the places is surveyed and rephrased completely in terms of T -invariants. Second, based on the underlying concept of group-local-balance, the product form results ...

This paper considers the appropriate properties for abstract net components in the Coloured Petri Net formalism. In doing so, it attempts to maintain the duality between places and transitions which is so foundational to Petri Net theory. It also defines what it means to execute the net at an abstract level.