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
Coupling Asynchrony and Interrupts: Place Chart Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
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
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Model checking lossy vector addition systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Verification of Embedded Reactive Fiffo Systems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Decidability of Reachability Problems for Classes of Two Counters Automata
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Some Decidability Results for Nested Petri Nets
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Discovery, Verification and Conformance of Workflows with Cancellation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Lossy counter machines decidability cheat sheet
RP'10 Proceedings of the 4th international conference on Reachability problems
Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Forward analysis and model checking for trace bounded WSTS
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
BPM'06 Proceedings of the 4th international conference on Business Process Management
Achieving a general, formal and decidable approach to the OR-Join in workflow using reset nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed petri nets
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
On the termination of integer loops
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Decidability Problems of a Basic Class of Object Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Complexity of the soundness problem of bounded workflow nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
On the Termination of Integer Loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
On selective unboundedness of VASS
Journal of Computer and System Sciences
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Complexity of the Soundness Problem of Workflow Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
P/T nets with reset and transfer arcs can be seen as counter-machines with some restricted set of operations. Surprisingly, several problems related to boundedness are harder for Reset nets than for the more expressive Transfer nets. Our main result is that boundedness is undecidable for nets with three reset arcs, while it is decidable for nets with two resetable places.