Abstract
In general, the modeling and analysis of algorithmic systems involve discrete structural elements. However, the modeling and analysis of recursive algorithmic systems can be done in the form of differential equation following control theoretic approaches. In this paper, the modeling and analysis of generalized algorithmic systems are proposed based on heuristics along with z-domain formulation in order to determine the stability of the systems. The recursive algorithmic systems are analyzed in the form of differential equation for asymptotic analysis. The biplane structure is employed for determining the boundary of the recursions, stability and, oscillatory behaviour. This paper illustrates that biplane structural model can compute the convergence of complex recursive algorithmic systems through periodic perturbation.
Chapter PDF
Similar content being viewed by others
References
Abraham, A.: Neuro Fuzzy Systems: Sate-of-the-Art Modeling Techniques. In: Mira, J., Prieto, A.G. (eds.) IWANN 2001. LNCS, vol. 2084, pp. 269–276. Springer, Heidelberg (2001)
Reisig, W.: Elements of distributed algorithms: modeling and analysis with petri nets. Springer (1998)
Bisnik, N., Abouzeid, A.: Modeling and analysis of random walk search algorithms in P2P networks. In: Second International Workshop on Hot Topics in Peer-to-Peer Systems (HOT-P2P 2005), pp. 95–103. IEEE (2005)
Olveczky, P.C., Thorvaldsen, S.: Formal modeling and analysis of wireless sensor network algorithms in Real-Time Maude. In: 20th International Symposium on Parallel and Distributed Processing (IPDPS 2006). IEEE (2006)
Leu, A.E., Mark, B.L.: Modeling and analysis of fast handoff algorithms for microcellular networks. In: 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS 2002). IEEE (2002)
Ozsu, M.T.: Modeling and Analysis of Distributed Database Concurrency Control Algorithms Using an Extended Petri Net Formalism. IEEE Transactions on Software Engineering SE-11(10) (1985)
Keinert, J., Haubelt, C., Teich, J.: Modeling and Analysis of Windowed Synchronous Algorithms. In: 2006 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2006). IEEE (2006)
Chi, C., Cai, X., Hao, R., Liu, F.: Modeling and Analysis of Handover Algorithms, Global Telecommunications Conference (GLOBECOM 2007). IEEE (2007)
Rudolph, G.: Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks 5(1) (1994)
Ljung, L.: Analysis of recursive stochastic algorithms. IEEE Transactions on Automatic Control 22(4) (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bagchi, S. (2013). Analyzing Stability of Algorithmic Systems Using Algebraic Constructs. In: Mustofa, K., Neuhold, E.J., Tjoa, A.M., Weippl, E., You, I. (eds) Information and Communication Technology. ICT-EurAsia 2013. Lecture Notes in Computer Science, vol 7804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36818-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-36818-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36817-2
Online ISBN: 978-3-642-36818-9
eBook Packages: Computer ScienceComputer Science (R0)