@inproceedings{2410a804c5e346938016f0eb75996ad0,
title = "Network invariants in action",
abstract = "The paper presents the method of network invariants for verifying a wide spectrum of lt l properties, including liveness, of parameterized systems. This method can be applied to establish the validity of the property over a system S(n) for every value of the parameter n. The application of the method requires checking abstraction relations between two finite-state systems. We present a proof rule, based on the method of Abstraction Mapping by Abadi and Lamport, which has been implemented on the tlv modelchecker and incorporates both history and prophecy variables. The effectiveness of the network invariant method is illustrated on several examples, including a deterministic and probabilistic versions of the dining-philosophers problem.",
author = "Yonit Kesten and Amir Pnueli and Elad Shahar and Lenore Zuck",
year = "2002",
month = jan,
day = "1",
doi = "10.1007/3-540-45694-5\_8",
language = "English",
isbn = "3540440437",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "101--115",
editor = "Lubos Brim and Mojmir Kretinsky and Antonin Kucera and Petr Jancar",
booktitle = "CONCUR 2002, Concurrency Theory - 13th International Conference, Proceedings",
address = "Germany",
note = "13th International Conference on Concurrency Theory, CONCUR 2002 ; Conference date: 20-08-2002 Through 23-08-2002",
}