Petri Nets with Non-blocking Arcs are Difficult to Analyze
Reads0
Chats0
TLDR
This paper studies the decidability of five problems on a class of extended Petri nets motivated by the problem of parametric verification of multiple copies of processes that can communicate with a partially non-blocking rendez-vous.About:
This article is published in Electronic Notes in Theoretical Computer Science.The article was published on 2004-08-02 and is currently open access. It has received 3 citations till now. The article focuses on the topics: Petri net & Stochastic Petri net.read more
Citations
More filters
Journal ArticleDOI
On the ω-language Expressive Power of Extended Petri Nets
TL;DR: This paper compares the expressive power of Petri nets extended with non-blocking arcs and Petrinets extended with transfer arcs, in terms of ω-languages, and shows that the hierarchy of expressive powers of those models is strict.
The Fixpoint checking problem: an abstraction refinement perspective
TL;DR: In this article, a model-checker is fed with a model of the system (which capture all its possible behaviors) and a property to verify on this model, which is given by a convenient mathematical formalism like a transition system for the model and a temporal logic formula for the property.
Journal ArticleDOI
Boundedness undecidability for synchronized nets
TL;DR: A model of synchronized Petrinets (SSPN), a popular extension of the Petri Nets model that allows to model concurrent systems embedded into an environment is presented and is likely that it is possible to define synthesis rules allowing to construct new bounded synchronized nets from the known one.
References
More filters
Journal ArticleDOI
Parallel program schemata
TL;DR: This paper introduces a model called the parallel program schema for the representation and study of programs containing parallel sequencing, related to Ianov's program schema, but extends it, both by modelling memory structure in more detail and by admitting parallel computation.
Journal ArticleDOI
Well-structured transition systems everywhere!
Alain Finkel,Ph. Schnoebelen +1 more
TL;DR: Improved definitions of well-structured transition systems allow many examples of classical systems to be seen as instances of WSTSs and show several new results.
Journal ArticleDOI
An Algorithm for the General Petri Net Reachability Problem
TL;DR: An algorithm is presented for the general Petri net reachability problem, based on a generalization of the basic reachability tree construction which is made symmetric with respect to the initial and final marking.
Journal ArticleDOI
Reasoning about systems with many processes
TL;DR: Methods are given for automatically verifying temporal properties of concurrent systems containing an arbitrary number of finite-state processes that communicate using CCS actions and how these decision procedures can be used to reason about certain systems with a communication network.
Proceedings ArticleDOI
General decidability theorems for infinite-state systems
TL;DR: This paper presents decidability results for a class of systems, which consist of a finite control part operating on an infinite data domain, and shows that the following properties are decidable for well-structured systems: reachability; eventuality; and simulation.