Numerous models of concurrency have been considered in the framework of automata. Among the more interesting concurrency models are classical nondeterminism and pure concur-rency, the two facets of alternation, and the bounded concurrency model. Bounded concurrency was previously considered to be similar to nondeterminism and pure concurrency in the sense of the succinctness of automata augment...

We present two concurrent semantics (i.e. semantics where concurrency is ex-plicitely represented) for CC programs with atomic tells. One is based on simple partial orders of computation steps, while the other one is based on contextual nets and it is an extension of a previous one for eventual CC programs. Both such semantics allow us to derive concurrency, dependency, and nondeterminism infor...

We present a novel transaction model for distributed safetycritical real-time applications in which transactions become increasingly critical under failures of subsequent incarnations. When a transaction-dependent criticality threshold has been reached the transaction is considered essentially critical or hard, i.e. the deadline has to be met lest the system is doomed to be in a disastrous stat...

With the inclusion of actuation capabilities, emerging wireless sensor applications are much less tolerant to inconsistencies in decisions compared to passive sensing applications. Multi-hop networks suffer from these problems more profoundly as they cannot directly utilize atomic broadcast operations for coordination. In this study, we provide a lightweight single hop primitive, Read-All-Write...

The increasing significance of operating systems (OSs) in the development internet things (IoT) has emerged last decade. An event-driven OS is memory efficient and suitable for resource-constrained IoT devices wireless sensors, although program’s control flow, which determined by events, not always obvious. A multithreaded with sequential flow often considered clearer. However, this approach me...