In this paper we introduce classically time-controlled quantum automata or CTQA, which is a reasonable modification of Moore-Crutchfield finite that uses time-dependent evolution and scheduler defining how long each Hamiltonian will run. Surprisingly enough, provides significant change in the computational power with respect to discrete model. Indeed, show if not computationally restricted, the...

this paper surveys parallel scheduling problems and metrics correlated to and then applys metrics to make decision in comparison to other policy schedulers. parallel processing is new trend in computer science especially in embedded and multicore systems whereas needs more power consumption to reach speed up. the qos requirement for users is to have good responsiveness and for service providers...

In this paper we present the novel verification of synchronous channel communication and alternation (choice) by considering environment within which our primitives are executing. Our work is in exploring development a multi-threaded scheduler for cooperatively scheduled process-oriented language, ProcessJ. We use CSP to produce formal specifications implementation various parts language runtim...

Non-cooperative behaviors in communication networks can significantly adversely affect the entire network. Recently, researchers have begun to study such non-cooperative communication systems within a game theory framework and strive to engineer the system to prevent performance degradation under non-cooperative behaviors. The WWAN/WLAN two-hop-relay system described in [1] integrates two types...