Abstract
A key challenge in component-based system integration is to ensure the correctness of the integrated system in terms of liveness and boundedness, especially as there involve distributed components competing for some shared resources. This paper proposes a formal integration method for distributed component-based systems using proper augmented marked graphs. A subclass of Petri nets, proper augmented marked graphs possess a special structure for modelling systems with shared resources and desirable properties pertaining to liveness and boundedness. By composing a set of proper augmented marked graphs via common resource places, liveness and boundedness can be preserved under simple conditions. In this paper, based on the theory of proper augmented marked graphs, the modelling and integration of distributed component-based systems with shared resources are elaborated and illustrated.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Haskins, C. (ed.): INCOSE Systems Engineering Handbook: A Guide for System Life Cycle Processes and Activities. International Council of System Engineering (2010)
Leavens, G.T., Sitaraman, M. (eds.): Foundations of Component-Based Systems. Cambridge University Press (2000)
Chu, F., Xie, X.: Deadlock Analysis of Petri Nets Using Siphons and Mathematical Programming. IEEE Transactions on robotics and Automation 13(5) (1997)
Cheung, K.S.: Augmented Marked Graphs. Informatica 32(1), 85–94 (2008)
Cheung, K.S.: Augmented Marked Graphs. Springer (2014)
Cheung, K.S.: Proper Augmented Marked Graphs. In: Cheung, K.S. (ed.) Augmented Marked Graphs, pp. 55–66. Springer (2014)
Peterson, J.L.: Petri Net Theory and the Modeling of System. Prentice-Hall (1981)
Reisig, W.: Petri Nets: An Introduction. Springer (1985)
Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEEÂ 77(4) (1989)
Cheung, K.S.: New Characterisation for Live and Reversible Augmented Marked Graphs. Information Processing Letters 92(5), 239–243 (2004)
Cheung, K.S., Chow, K.O.: Cycle-Inclusion Property of Augmented Marked Graphs. Information Processing Letters 94(6), 271–276 (2005)
Cheung, K.S.: Boundedness and Conservativeness of Augmented Marked Graphs. IMA Journal of Mathematical Control and Information 24(2), 235–244 (2007)
Chen, C.L., Chin, S.C., Yen, H.C.: Reachability Analysis of Augmented Marked Graphs via Integer Linear Programming. The Computer Journal 53(6), 623–633 (2009)
Cheung, K.S., Chow, K.O.: Manufacturing System Design Using Augmented Marked Graph. In: Proceedings of the Chinese Control Conference, South China University of Technology, pp. 1209–1213 (2005)
Cheung, K.S.: Augmented Marked Graphs and the Analysis of Shared Resource Systems. In: Kordic, V. (ed.) Petri Net: Theory and Application, pp. 377–400. I-Tech Publishing (2008)
Dijkstra, E.W.: Cooperating Sequential Processes. In: Genuys, F. (ed.) Programming Languages, Academic Press, London (1965)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Cheung, K.S. (2014). Component-Based System Integration Using Proper Augmented Marked Graphs. In: Zhang, X., Liu, H., Chen, Z., Wang, N. (eds) Intelligent Robotics and Applications. ICIRA 2014. Lecture Notes in Computer Science(), vol 8917. Springer, Cham. https://doi.org/10.1007/978-3-319-13966-1_49
Download citation
DOI: https://doi.org/10.1007/978-3-319-13966-1_49
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13965-4
Online ISBN: 978-3-319-13966-1
eBook Packages: Computer ScienceComputer Science (R0)