<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic About Petri Nets ... in Intel® Moderncode for Parallel Architectures</title>
    <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/About-Petri-Nets/m-p/769110#M103</link>
    <description>&lt;BR /&gt;Hello,&lt;BR /&gt;
&lt;DIV&gt;&lt;BR /&gt;The demand for high availability and reliability of computer and 
software systems&lt;/DIV&gt;
&lt;DIV&gt;has led to a formal verification of such systems. There are two principal 
approaches &lt;/DIV&gt;
&lt;DIV&gt;to formal verification: model checking and theorem proving. I will talk 
about Petri Nets&lt;/DIV&gt;
&lt;DIV&gt;and how to model parallel programs and how to exploit verification tools as 
Tina and &lt;/DIV&gt;
&lt;DIV&gt;Romeo to verify the properties such as liveleness of the system. I will 
restrict the &lt;/DIV&gt;
&lt;DIV&gt;discussion to so-called "1-conservative" Petri Nets, in which the capacity 
of each &lt;/DIV&gt;
&lt;DIV&gt;place is assumed to be 1, and each edge will remove exactly one mark from a 
net if &lt;/DIV&gt;
&lt;DIV&gt;it leads from a place to a transition and add exactly one when it leads 
from a transition &lt;/DIV&gt;
&lt;DIV&gt;to a place.&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;Please read more here: 
&lt;BR /&gt;&lt;BR /&gt;&lt;A href="http://pages.videotron.com/aminer/PetriNet/formal.htm" target="_blank"&gt;http://pages.videotron.com/aminer/PetriNet/formal.htm&lt;/A&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;You can 
download Tina from:&lt;BR /&gt;&lt;BR /&gt;&lt;A href="http://projects.laas.fr/tina//projects.php" target="_blank"&gt;http://projects.laas.fr/tina//projects.php&lt;/A&gt;&lt;BR /&gt;&lt;BR /&gt;and 
Romeo 
from:&lt;BR /&gt;&lt;BR /&gt;&lt;A href="http://romeo.rts-software.org/" target="_blank"&gt;http://romeo.rts-software.org/&lt;/A&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;Sincerely,&lt;BR /&gt;Amine 
Moulay Ramdane.&lt;BR /&gt;&lt;BR /&gt;&lt;/DIV&gt;</description>
    <pubDate>Fri, 10 Aug 2012 17:59:38 GMT</pubDate>
    <dc:creator>aminer10</dc:creator>
    <dc:date>2012-08-10T17:59:38Z</dc:date>
    <item>
      <title>About Petri Nets ...</title>
      <link>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/About-Petri-Nets/m-p/769110#M103</link>
      <description>&lt;BR /&gt;Hello,&lt;BR /&gt;
&lt;DIV&gt;&lt;BR /&gt;The demand for high availability and reliability of computer and 
software systems&lt;/DIV&gt;
&lt;DIV&gt;has led to a formal verification of such systems. There are two principal 
approaches &lt;/DIV&gt;
&lt;DIV&gt;to formal verification: model checking and theorem proving. I will talk 
about Petri Nets&lt;/DIV&gt;
&lt;DIV&gt;and how to model parallel programs and how to exploit verification tools as 
Tina and &lt;/DIV&gt;
&lt;DIV&gt;Romeo to verify the properties such as liveleness of the system. I will 
restrict the &lt;/DIV&gt;
&lt;DIV&gt;discussion to so-called "1-conservative" Petri Nets, in which the capacity 
of each &lt;/DIV&gt;
&lt;DIV&gt;place is assumed to be 1, and each edge will remove exactly one mark from a 
net if &lt;/DIV&gt;
&lt;DIV&gt;it leads from a place to a transition and add exactly one when it leads 
from a transition &lt;/DIV&gt;
&lt;DIV&gt;to a place.&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;Please read more here: 
&lt;BR /&gt;&lt;BR /&gt;&lt;A href="http://pages.videotron.com/aminer/PetriNet/formal.htm" target="_blank"&gt;http://pages.videotron.com/aminer/PetriNet/formal.htm&lt;/A&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;You can 
download Tina from:&lt;BR /&gt;&lt;BR /&gt;&lt;A href="http://projects.laas.fr/tina//projects.php" target="_blank"&gt;http://projects.laas.fr/tina//projects.php&lt;/A&gt;&lt;BR /&gt;&lt;BR /&gt;and 
Romeo 
from:&lt;BR /&gt;&lt;BR /&gt;&lt;A href="http://romeo.rts-software.org/" target="_blank"&gt;http://romeo.rts-software.org/&lt;/A&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;&lt;BR /&gt;Sincerely,&lt;BR /&gt;Amine 
Moulay Ramdane.&lt;BR /&gt;&lt;BR /&gt;&lt;/DIV&gt;</description>
      <pubDate>Fri, 10 Aug 2012 17:59:38 GMT</pubDate>
      <guid>https://community.intel.com/t5/Intel-Moderncode-for-Parallel/About-Petri-Nets/m-p/769110#M103</guid>
      <dc:creator>aminer10</dc:creator>
      <dc:date>2012-08-10T17:59:38Z</dc:date>
    </item>
  </channel>
</rss>

