The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficie...
Increasingly, a number of applications across computer sciences and other science and engineering disciplines rely on, or can potentially benefit from, analysis and monitoring of d...
Abstract. This paper presents a framework of specification and verification for distributed real-time object-oriented systems. An earlier paper [17] introduced a process calculus...
Given the intractability of exhaustively verifying software, the use of runtime-verification, to verify single execution paths at runtime, is becoming popular. Although the use of ...
Christian Colombo, Gordon J. Pace, Gerardo Schneid...
- This paper proposes a "mechanism-based PKI", in which only a mechanism for generating user's private keys is installed on a smart card. The private key is generate...