Conference ProceedingsOPEN ACCESS

Extending promela and spin for real time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1055 329-348
DOI: 10.1007/3-540-61042-1_53
53Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The efficient representation and manipulation of time information is key to any successful implementation of a verification tool. We extend the syntax and semantics of the higher level specification language Promela to include constructs and statements based on the model of timed Büchi automata [2]. We implement these extensions on top of the verification tool Spin.

Cite

CITATION STYLE

APA

Tripakis, S., & Courcoubetis, C. (1996). Extending promela and spin for real time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1055, pp. 329–348). Springer Verlag. https://doi.org/10.1007/3-540-61042-1_53

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free