Petri nets: an introduction
Reduction and covering of infinite reachability trees
Information and Computation
Well-structured transition systems everywhere!
Theoretical Computer Science
On Proving Large Distributed Systems: Petri Net Modules Verification
PaCT '97 Proceedings of the 4th International Conference on Parallel Computing Technologies
ICAL '99 Proceedings of the 26th International 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
From Coloured Petri Nets to Object Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Multi-Agent-Systems Based on Coloured Petri Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Petri Nets as Token Objects: An Introduction to Elementary Object Nets
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Towards a Modular Analysis of Coloured Petri Nets
Proceedings of the 13th 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
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
A Systematic Approach towards Object-Based Petri Net Formalisms
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
On the Qualitative Analysis of Conformon P Systems
Membrane Computing
Boundedness of adaptive nets is decidable
Information Processing Letters
Nested nets for adaptive systems
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Modelling mobility with petri hypernets
WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques
Checking Properties of Adaptive Workflow Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
The Reachability Problem for Object Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Modeling Dynamic Objects in Distributed Systems with Nested Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Comparing Concepts of Object Petri Net Formalisms
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Nested Petri Nets: Multi-level and Recursive Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Shuffle expressions and words with nested data
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Conservative Elementary Object Systems
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Hi-index | 0.00 |
Nested Petri nets are Petri nets using other Petri nets as tokens, thereby allowing easy description of hierarchical systems. Their nested structure makes some important verification problems undecidable (reachability, boundedness, . . . ) while some other problems remain decidable (termination, inevitability, . . . ).