Thanh-Binh Trinh, H. Nguyen, Dinh-Hai Nguyen, Van-Khanh To, Ninh-Thuan Truong
{"title":"在运行时检查 EBS 中事件的时间限制","authors":"Thanh-Binh Trinh, H. Nguyen, Dinh-Hai Nguyen, Van-Khanh To, Ninh-Thuan Truong","doi":"10.2478/cait-2024-0005","DOIUrl":null,"url":null,"abstract":"\n As a kind of software system, the Event-Based Systems (EBS) respond to events rather than executing a predefined sequence of instructions. Events usually occur in real time, so it is crucial that they are processed in the correct order and within temporal constraints. The objective of this work is to propose an approach to check if events of EBS at runtime preserve the specification of temporal constraints. To form the approach by logic process, we have formalized the EBS model, through which, we have proved that the complexity of the checking algorithms is only polynomial. The approach has been implemented as a tool (VER) to check EBS at runtime automatically. The results of the proposed method are illustrated by checking a real-world Event Driven Architecture (EDA) application, an Intelligent transportation system.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Checking Temporal Constraints of Events in EBS at Runtime\",\"authors\":\"Thanh-Binh Trinh, H. Nguyen, Dinh-Hai Nguyen, Van-Khanh To, Ninh-Thuan Truong\",\"doi\":\"10.2478/cait-2024-0005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n As a kind of software system, the Event-Based Systems (EBS) respond to events rather than executing a predefined sequence of instructions. Events usually occur in real time, so it is crucial that they are processed in the correct order and within temporal constraints. The objective of this work is to propose an approach to check if events of EBS at runtime preserve the specification of temporal constraints. To form the approach by logic process, we have formalized the EBS model, through which, we have proved that the complexity of the checking algorithms is only polynomial. The approach has been implemented as a tool (VER) to check EBS at runtime automatically. The results of the proposed method are illustrated by checking a real-world Event Driven Architecture (EDA) application, an Intelligent transportation system.\",\"PeriodicalId\":45562,\"journal\":{\"name\":\"Cybernetics and Information Technologies\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2024-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cybernetics and Information Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/cait-2024-0005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cybernetics and Information Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/cait-2024-0005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Checking Temporal Constraints of Events in EBS at Runtime
As a kind of software system, the Event-Based Systems (EBS) respond to events rather than executing a predefined sequence of instructions. Events usually occur in real time, so it is crucial that they are processed in the correct order and within temporal constraints. The objective of this work is to propose an approach to check if events of EBS at runtime preserve the specification of temporal constraints. To form the approach by logic process, we have formalized the EBS model, through which, we have proved that the complexity of the checking algorithms is only polynomial. The approach has been implemented as a tool (VER) to check EBS at runtime automatically. The results of the proposed method are illustrated by checking a real-world Event Driven Architecture (EDA) application, an Intelligent transportation system.