We describe some examples using an extension of Kurshan’s COSPAN system to verify bounded delay constraints in a dense time model, based on the method proposed by Dill for adding timing constraints to Büchi automata. The S/R model and COSPAN are reviewed as background, then we describe how timing can be incorporated into S/R processes, and briefly describe the modified verification algorithm. The examples consist of several time-dependent versions of the Alternating Bit Protocol and the Fiber Distributed Data Interface (FDDI).
CITATION STYLE
Courcoubetis, C., Dill, D., Chatzaki, M., & Tzounakis, P. (1993). Verification with real-time COSPAN. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 663 LNCS, pp. 274–287). Springer Verlag. https://doi.org/10.1007/3-540-56496-9_22
Mendeley helps you to discover research relevant for your work.