Parallel computation of the reachability graph of petri net models with semantic information (original) (raw)
2016, Software: Practice and Experience
DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Related papers
A Technique for Reachability Graph Generation for the Petri Net Models of Parallel Processes
Reachability graph (RG) generation suffers from the problem of exponential space and time complexity. To alleviate the more critical problem of time complexity, this paper presents the new approach for RG generation for the Petri net (PN) models of parallel processes. Independent RGs for each parallel process in the PN structure are generated in parallel and cross-product of these RGs turns into the exhaustive state space from which the RG of given parallel system is determined. The complexity analysis of the presented algorithm illuminates significant decrease in the time complexity cost of RG generation. The proposed technique is applicable to parallel programs having multiple threads with the synchronization problem.
Mathematical programming approach to the Petri nets reachability problem
European Journal of Operational Research, 2007
This paper focuses on the resolution of the reachability problem in Petri nets, using the mathematical programming paradigm. The proposed approach is based on an implicit traversal of the Petri net reachability graph. This is done by constructing a unique sequence of Steps that represents exactly the total behaviour of the net. We propose several formulations based on integer and/or binary linear programming, and the corresponding sets of adjustments to the particular class of problem considered. Our models are validated on a set of benchmarks and compared with standard approaches from IA and Petri nets community.
A Review of Petri Net Modeling of Dynamical Systems
2012
Petri nets are graphical and mathematical modeling tools which are gaining popularity in recent years. It is a tool for the representation of complex logical systems, such as synchronization, sequentially, concurrency and conflict. The present introduction highlights some of the formalism of Petri nets with special emphasis on reachability and coverability analysis. We have also extended our topic by explaining place & transition invariance with examples.
A Graph Theoretic Approach: Petri net
Int. J. of Mathematical Sciences and Applications, 2011
This work attempts to understand some of the basic properties of Petri nets and their relationships to directed bipartite graphs. Different forms of directed graphs are widely used in computer science. Normally various names are given to these structures. E.g. directed acyclic graphs (DAGs), control flow graphs (CFGs), task graphs, generalized task graphs (GTGs), state transition diagrams (STDs), state machines, etc. Some structures might exhibit bi-similarity. The justification for this work is that Petri nets are based on graphs and have some similarities to them. Transforming Petri nets into graphs opens up a whole set of new interesting possible experimentations. Normally this is overlooked. Directed Graphs have a lot of theory and research associated with them. This work could be further developed and used for Petri net evaluation. The related works justifies the reasoning how and why Petri nets are obtained or supported using graphs. The transformation approach can be formal or informal. The main problem tackled is how graphs can be obtained from Petri nets. Possible solutions that use reduction methods to simplify the Petri net are presented. Different methods to extract graphs from the basic or fundamental Petri net classes are explained. Some examples are given and the findings are briefly discussed.
The Possibilities of Modeling Petri Nets and Their Extensions
Computer Simulation [Working Title], 2019
This chapter is dedicated to several structure features of Petri nets. There is detailed description of appropriate access in Petri nets and reachable tree mechanism construction. There is an algorithm that describes the minimum sequence of possible transitions. The algorithm developed by us finds the shortest possible sequence for the network promotion state, which transfers the mentioned network state to the coverage state. The corresponding theorem is proven, which states that due to the describing algorithm, the number of transitions in the covering state is minimal. This chapter studies the interrelation of languages of colored Petri nets and traditional formal languages. The Venn diagram, modified by the author, is presented, which shows the relationship between the languages of the colored Petri nets and some traditional languages. As a result, it is shown that the language class of colored Petri nets includes an entire class of context-free languages and some other classes. The results obtained show that it is not possible to model the Patil problem using the well-known semaphores P and V or classical Petri nets, so the mentioned systems have limited properties.
Reachability Graphs and Invariants for Stochastic High Level Petri Nets
The paper investigates the properties of Stochastic High Level Petri nets. The research is motivated by the idea of using Slll..PNs as high level descriptions of stochastic models. An algorithm for constructing the reachabiliry graph is presented and the invariants of a Stochastic High Level Petri net are discussed.
A new graphical framework, Abridged Petri Nets (APNs) is introduced for bottom-up modeling of complex stochastic systems. APNs are similar to Stochastic Petri Nets (SPNs) in as much as they both rely on component-based representation of system state space, in contrast to Markov chains that explicitly model the states of an entire system. In both frameworks, so-called tokens (denoted as small circles) represent individual entities comprising the system; however, SPN graphs contain two distinct types of nodes (called places and transitions) with transitions serving the purpose of routing tokens among places. As a result, a pair of place nodes in SPNs can be linked to each other only via a transient stop, a transition node. In contrast, APN graphs link place nodes directly by arcs (transitions), similar to state space diagrams for Markov chains, and separate transition nodes are not needed. Tokens in APN are distinct and have labels that can assume both discrete values ("colors") and continuous values ("ages"), both of which can change during simulation. Component interactions are modeled in APNs using triggers, which are either inhibitors or enablers (the inhibitors' opposites). Hierarchical construction of APNs rely on using stacks (layers) of submodels with automatically matching color policies. As a result, APNs provide at least the same modeling power as SPNs, but, as demonstrated by means of several examples, the resulting models are often more compact and transparent, therefore facilitating more efficient performance evaluation of complex systems.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Related papers
Analysis of Petri net models using transitive matrix
SMC 2000 Conference Proceedings. 2000 IEEE International Conference on Systems, Man and Cybernetics. 'Cybernetics Evolving to Systems, Humans, Organizations, and their Complex Interactions' (Cat. No.00CH37166), 2000