It is known that modeling an information source via a symbolic dynamical system evolving over the unit interval, leads to a natural lossless compression scheme attaining the entro...
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
The preemptive real-time scheduling of sporadic parallel task systems is studied. We present an algorithm, called Gang EDF, which applies the Earliest Deadline First (EDF) policy ...
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
Abstract. We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open ...