Choices in business processes are often based on the process history saved as a log-file listing events and their time stamps. In this paper we introduce LogLogics, a finite-path variant of the Timed Propositional Temporal Logic with Past, which can be in particular used for specifying guards in business process models. The novelty is due to the presence of boundary points corresponding to the ...

We give an explicit construction of the increasing tree-valued process introduced by Abraham and Delmas using a random point process of trees and a grafting procedure. This random point process will be used in companion papers to study record processes on Lévy trees. We use the Poissonian structure of the jumps of the increasing tree-valued process to describe its behavior at the first time the...

This paper focuses on the empirical autocovariance operator of H-valued periodically correlated processes. It will be demonstrated that the empirical estimator converges to a limit with the same periodicity as the main process. Moreover, the rate of convergence of the empirical autocovariance operator in Hilbert-Schmidt norm is derived.

Consider a single server queue with renewal arrivals and i.i.d. service times in which the server operates under a processor sharing service discipline. To describe the evolution of this system, we use a measure valued process that keeps track of the residual service times of all jobs in the system at any given time. From this measure valued process, one can recover the traditional performance ...

Consider a single server queue with renewal arrivals and i.i.d. service times in which the server operates under a processor sharing service discipline. To describe the evolution of this system, we use a measure valued process that keeps track of the residual service times of all jobs in the system at any given time. From this measure valued process, one can recover the traditional performance ...

We look at extensions (i.e., stronger logics in the same language) of the Belnap-Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap-Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterize the reduced algebraic models of these new logics and prove a completeness result for the first ...