A generalization of the procedure of Karp and Miller to well structured transition systems
14th International Colloquium on Automata, languages and programming
Introduction to algorithms
Reduction and covering of infinite reachability trees
Information and Computation
A Unified High-Level Petri Net Formalism for Time-Critical Systems
IEEE Transactions on Software Engineering
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Coloured Petri nets: basic concepts, analysis methods and practical use, vol. 2
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Proceedings on Mathematical Foundations of Computer Science
Self-Modifying Nets, a Natural Extension of Petri Nets
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Fundamental Structures in Well-Structured Infinite Transition Systems
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
The Minimal Coverability Graph for Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Petri Nets with Marking-Dependent Ar Cardinality: Properties and Analysis
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
A General Systematic Approach to Arc Extensions for Coloured Petri Nets
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Journal of Computer and System Sciences
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Forward Analysis for WSTS, Part II: Complete WSTS
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Nets with tokens which carry data
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Noetherian spaces in verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
A classification of the expressive power of well-structured transition systems
Information and Computation
Ordinal theory for expressiveness of well structured transition systems
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Language-based comparison of petri nets with black tokens, pure names and ordered data
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Bounded analysis and decomposition for behavioural descriptions of components
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
On the relationship between spatial logics and behavioral simulations
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
The theory of WSTS: the case of complete WSTS
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
On the coverability and reachability languages of monotonic extensions of Petri nets
Theoretical Computer Science
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
Hi-index | 0.00 |
Transition systems defined from recursive functions IN^p-IN^p are introduced and named WSNs, or well-structured nets. Such nets sit conveniently between Petri net extensions and general transition systems. In the first part of this paper, we study decidability properties of WSN classes obtained by imposing natural restrictions on their defining functions, with respect to termination, coverability, and four variants of the boundedness problem. We are able to precisely answer almost all the questions which arise, thus gaining much insight into old and new generalized Petri net decidability results. In the second part, we specialize our analysis to WSNs defined from affine functions, which elegantly encompass most Petri net extensions studied in the literature. Again, we study decidability properties of natural classes of affine WSN with respect to the above six computational problems. In particular, we develop an algorithm computing limits of iterated nonnegative affine functions, in order to decide the path-place variant of the boundedness problem for non-negative affine WSN.