Recently, we have proposed a comprehensive agent-based e-commerce system. While UML formalized, it lacked details how basic functions – e.g. user request to purchase a given pro...
Maciej Gawinecki, Maria Ganzha, Pawel Kobzdej, Mar...
Recently we have proposed the ”almost ASAP” semantics as an alternative semantics for timed automata. This semantics is useful when modeling real-time controllers : control str...
The execution time of software for hard real-time systems must be predictable. Further, safe and not overly pessimistic bounds for the worst-case execution time (WCET) must be com...
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
Task scheduling forreactive real time systems is a di cult problem due to tight constraints that the schedule must satisfy. A static priority scheme is proposed here that can be f...
Felice Balarin, Alberto L. Sangiovanni-Vincentelli