In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
We study syntax-free models for name-passing processes. For interleaving semantics, we identify the indexing structure required of an early labelled transition system to support t...
It has been shown that secret information can be leaked to external observers through covert timing channels. In this paper we are concerned with a kind of timing attack that want...