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.
CITATION STYLE
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
Mendeley helps you to discover research relevant for your work.