Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
In recent years light-weighted formal methods are of growing interest in construction and analysis of complex concurrent software system. A new rule-action based term rewriting fr...
In this paper, we address the problem of real-time video streaming over a bandwidth and energy constrained wireless sensor network (WSN) from a small number of dispersed video-sen...
Min Chen, Victor C. M. Leung, Shiwen Mao, Yong Yua...
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...
Mourad Boudia, Mohamed Aly Ould Louly, Christian P...
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...