scholarly journals Safety- and liveness-properties in propositional temporal logic: characterizations and decidability

1988 ◽  
Vol 21 (1) ◽  
pp. 403-417
Author(s):  
Wolfgang Thomas
Author(s):  
Abdelhakim Baouya ◽  
Salim Chehida ◽  
Saddek Bensalem ◽  
Marius Bozga

Many industrials consider blockchain as a technology breakthrough for cybersecurity, with use cases ranging from cryptocurrency system to smart contracts, and so forth. While IoT systems employ a lightweight communication protocol between physical objects, blockchain may ensure safe information gathering. Unfortunately, the mixture of both technologies has yet to be formally investigated regarding the consensus algorithm. In this paper, statistical model checking is applied to provide quantitative answers on whether the modeled system satisfies safety and liveness properties expressed in LTL temporal logic.


Author(s):  
Quentin Peyras ◽  
Jean-Paul Bodeveix ◽  
Julien Brunel ◽  
David Chemouil

AbstractFirst-Order Linear Temporal Logic (FOLTL) is particularly convenient to specify distributed systems, in particular because of the unbounded aspect of their state space. We have recently exhibited novel decidable fragments of FOLTL which pave the way for tractable verification. However, these fragments are not expressive enough for realistic specifications. In this paper, we propose three transformations to translate a typical FOLTL specification into two of its decidable fragments. All three transformations are proved sound (the associated propositions are proved in Coq) and have a high degree of automation. To put these techniques into practice, we propose a specification language relying on FOLTL, as well as a prototype which performs the verification, relying on existing model checkers. This approach allows us to successfully verify safety and liveness properties for various specifications of distributed systems from the literature.


2014 ◽  
Vol 490-491 ◽  
pp. 798-802
Author(s):  
Rui Chen ◽  
Shi Gong Long

.The Temporal logic of actions TLA is a logic for specifying and reasoning about concurrent systems, which make systems and their properties are expressed in the same logic. In this paper, we introduce the concurrent programming languages and behavior semantics, mainly describe safety properties and liveness properties in TLA and take NeedhamSchroeder symmetric key protocol as an example to illustrate how to specify these properties in concurrent program by TLA.


2009 ◽  
Vol 28 (11) ◽  
pp. 2874-2876 ◽  
Author(s):  
Xian-wei LAI ◽  
Shan-li HU ◽  
Zheng-yuan NING ◽  
Xiu-li WANG
Keyword(s):  

Author(s):  
Michael Germana

Chapter 2 examines Ralph Ellison’s Invisible Man as a text that ekphrastically simulates a moving or “peristrephic” panorama in general, and an antebellum antislavery panorama in particular. In the process, this chapter reads Ellison’s debut novel as a text indebted to and allusive of, while ironically commenting on, the life and career of celebrated fugitive and peristrephic panoramist Henry Box Brown, who shipped himself in a sealed wooden crate from Richmond to Philadelphia and thus from slavery to freedom in 1849. Brown’s subsequent efforts to navigate the terrain of abolitionist discourse within a white supremacist culture led him to create a moving panorama called the Mirror of Slavery, which chronicled the cruelties of slavery, yet ended with the promise of universal emancipation. In appropriating the visual grammar of the antislavery panorama, Ellison also extends its ambivalent temporal logic to create his own alternative history in service of the future.


1988 ◽  
Vol 11 (1) ◽  
pp. 49-63
Author(s):  
Andrzej Szalas

In this paper we deal with a well known problem of specifying abstract data types. Up to now there were many approaches to this problem. We follow the axiomatic style of specifying abstract data types (cf. e.g. [1, 2, 6, 8, 9, 10]). We apply, however, the first-order temporal logic. We introduce a notion of first-order completeness of axiomatic specifications and show a general method for obtaining first-order complete axiomatizations. Some examples illustrate the method.


Sign in / Sign up

Export Citation Format

Share Document