Automata-Based Programming for the Development of a Web based Application: A Case Study
Pages 118 - 123
Abstract
The software design of web based applications using the automata-based programming approach is studied. An indicative case study is developed. The case is the Web Based Application of an Innovation and Entrepreneurship Unit. The software is modelled using finite state machines (deterministic automata). A supervisor of the automaton is developed in order to support the efficient and accurate functionality of the software and compensate overload due to client's requests. The supervisor scheme is based on the prioritization, availability and privileges of the clients.
References
[1]
Abdelzaher, T.F., Stankovic, J.A., Lu, C., Zhang, R. and Lu Y. 2003. Feedback Performance Control in Software Services. IEEE Control Systems, 23(3): 74--90, June 2003.
[2]
Karlsson, M., Xiaoyun, Z. and Karamanolis, C. 2005. An adaptive optimal controller for non-intrusive performance differentiation in computing services. International Conference on Control and Automation (ICCA '05), June 26-29, Budap est, Hungary.
[3]
Selic, D. and Leo, M. 2003. Using Models in Real-time Software Design, IEEE Control Systems Magazine, 23(3):31--42.
[4]
Shaly to, A.A. 1991. Programmatic implementation of control automata, Marine industry: " Automation and remote control", issue 13, pp. 41, 42.
[5]
Tukkel, N.I., and Shalyto, A.A. 2001. State-based programming", PC World., vol. 8, pp. 116--121 and vol. 9, pp. 132--138.
[6]
Casandras, C. G. and Lafortune, S. 1999. Introduction to Discrete Event Systems, Springer.
[7]
Gomaa, H. and Hussein, M. 2007. Model-Based Software Design and Adaptation. Proc. ACM/IEEE ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems, Minneapolis.
[8]
Spalter, A. M., and Dam, A. V. 2003. Problems with using components in educational software. Computers & Graphics 27, pp. 329--337.
[9]
Gomaa, H. 2006. A Software Modeling Odyssey: Designing Evolutionary Architecture-centric Real-Time Systems an d Product Lines. Proc. 9th International Conference on Model-Driven Engineering, Languages and Systems, Genova, Italy.
[10]
Kang K. C. et. al. 1990. Feature-Oriented Domain Analysis. Technical Report No CMU/SEI-90-TR-21. Software Engineering Institute, November 1990.
[11]
Cheng, S., Garlan, D., Schmerl, B., Sousa, J., Spitznagel, B., and Steenkiste, P. 2002. Using Architectural Style as a Basis for Selfrepair. The Working IEEE/IFIP Conference on Software Architecture, Montreal, August 25-31.
[12]
Shalyto, A.A. 1995. Cognitive Properties of Hierarchical Representations of Complex Logical Structures. Proceeding of the 1995 International Symposium on Intelligent Control (ISIC). Workshop, Monterey. California.
[13]
Paraschenko, D., Tsarev, F., and Shalyto, A. 2006. Modeling Technology for One Class of MultiAgent Systems with Automata Based Programming. Proceedings of 2006 IEEE International Conference on Computational Intelligence for Measurement Systems and Application (IEEE CIMSA- 2006), Spain.
[14]
Ulyantsev, V. and Tsarev F. 2011. Extended Finite-State Machine Induction using SAT-Solver. 10th International Conference on Machine Learning and Applications, Honolulu, USA.
Recommendations
Limited Automata and Context-Free Languages
Non-Classical Models of Automata and Applications VLimited automata are one-tape Turing machines which are allowed to rewrite each tape cell only in the first d visits, for a given constant d. For each d ≥ 2, these devices characterize the class of context-free languages. We investigate the equivalence ...
On the power of quantum finite state automata
FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer ScienceIn this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts ...
Descriptional complexity of limited automata
A k-limited automaton is a linear bounded automaton that may rewrite each tape cell only in the first k visits, where k0 is a fixed constant. It is known that these automata accept context-free languages only. We investigate the descriptional complexity ...
Comments
Information & Contributors
Information
Published In
September 2016
126 pages
ISBN:9781450348102
DOI:10.1145/2984393
Copyright © 2016 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 25 September 2016
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
SEEDA-CECNSM '16
SEEDA-CECNSM '16: SouthEast European Design Automation, Computer Engineering, Computer Networks and Social Media Conference
September 25 - 27, 2016
Kastoria, Greece
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 115Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in