Dependency Analysis-A Petri-Net-Based Technique for Synthesizing Large Concurrent Systems

Authors:
Y. Chen;W. T. Tsai;D. Chao
Affiliations:
-;-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1993

Citing 8
Cited 6

An Implementation of an Automated Protocol Synthesizer (APS) and Its Application to the X.21 Protocol

IEEE Transactions on Software Engineering - Special issue on COMPSAC 1982 and 1983
Synchronic distance

Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Concurrent system analysis using Petri nets: an optimized algorithm for finding net invariants

Computer Communications
Synthesis of a Class of Deadlock-Free Petri Nets

Journal of the ACM (JACM)
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems
Modular Synthesis of Deadlock-Free Control Structures

Proceedings of the Sixth Conference on Foundations of Software Technology and Theoretical Computer Science
Transformations and Decompositions of Nets

Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I
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

Compositional verification of concurrent systems using Petri-net-based condensation rules

ACM Transactions on Programming Languages and Systems (TOPLAS)
Model and Algorithm for Efficient Verification of High-Assurance Properties of Real-Time Systems

IEEE Transactions on Knowledge and Data Engineering
Behavior relativity of Petri nets

Journal of Computer Science and Technology
Petri nets analysis of transaction and submitter management protocols in mobile distributed computing environment

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Synthesis a Petri net based control model for a FMS cell

Computers in Industry
Petri nets for protocol engineering

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Petri nets (PNs) are frequently used in modeling, designing, and analyzing concurrentsystems. A problem with PNs, in the general case, is that they require high computationalcomplexity to analyze their properties, such as reachability, liveness, and boundedness.To avoid this problem, synthesis techniques for constructing large PNs are presented.Using these techniques, the behavior of the constructed PN can be determined by localanalysis that uses known properties of the given nets. Thus, the high computationalcomplexity of global analysis is bypassed. A synthesis technique that exploresdependency relations in PNs is presented. It synthesizes large PNs by combining smallerPNs of arbitrary topology structures, and the combination is verified efficiently bydependency analysis. A large system based on a PN can be built up by repeatedapplications of the technique.