Running Example. In the rest of the paper, we will illustrate our logic and results based on a contract commonly used in the lit- erature, that of a plane boarding system, based on e.g. (Azzopardi et al., 2014). In this section we present this use case — an agreement between the passenger and airline company, regulating the plane boarding process, from check-in till the flight, including time constraints. The use case is a simplified version based on the Madrid Xxxxxxx airport regulations.
Running Example. This section introduces a running example to have a consistent scenario to relate the sources to. The example chosen for this is the import and export of goods through a port. Specifically as seen through the viewpoint of a container terminal. First of is the import scenario, which is illustrated in Figure 3.1. In this case, the following service is provided: a full container will be transported from the port it arrives in to a location of the customer, where it can be unloaded. The empty container will then be transported to a depot, where its carrier can reuse it. In this process, the following steps are taken:
Running Example. The example in Figure 4.3a is described by a random-walk Markov model in Figure 4.2 (left) where each state denotes a location on the map, if the true state at timestamp t is s1, then sxt = s1 =[1 0 0 0 0 0], pt =[1 0 0 0 0 0]. Measurement Query. At each timestamp, a measurement query f : S → Rd about current state is evaluated. We denote the space containing all possible outputs of f by measurement space. Example 4.2 (Measurement Query). Let f : S → R2 be two quantities about the true state in Figure 4.2: f1 : temperatue of current state – fl f2 : noise level of current state Then f can be expressed as f(s) = s| where each column corresponds the answer of a state, e.g. f(s1) = [1, 0]|, f(s2) = [2, 1]|. Above answer can be denoted in measurement space, as in Figure 4.2 (right).
