Linking STeP with SPIN

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We have connected STeP, the Stanford Temporal Prover, with SPIN, an LTL model checker. In this paper we describe the translation of fair transition systems into Promela, in particular how weak and strong fairness constraints are handled. The paper presents some preliminary experimental results using this connection.

Cite

CITATION STYLE

APA

Browne, A., Sipma, H., & Zhang, T. (2000). Linking STeP with SPIN. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1885, pp. 181–186). Springer Verlag. https://doi.org/10.1007/10722468_11

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