Comparative Analysis of Finite Automata and Pushdown Automata for an Elevator System

This chapter delves into the comparative analysis of finite automata (FA) and pushdown automata (PDA) for elevator control systems, addressing the limitations of traditional FA models in handling dynamic user demands and complex operations. The text explores the inefficiencies of FA, such as longer wait times and reduced energy usage, and introduces PDA as a solution with its stack-based memory system. The proposed methodology involves implementing both FA and PDA to evaluate their performance in handling state-based and memory-dependent operations. The FA implementation is detailed, including its state transitions and limitations, such as lack of memory and sequential processing. The PDA implementation is then presented, showcasing its ability to process floor requests hierarchically and handle nested or dependent requests. The chapter also discusses the language representation for both models, highlighting the regular language for FA and the context-free grammar for PDA. The comparative analysis reveals the advantages of PDA in providing better responsiveness and adaptability in elevator systems, aligning with the United Nations Sustainable Development Goal 11 for sustainable cities and communities.