Distributed versions of linear time temporal logic: A trace perspective (1998) [12 citations — 2 self]
Download:
|
|
by P. S. Thiagarajan, Jesper G. Henriksen
Lecture Notes in Computer Science
http://www.brics.dk/users/gulmann/Papers/distr_survey.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Thiagarajan98distributedversions,author = {P. S. Thiagarajan and Jesper G. Henriksen},
title = {Distributed versions of linear time temporal logic: A trace perspective},
booktitle = {Lecture Notes in Computer Science},
year = {1998},
pages = {643--681}
}
Years of Citing Articles
Abstract:
Linear time Temporal Logic (LTL) as proposed by Pnueli [37] has become a well established tool for specifying the dynamic behaviour of distributed systems. A basic feature of LTL is that its formulas are interpreted over sequences. Typically,
Citations
| 241 | On a decision method in restricted second order arithmetic – Büchi - 1962 |
| 41 | Model-checking of causality properties – Alur, Peled, et al. - 1995 |
| 7 | D.: Representation of computations in concurrent automata by dependence orders. Theoretical Computer Science 174(1-2 – Bracho, Droste, et al. - 1997 |
| 7 | nets, traces, and local model checking – Cheng - 1995 |
| 5 | Design Automation: FormalCheck tm . Further information can be obtained at http://www.bell-labs.com/formalcheck – Labs |
