BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20230124T171526Z
LOCATION:C146
DTSTART;TZID=America/Chicago:20221118T105500
DTEND;TZID=America/Chicago:20221118T112500
UID:submissions.supercomputing.org_SC22_sess446_ws_ipdrm102@linklings.com
SUMMARY:Petri Nets for Concurrent Programming
DESCRIPTION:Workshop\n\nPetri Nets for Concurrent Programming\n\nRawson, R
 awson\n\nConcurrent programming is used in all large and complex computer 
 systems. However, concurrency errors and system failures (ex: crashes and 
 deadlocks) are common. We find that Petri nets can be used to model concur
 rent systems and find and remove errors ahead of time.  We introduce a nov
 el generalization of Petri nets with nondeterministic transition nodes to 
 match real systems. These allow for a compact way to construct, optimize, 
 and prove computer programs at the concurrency level.  Petri net programs 
 can also be optimized by automatically solving for maximal concurrency, wh
 ere the maximum number of valid threads is determined by the structure of 
 the Petri net prior to execution.  We discuss an algorithm to compute the 
 state graph of a given Petri net start state pair.  We introduce our open 
 source software framework which implements this theory as a general purpos
 e concurrency focused middle-ware.\n\nSession Format: Recorded\n\nRegistra
 tion Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR