This paper analyzes automated distributive negotiation where agents have firm deadlines that are private information. The agents are allowed to make and accept offers in any order in continuous time. We show that the only sequential equilibrium outcome is one where the agents walt until the first deadline, at which point that agent concedes everything to the other. This holds for pure and mixed...

In BDI agent programming, an intention is the combined plan steps an agent commits to in order to achieve a goal. One of the key features of the BDI approach is the ability of an agent to pursue multiple goals concurrently, by interleaving the steps of multiple intentions. Choosing the next step to progress (execute) from these concurrent intentions is critical, as the wrong choice can result i...

Our focus is on the specification and verification of normative systems that include contrary-to-duty, collective and event-driven imperatives with deadlines. We propose an operational syntax and semantics for the specification of such systems. Using Maude and its model checker, we show how Linear Temporal Logic properties can be verified, and provide some experimental results.

Ultra-reliable low-latency communication (URLLC) in 5G networks is designed to support time-critical applications such as industrial control systems (ICSs), where user equipment (UEs) communicate with a base station (BS) very high reliability and low latency. Most of these communications ICSs are periodic associated hard deadlines. To provide reliable service while satisfying the deadlines, BS ...

This work presents a data-centric strategy to meet deadlines in soft real-time applications in wireless sensor networks. This strategy considers three main aspects: (i) The design of real-time application to obtain the minimum deadlines; (ii) An analytic model to estimate the ideal sample size used by data-reduction algorithms; and (iii) Two data-centric stream-based sampling algorithms to perf...

The problem of scheduling multiple streams of real-time customers is addressed in this paper. The paper rst introduces the notion of (m; k)-rm deadlines to better characterize the timing constraints of real-time streams. More speciically, a stream is said to have (m; k)-rm deadlines if at least m out of any k consecutive customers must meet their deadlines. A stream with (m; k)-rm deadlines exp...

customer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUScessful service. One application of this problem is the tomers in a non-preemptive G/GI/1 queue. Every CUStransmission of time-constrained messages over a comtomer has a random deadline to the beginning of its munication channel. The...