Abstract
Net theory provides a formal approach to analysis and description of concurrent systems. Specifically, flexiblity and maintainability of control softwares for such systems are improved by Petri net-based descriptions. A clear seperation of events and conditions due to Petri net modelling improves system comprehension in various activity levels and opens up a new system viewpoint.
The hierarchical nature of Petri net-description reflects on a set of top-down design methodology as seen in industrial applications. Verification and validation can be done in mathematical way by examining, e.g., the liveness, safeness, and reachability on the nets. Invariants play a central role in structural analysis such as boundedness or consistency which in turn can validate the mutual exclusion in critical section or cyclic stational motion, respectively.
Synthesis aspect of a net theoretic approach is, however, presently far from satisfactory stage. Fusion and substitution of component nets should be based on more concrete equivalence notion of nets. Also, a formal way of global analysis via properties of components and their interconnections as briefly introduced here should be established to this end.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
B.T. Denvir et al. edited: The analysis of concurrent systems, Lecture notes in computer science 207, Springer-Verlag(i983)
E.W.Mayr: An algorithm for general Petri net reachability problem, Proc. of the 13th ann. ACM Symp. on Theory of Computing, Milwaukee, USA(1981)
M.H. Hack: The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition system, Project MAC, MIT, Cambridge, USA(1974)
R. Lipton: The reachability problem requires exponential space, Report 62, Yale University, New Haven, USA(1976)
F. Commoner et al.: Marked directed graphs, J. of Computer and System Science, 5, 511/523 (1971)
T. Murata: Circuit theoretic analysis and synthesis of marked graphs, IEEE Trans. on Circuit and Systems, CAS-24-7, 400/405 (1977)
J. Grabowski: On the analysis of switching circuit by means of Petri nets, Electronishe Informationsverarbeitung und Kybernetik, EIK 14, 611/617 (1978)
M.H. Hack: Analysis of production schemata by Petri nets, M.S. Thesis, TR-94, Project MAC, MIT, Cambridge, USA(1972)
R. Valette et al.: Putting Petri nets to work for controlling flexible manufacturing systems, Proc. of the IEEE International Symposium on Circuits and Systems, Kyoto, Japan(1985)
E.Sibille et al.: Nets as formalisms, methods and tools for specification of large real time systems, Proc. of the 7th European Workshop on Application and Theory of Petri nets, Oxford, England(1986)
R. Threadgold: Application of Petri nets to the maintenance of a large software system, Proc. of the 7th European Workshop on Application and Theory of Petri nets, Oxford, England(1986)
T. Murata et al.: A Petri net-based controller for flexible and maintainable sequence contril and its applications in factory automation, IEEE Trans. on Industrial Electronics, IE-33, 1, 1/8 (1986)
Y.Nakamura et al.: The reachability of complementary-place Petri nets, Proc. of the IEEE International Symposium on Circuits and Systems, San Jose, California, USA(1986)
T.Tsuji, S.Kumagai, S.Kodama, and T.Yamada: Modeling and verification of sequential control systems by Petri nets, Proc. of the IEEE International Symposium on Circuits and Systems, San Jose, California, USA(1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag
About this paper
Cite this paper
Kumagai, S. (1988). Modelling and analysis of distributed systems: A net theoretic approach. In: Byrnes, C.I., Kurzhanski, A.B. (eds) Modelling and Adaptive Control. Lecture Notes in Control and Information Sciences, vol 105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0043183
Download citation
DOI: https://doi.org/10.1007/BFb0043183
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19019-6
Online ISBN: 978-3-540-38904-0
eBook Packages: Springer Book Archive