Abstract — Recently, with the emergence of mobile technology and mobile banking, debit and credit transactions have been the most common transactions that are widely spreading, using such technologies. In this research, we specify the concurrent debit and credit transactions in temporal logics such as CTL (Computational Tree Logic) and LTL (Linear-Time Temporal Logic). These specifications describe the infinite histories that may be produced by the iterations of such concurrent transactions infinitely many times. We represent the infinite histories as a model of temporal logics formulae. Then, model checkers, such as NuSMV or SPIN, can carry out exhaustive checks of the correctness of the concurrent debit and credit transactions. Moreover, ...
34 pagesInternational audienceThis paper presents a range of quantitative extensions for the tempora...
In the literature, two powerful temporal logic formalisms have been proposed for expressing informat...
AbstractClassical logic cannot be used to effectively reason about concurrent systems with inconsist...
The advent of mobile and web technologies has given rise to unlimited numbers of concurrent users ex...
We present an operator for a propositional linear temporal logic over infinite schedules of iterated...
Existing work in temporal logic on representing the execution of infinitely many transactions, uses ...
Most of the concurrent transactional protocols consider serializability as a correctness criterion o...
Executions of concurrent multi-step transactions interleave steps in ways that improve the throughpu...
We investigate an extension of CTL (Computation Tree Logic) by past modalities, called CTLP, interpr...
Ahstract:We give an cfticicnt procedure for verifying that a t%ute state concurrent systcm meets a s...
Concurrent systems have critical applications such as aviation. Due to their inherent complexity, me...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
The aim of this paper is to obtain advantages for integrity constraint checking in bitemporal deduct...
We describe PCTL, a temporal logic extending CTL with connectives allowing to refer to the past of a...
We define a new temporal logic called CTL[k-QDDC]. It extends CTL with the ability to specify branch...
34 pagesInternational audienceThis paper presents a range of quantitative extensions for the tempora...
In the literature, two powerful temporal logic formalisms have been proposed for expressing informat...
AbstractClassical logic cannot be used to effectively reason about concurrent systems with inconsist...
The advent of mobile and web technologies has given rise to unlimited numbers of concurrent users ex...
We present an operator for a propositional linear temporal logic over infinite schedules of iterated...
Existing work in temporal logic on representing the execution of infinitely many transactions, uses ...
Most of the concurrent transactional protocols consider serializability as a correctness criterion o...
Executions of concurrent multi-step transactions interleave steps in ways that improve the throughpu...
We investigate an extension of CTL (Computation Tree Logic) by past modalities, called CTLP, interpr...
Ahstract:We give an cfticicnt procedure for verifying that a t%ute state concurrent systcm meets a s...
Concurrent systems have critical applications such as aviation. Due to their inherent complexity, me...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
The aim of this paper is to obtain advantages for integrity constraint checking in bitemporal deduct...
We describe PCTL, a temporal logic extending CTL with connectives allowing to refer to the past of a...
We define a new temporal logic called CTL[k-QDDC]. It extends CTL with the ability to specify branch...
34 pagesInternational audienceThis paper presents a range of quantitative extensions for the tempora...
In the literature, two powerful temporal logic formalisms have been proposed for expressing informat...
AbstractClassical logic cannot be used to effectively reason about concurrent systems with inconsist...