The Logic of Temporal Domination

Studer, Thomas (March 2019). The Logic of Temporal Domination. In: RIVF 2019. Proceedings (pp. 1-4). IEEE 10.1109/RIVF.2019.8713701

[img] Text
temporalDomination.pdf - Published Version
Restricted to registered users only
Available under License Publisher holds Copyright.

Download (197kB) | Request a copy

In this short note, we are concerned with the fairness condition “A and B hold almost equally often”, which is important for specifying and verifying the correctness of nonterminating processes and protocols. We introduce the logic of temporal domination, in which the above condition can be expressed. We present syntax and semantics of our logic and show that it is a proper extension of linear time temporal logic. In order to obtain this result, we rely on the corresponding result for k-counting automata.

Item Type:

Conference or Workshop Item (Paper)

Division/Institute:

08 Faculty of Science > Institute of Computer Science (INF) > Logic and Theory Group (LTG)
08 Faculty of Science > Institute of Computer Science (INF)

UniBE Contributor:

Studer, Thomas

Subjects:

000 Computer science, knowledge & systems
500 Science > 510 Mathematics

ISBN:

978-1-5386-9313-1

Publisher:

IEEE

Language:

English

Submitter:

Nenad Savic

Date Deposited:

21 Oct 2019 09:54

Last Modified:

27 Oct 2019 02:46

Publisher DOI:

10.1109/RIVF.2019.8713701

BORIS DOI:

10.7892/boris.133988

URI:

https://boris.unibe.ch/id/eprint/133988

Actions (login required)

Edit item Edit item
Provide Feedback