We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bounded language inclusion for timed automata is 2EXPSPACE-Complete. We also investigate the satisfiability and model-checking problems for Metric Temporal Logic (MTL), as well as monadic firstand second-order logics over the rea...

most accidents happens because of lack of visibility and not driver’s reaction on time whenan accident occurs. increasing required time for driver’s reaction caused to decreasingaccidents on roadways .intelligent vehicle networks brings enough time for reaction by sendingalert and alternate messages to vehicles on roadway. main propose in this paper is aroundmodulation on reception interval saf...

This paper proposes a voting scheme that coalesces many features of an efficient e-voting scheme like receipt-freeness, uncoercibility, E2E verifiable and write-in ballot. Some of the previous schemes in the past literatures provide most of these features at the cost of increased running time. This paper proposes a simple and efficient voting scheme that is coercion resistant and E2E verifiable...