<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="http://workcraft.org/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="http://workcraft.org/feed.php">
        <title>Workcraft - tutorial:model:dining_philosophers</title>
        <description></description>
        <link>http://workcraft.org/</link>
        <image rdf:resource="http://workcraft.org/_media/logo.svg" />
       <dc:date>2026-05-15T08:02:30+00:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="http://workcraft.org/tutorial/model/dining_philosophers/start?rev=1633349020&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="http://workcraft.org/_media/logo.svg">
        <title>Workcraft</title>
        <link>http://workcraft.org/</link>
        <url>http://workcraft.org/_media/logo.svg</url>
    </image>
    <item rdf:about="http://workcraft.org/tutorial/model/dining_philosophers/start?rev=1633349020&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-10-04T12:03:40+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>start</title>
        <link>http://workcraft.org/tutorial/model/dining_philosophers/start?rev=1633349020&amp;do=diff</link>
        <description>Modelling with Petri nets: Dining philosophers

In this tutorial we will use the famous Dining philosophers problem as an example of resource allocation problems where several processes compete for resources. It also illustrates the power and convenience of Petri nets as a formalism for modelling and analysis of such problems. There are five philosophers sitting around a table. Each philosopher is either thinking or eating. There are five forks on the table, one between each pair of adjacent phi…</description>
    </item>
</rdf:RDF>
