@inproceedings{c1f71f4544d3404fba8b31b7ab76f5d7,
title = "Discrete-time Promela and Spin",
abstract = "Spin is a software package for the verification of concurrent systems. A system to be verified is modeled in Promela — Spin{\textquoteright}s input language. We present an extension of Promela and Spin with discrete time that provides an opportunity to model systems whose correct functioning crucially depends on timing parameters. This extension is completely compatible with all the features of the standard package, in particular the partial order reduction algorithm. We have tested the prototype tool on several applications known from the verification literature and the first results are promising.",
author = "D. Bosnacki and D.R. Dams",
year = "1998",
doi = "10.1007/BFb0055359",
language = "English",
isbn = "3-540-65003-2",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "307--310",
editor = "A.P. Ravn and H. Rischel",
booktitle = "Formal Techniques in Real-Time and Fault-Tolerant Systems (Proceedings 5th International Symposium, FTRTFT'98, Lyngby, Denmark, September 14-18, 1998)",
}