{"title":"An automata-based approach for addressing erroneous behaviors and deadlocks in component-based systems","authors":"Maria Pittou, George Rahonis","doi":"10.1016/j.tcs.2024.115052","DOIUrl":null,"url":null,"abstract":"<div><div>In component-based modeling, a system is built by constructing several coordinating components. In turn, the communication principles among components are modeled by architectures that characterize the permissible interactions and the topology of the components. Several architectures impose also order restrictions to the appearance of the permissible interactions. The application of an architecture to a component-based system does not guarantee that the behaviors of the system meet all the requirements of the architecture. In turn, this can lead the system to actions that do not follow the intended order of the interactions, which we call erroneous behaviors. In this paper, we tackle the problem of such order violations by introducing a formal framework for building component-based systems that avoid erroneous behaviors. For this, we formalize the systems by nondeterministic finite automata and we model their architecture by a fragment of extended propositional interaction logic. This logic achieves to encode the order restrictions in the occurrence of the permissible interactions of the architecture. Given a component-based system with an architecture, we propose an automata-based method for constructing a respective system without erroneous behaviors. Our algorithm returns a system that is also free of deadlocks, meaning that the system does not reach states from which it can no longer progress.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1030 ","pages":"Article 115052"},"PeriodicalIF":0.9000,"publicationDate":"2025-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524006698","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
In component-based modeling, a system is built by constructing several coordinating components. In turn, the communication principles among components are modeled by architectures that characterize the permissible interactions and the topology of the components. Several architectures impose also order restrictions to the appearance of the permissible interactions. The application of an architecture to a component-based system does not guarantee that the behaviors of the system meet all the requirements of the architecture. In turn, this can lead the system to actions that do not follow the intended order of the interactions, which we call erroneous behaviors. In this paper, we tackle the problem of such order violations by introducing a formal framework for building component-based systems that avoid erroneous behaviors. For this, we formalize the systems by nondeterministic finite automata and we model their architecture by a fragment of extended propositional interaction logic. This logic achieves to encode the order restrictions in the occurrence of the permissible interactions of the architecture. Given a component-based system with an architecture, we propose an automata-based method for constructing a respective system without erroneous behaviors. Our algorithm returns a system that is also free of deadlocks, meaning that the system does not reach states from which it can no longer progress.
期刊介绍:
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.