Jih-Ming, F.U.F.U.Jih-MingLee Trong-YenHsiung, P.-A.P.-A.HsiungSAO-JIE CHEN2018-09-102018-09-10200009168532http://www.scopus.com/inward/record.url?eid=2-s2.0-0034272095&partnerID=MN8TOARShttp://scholars.lib.ntu.edu.tw/handle/123456789/289909Most of current codesign tools or methodologies only support validation in the form of cosimulation and testing of design alternatives. The results of hardware-software codesign of a distributed system are often not verified, because they are not easily verifiable. In this paper, we propose a new formal coverification approach based on linear hybrid automata, and an algorithm for automatically converting codesign results to the linear hybrid automata framework. Our coverification approach allows automatic verification of real-time constraints such as hard deadlines. Another advantage is that the proposed approach is suitable for verifying distributed systems with arbitrary communication patterns and system architecture. The feasibility of our approach is demonstrated through several application examples. The proposed approach has also been successfully used in verifying deadline violations when there are inter-task communications between tasks with different period lengths.Coverification; Distributed embedded systems; Hard deadline; Hardware-software codesign; Linear hybrid automataCoverification method; Hardware-software codesign; Algorithms; Automata theory; Computer hardware; Computer software; Constraint theory; Distributed computer systems; Embedded systemsjournal article2-s2.0-0034272095