This paper presents a framework for specifying and verifying distributed real-time object-oriented systems. An earlier paper [18] introduced a process calculus for describing distributed objects using local clocks. It was based on synchronous communication and thus could not sufficiently model asynchronous communication in distributed systems. In this paper we propose a new process calculus with the ability to express asynchronous message passing, communication delay, and delayed processing. It can describe temporal and behavioral properties of distributed real-time objects. Based on the new calculus, we develop a verification method by means of algebraic order relations. The relations are speed-sensitive and can decide whether two distributed real-time objects are behaviorally equivalent and whether one of them can perform its behaviors faster than the other. They offer a suitable method for proving the correctness and reusability of real-time objects in asynchronous communication settings. Some examples are shown to demonstrate the calculus and the relations.
CITATION STYLE
Satoh, I., & Tokoro, M. (1995). Time and asynchrony in interactions among distributed real-time objects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 952, pp. 331–350). Springer Verlag. https://doi.org/10.1007/3-540-49538-x_16
Mendeley helps you to discover research relevant for your work.