We introduce a semidecidable procedure which, given a Petri net structure and a set T of transitions, synthesizes a supervisor enforcing the transitions in T to be live. We call this liveness property T -liveness. When T equals the total set of Petri net transitions, T -liveness corresponds to liveness. Enforcing only a subset of transitions to be live is useful when some Petri net transitions ...

Petri nets provide a powerful abstraction to specify and consequently analyze complex distributed systems. Petri nets can also be used in functioning systems to control processes and to manage the ow of data. RTNet, the software described in this paper, directly embeds a petri net into a distributed system and allows for real-time interaction of the petri net with other parts of the system. RTN...

This paper extends the power hierarchy of dependability models developed by Malhotra and Trivedi (1994) and Muppala et al. (2000) to include Piecewise Deterministic Markov Processes (PDP) and PDP-related Petri Nets. PDPs are known as the largest class of continuous-time hybrid state Markov processes not involving diffusions. Since Petri Nets have proven to be extremely useful in developing Mark...

On considère des réseaux de Petri colorés, à contraintes linéaires et pouvant posséder des arcs de lecture. Sur cette classe, on définit une sémantique concurrente en termes de processus d’ordre partiel permettant de garder explicite l’indépendance entre des tirs de transitions. L’ensemble des processus peut être représenté en utilisant la notion de dépliage symbolique. Nous montrons alors comm...

The article studies the interrelation of Languages of Colored Petri Nets and Traditional formal languages. The author constructed the graph of Colored Petri Net, which generates L Context-free language. This language may not be modeled using standard Petri Nets [1]. The Venn graph and diagram that the author modified [1], show the interrelation between languages of Colored Petri Nets and some T...

This paper gives a novel method of investigating flowsensitive pointer analysis for multithreaded program based on petri net. The method mainly borrows causal dataflow analysis idea from Azadeh Farzan. Petri net is used to describe control flow structure of multithreaded program. And pointer points-to information is propagated along causal dependencies of events in the partial order execution o...

Adding real time information to Petri net models often leads to undecidability of classical verification problems such as reachability and boundedness. For instance, models such as Timed-Transition Petri nets (TPNs) [22] are intractable except in a bounded setting. On the other hand, the model of TimedArc Petri nets [26] enjoys decidability results for boundedness and control-state reachability...

Specification techniques like Petri nets allow for the formal description and analysis of systems. Although tool support exists for many different Petri net classes and tasks, a domain-specific animation of net behavior, however, is not yet supported by many Petri net tools. In this contribution, we present a formal approach for the generic specification of several Petri net classes including a...

This paper presents basic guidelines for building Petri net ontology, which should enable using Petri nets on the Semantic Web and help establish a true Web community of Petri net users and applications. Available Petri net model descriptions give format definitions. Their main objective is to provide the syntax for sharing Petri net models between different applications. Some of these applicat...