Abstract
This paper investigates implementations of process algebras which are suitable for modeling concurrent realdtime systems. It suggests an approach for efficiently implementing realdtime semantics using dynamic priorities. For this purpose a process algebra with dynamic priority is defined, whose semantics corresponds onedtodone to traditional realdtime semantics. The advantage of the dynamicdpriority approach is that it drastically reduces the statedspace sizes of the systems in question while preserving all properties of their functional and realdtime behavior. The utility of the technique is demonstrated by a case study that deals with the formal modeling and verification of several aspects of the widelydused SCSId2 busdprotocol. The case study is carried out in the Concurrency Workbench of North Carolina, an automated verification tool in which the process algebra with dynamic priority is implemented. It turns out that the state space of the busdprotocol model is about an order of magnitude smaller than the one resulting from realdtime semantics. The accuracy of the model is proved by applying model checking for verifying several mandatory properties of the bus protocol.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
