BEGIN:VCALENDAR
PRODID:-//SMW Project//Semantic Result Formats
VERSION:2.0
METHOD:PUBLISH
X-WR-CALNAME:International Center for Computational Logic
X-WR-CALDESC:
BEGIN:VEVENT
SUMMARY:On the Complexity of Synthesis of nop-Free Boolean Petri Nets./en
URL://iccl.inf.tu-dresden.de/web/On_the_Complexity_of_Synthesis_of_nop-Free_Boolean_Petri_Nets./en
UID://iccl.inf.tu-dresden.de/web/On_the_Complexity_of_Synthesis_of_nop-Free_Boolean_Petri_Nets./en
DTSTAMP:20200722T195408
SEQUENCE:31065
END:VEVENT
END:VCALENDAR