BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20170326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20161030T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260428T224334Z
UID:57bc5e69873be082545311@ist.ac.at
DTSTART:20170314T163000
DTEND:20170314T173000
DESCRIPTION:Speaker: Silviu Craciunas\nhosted by Tom Henzinger\nAbstract: E
 thernet has evolved to be the standard open communication mechanism for a 
 wide range of application domains originally not bound to strict timing re
 quirements. In the real-time domain\, safety-critical timing aspects have 
 been introduced by means of technologies like TTEthernet and Time-Sensitiv
 e Networks (TSN). In both technologies communication typically follows an 
 offline and statically configured schedule (the synthesis of which is an N
 P-complete problem) guaranteeing contention-free frame transmissions. In t
 he context of TTEthernet\, we present methods for the simultaneous co-gene
 ration of static network and task schedules for distributed systems consis
 ting of preemptive time-triggered tasks which communicate over switched mu
 lti-speed time-triggered networks. Furthermore we present an incremental s
 cheduling approach\, based on the demand bound test for asynchronous tasks
 \, which significantly improves the scalability of the scheduling problem 
 for the average case. In the context of TSN we identify and analyze key fu
 nctional parameters affecting the deterministic behaviour of real-time com
 munication under 802.1Qbv and\, based on a generalized configuration of th
 ese parameters\, derive the required constraints for computing offline sch
 edules for critical communication flows. We formulate the scheduling probl
 em for both cases using first-order logic with equality and present altern
 ative methods to find a solution\, with or without optimization objectives
 \, based on Optimization Modulo Theories (OMT) and Satisfiability Modulo T
 heories (SMT)\, respectively.
LOCATION:Computer Science Room (I01.2OG.)\, ISTA
ORGANIZER:abonvent@ist.ac.at
SUMMARY:Silviu Craciunas: SMT-based Schedule Synthesis for Deterministic Ne
 tworks
URL:https://talks-calendar.ista.ac.at/events/367
END:VEVENT
END:VCALENDAR