Matteo Slanina

Learn More
Event-pattern reactive programs serve reactive components by pre-processing the input event stream and generating notifications according to temporal patterns. The declarative language PAR allows the expression of complex event-pattern reactions. Despite its simplicity and deterministic nature, PAR is expressively complete in the following sense: every(More)
Event-pattern reactive programs are front-end programs for distributed reactive components that preprocess an incoming stream of event stimuli. Their purpose is to recognize temporal patterns of events that are relevant to the serviced program and ignore all other events, outsourcing some of the component's complexity and shielding it from event overload.(More)
The article desribes a metric for H.264/AVC compressed video quality evaluation, which is being developed by our group. The metric operates on the encoded bitstream only. It uses the data directly present in the bitstream (or just entropy coded). No pixel decoding should be necessary, which will result in low computational complexity, and cosequently the(More)
This paper presents a deductive approach to the control problem for infinite-state reactive systems. It describes three proof rules, sound and relatively complete for formulas in the first two levels of the hierarchy of linear temporal logic—safety and response. The control conditions forming the premises of the rules are Π 0 2 first-order formulas. If a(More)
Alternating temporal logic (atl*) was introduced to prove properties of multi-agent systems in which the agents have different objectives and may collaborate to achieve them. Examples include (distributed) controlled systems, security protocols, and contract-signing protocols. Proving atl* properties over finite-state systems was shown decidable by Alur et(More)
⋆⋆ To Boaz, pioneer and visionary – in honor of your 85th birthday. Abstract. Event-pattern reactive programs are small programs that process an input stream of events to detect and act upon given temporal patterns. These programs are used in distributed systems to notify components when they must react. We present the reaction algebra, a declarative(More)
This thesis presents a novel method for deadlock avoidance in distributed real-time and embedded systems, using the combination of static analysis and run-time protocols. Program analysis allows the extraction of the call dependencies between remote components. Run-time protocols then ensure that the interleavings of executions cannot reach to deadlocks,(More)