ω-Petri Nets: Algorithms and Complexity (original) (raw)
Related papers
2013
A Reduced Reachability Tree for a Class of Unbounded Petri Nets
Decidability of Properties of Timed-Arc Petri Nets
Lecture Notes in Computer Science, 2000
On Petri Nets with Hierarchical Special Arcs
ArXiv, 2017
Linear time analysis of properties of conflict-free and general Petri nets
Luigi Laura, Paola Alimonti, Umberto Nanni
Theoretical Computer Science, 2011
Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies
Lecture Notes in Computer Science, 2005
Linear time algorithms for liveness and boundedness in conflict-free Petri nets
LATIN'92, 1992
Undecidability of coverability and boundedness for timed-arc Petri nets with invariants
Proc. of MEMICS, 2009
Reachability analysis for a class of Petri nets
Decidability and complexity of Petri nets with unordered data
Theoretical Computer Science, 2011
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Electronic Notes in Theoretical Computer Science, 2008
A Technique for Reachability Graph Generation for the Petri Net Models of Parallel Processes
Continuous Reachability for Unordered Data Petri Nets is in PTime
Lecture Notes in Computer Science, 2019
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
Lecture Notes in Computer Science, 2009
On persistent reachability in Petri nets
Information and Computation, 2013
Decidability Problems in Petri Nets with Names and Replication
Fundamenta Informaticae
A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
Electronic Proceedings in Theoretical Computer Science, 2012
On non-decidability of reachability for timed-arc Petri nets
Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)
The Possibilities of Modeling Petri Nets and Their Extensions
Computer Simulation [Working Title], 2019
Symbolic analysis of bounded Petri nets
IEEE Transactions on Computers, 2001
Accelerations for the Coverability Set of Petri Nets with Names
Fundamenta Informaticae, 2011
Decidability Issues for Petri Nets
BRICS Report Series, 1994
Extensions to the CEGAR Approach on Petri Nets
Acta Cybernetica, 2014
On the Upward/Downward Closures of Petri Nets
ArXiv, 2017
The Confluence Property for Petri Nets and its Applications
2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2006
Using Forward Reachability Analysis for Verification of Timed Petri Nets
Nord. J. Comput., 2007
Decidability results in firstorder hybrid petri nets. Discrete Event Dynamic Systems
2001
Optimal Reachability in Cost Time Petri Nets
Formal Modeling and Analysis of Timed Systems, 2017
Normal and sinkless petri nets
Journal of Computer and System Sciences, 1993
Discrete Parameters in Petri Nets
Lecture Notes in Computer Science, 2015
Petri nets properties related to the unboundness and analyzed using coverability multigraph
Journal of Applied Mathematics, Statistics and Informatics, 2014
“Truly concurrent” and nondeterministic semantics of discrete-time Petri nets
Programming and Computer Software, 2016