Abstract
The problem of controlling concurrent processes that compete for access to shared resources is considered. The processes are controlled by a pair (an initial state, a set of dispatching rules) that guarantees steady cyclic flows. A proposal of an automated prototyping procedure of a system is considered to aid determining desired system flows for assumed factors such as system capacity or the value of rate of resource utilisation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baccelli F.G., et al., 1992. Synchronization and linearity. In: An algebra for discrete event systems, John Wiley & Sons, Chichester.
Banaszak Z., Polak M., 2002, Buffers vs. Initial State and Priority Rules Allocation, Proceedings of the 8th International Symposium on “Methods and Models in Automation and Robotics”, Kaszyński R. Ed., 2–5 September, Szczecin, Poland, Vol. 2, 1109–1114
Banaszak Z.A., Polak M., 2002, Deadlock-free distributed control for repetitive flows, Proceedings of the 6th Int. Workshop on Discrete Event Systems, October 2–4, Zaragoza, Spain, 273–278.
Camus, H., H. Ohl, O. Korbaa and J.C. Gentina 1996, Cyclic schedules in flexible manufacturing systems with flexibilities in operating sequences. Proceedings of the Workshop on Manufacturing and Petri Nets, Osaka, Japan, 97–116.
Fanti, M.P., B. Maione, G. Piscitelli and B. Turchiano, 1996. System approach to design generic software for real-time control of flexible manufacturing systems. IEEE Trans. on Systems, Man, and Cybernetics. 26, 190–202.
Lawley M.A., Reveliotis S.A., Ferreira P.M., 1998, A correct and scalable deadlock avoidance policy for flexible manufacturing systems. IEEE Trans. on Robotics and Automation, 14, 796–809.
Lee, T. and J. Song 1996. Petri net modeling and scheduling of periodic job shops with blocking. Proceedings of the Workshop on Manufacturing and Petri Nets, Osaka, Japan, 197–214.
Ramamritham, K. 1995. Allocation and scheduling of precedence-related periodic tasks. IEEE Trans. on Parallel and Distributed Systems, 6, 412–420.
Spiridon A. Reveliotis, Mark A. Laweley, Placid M. Ferreira, 1997, Polynomialcomplexity deadlock avoidance policies for sequential resource allocation systems. IEEE Trans. on Automatic Control, 42, 1344–1357
Zaremba M.B., Banaszak Z.A., Majdzik P., Jędrzejek K.J., 1999, Distributed Flow control design for repetitive manufacturing processes. Proceedings of the 14th Triennial Worlds Congress of IFAC, July 5–9, Beijing, P.R. China, A, 1–6.
Zaremba M.B., K.J. Jedrzejek and Z.A. Banaszak 1998. Design of steady-state behaviour of concurrent repetitive processes: An algebraic approach. IEEE Trans. on Systems, Man, and Cybernetics, 28, 199–212
Zaremba M.B. and Z.A. Banaszak, 1995. Performance evaluation for concurrent processing in cyclic systems. Concurrent Engineering: Research and Applications, 3, 123–130.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science + Business Media, Inc.
About this chapter
Cite this chapter
Banaszak, Z., Polak, M. (2005). Concurrent Processes Flow Prototyping. In: Dolgui, A., Soldek, J., Zaikin, O. (eds) Supply Chain Optimisation. Applied Optimization, vol 94. Springer, Boston, MA. https://doi.org/10.1007/0-387-23581-7_7
Download citation
DOI: https://doi.org/10.1007/0-387-23581-7_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23566-0
Online ISBN: 978-0-387-23581-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)