Solutions proposed for the longstanding problem of automatic decomposition of Petri nets into concurrent processes, as well as methods developed in Grenoble for the automatic conversion of safe Petri nets to NUPNs (Nested-Unit Petri Nets), require certain properties to be computed on Petri nets. We notice that, although these properties are theoretically interesting and practically useful, they are not currently implemented in mainstream Petri net tools. Taking into account such properties would open fruitful research directions for tool developers, and new perspectives for the Model Checking Contest as well
With the aim of significantly increasing the modeling capability of Petri nets, we suggest models th...
Abstract. This paper introduces PeCAn, a tool supporting composi-tional verification of Petri nets. ...
Abstract: Model-Checking is a formal verified technique to check on whether a computing model, by se...
International audiencePetri nets can express concurrency and nondeterminism but not hierarchy. This ...
International audiencePetri nets can express concurrency and nondeterminism but neither locality nor...
Model Checking consists in verifying if a model of a given system meets a set of requirements. The m...
The date of receipt and acceptance will be inserted by the editor Abstract. Model checking based on ...
Model checking(MC) techniques attracts attention of computer science for more than 30 years as a way...
International audienceThe interleaving of concurrent processes actions leads to the well-known combi...
Abstract. This article presents the results of the Model Checking Contest held within the SUMo 2011 ...
Abstract—Nested Petri nets is an extension of Petri net formal-ism with net tokens for modelling mul...
Benchmarking is a fundamental activity to rigorously quantify the improvements of a new approach or ...
Abstract. Benchmarking is a fundamental activity to rigorously quantify the im-provements of a new a...
International audienceWe define a method for taking advantage of net reductions in combination with ...
Bounded Petri nets are in this paper reduced by an incremental abstraction method based on visible b...
With the aim of significantly increasing the modeling capability of Petri nets, we suggest models th...
Abstract. This paper introduces PeCAn, a tool supporting composi-tional verification of Petri nets. ...
Abstract: Model-Checking is a formal verified technique to check on whether a computing model, by se...
International audiencePetri nets can express concurrency and nondeterminism but not hierarchy. This ...
International audiencePetri nets can express concurrency and nondeterminism but neither locality nor...
Model Checking consists in verifying if a model of a given system meets a set of requirements. The m...
The date of receipt and acceptance will be inserted by the editor Abstract. Model checking based on ...
Model checking(MC) techniques attracts attention of computer science for more than 30 years as a way...
International audienceThe interleaving of concurrent processes actions leads to the well-known combi...
Abstract. This article presents the results of the Model Checking Contest held within the SUMo 2011 ...
Abstract—Nested Petri nets is an extension of Petri net formal-ism with net tokens for modelling mul...
Benchmarking is a fundamental activity to rigorously quantify the improvements of a new approach or ...
Abstract. Benchmarking is a fundamental activity to rigorously quantify the im-provements of a new a...
International audienceWe define a method for taking advantage of net reductions in combination with ...
Bounded Petri nets are in this paper reduced by an incremental abstraction method based on visible b...
With the aim of significantly increasing the modeling capability of Petri nets, we suggest models th...
Abstract. This paper introduces PeCAn, a tool supporting composi-tional verification of Petri nets. ...
Abstract: Model-Checking is a formal verified technique to check on whether a computing model, by se...