Exact solution of general integer systems of linear equations
ACM Transactions on Mathematical Software (TOMS) - The MIT Press scientific computation series
QPN-Tool for qualitative and quantitative analysis of queueing Petri nets
Proceedings of the 7th international conference on Computer performance evaluation : modelling techniques and tools: modelling techniques and tools
GreatSPN 1.7: graphical editor and analyzer for timed and stochastic Petri nets
Performance Evaluation - Special issue: performance modeling tools
TimeNET: a toolkit for evaluating non-Markovian stochastic Petri nets
Performance Evaluation - Special issue: performance modeling tools
Stubborn sets for model checking the EF/AG fragment of CTL
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Algorithm 406: exact solution of linear equations using residue arithmetic [F4]
Communications of the ACM
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
A Simple and Fast Algorithm to Obtain All Invariants of a Generalized Petri Net
Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets
Algorithm Design: Foundations, Analysis and Internet Examples
Algorithm Design: Foundations, Analysis and Internet Examples
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
A new reachability algorithm for general Petri nets is proposed. Given a Petri net with an initial and a target markings, a so called complemented Petri net is created first that consists of the given Petri net and an additional, complementary transition. Thereby, the reachability task is reduced to calculation and investigation of transition invariants (T-invariants) of the complemented Petri net. The algorithm finds all minimal-support T-invariants of the complemented Petri net and then calculates a finite set of linear combinations of minimal-support T-invariants, in which the complementary transition fires only once. Finally, for each T-invariant with a single firing of the complementary transition, the algorithm tries to create a reachability path from initial to target marking or determines that there is no such path.