petri_net 0.7.2 → 0.7.9.1

data/lib/petri_net/place.rb

@@ -33,12 +33,12 @@ class PetriNet::Place < PetriNet::Base
 
     # Add an input arc
     def add_input(arc)
-        @inputs << arc.id unless arc.nil?
+        @inputs << arc.id unless (arc.nil? or !validate_input arc)
     end
 
     # Add an output arc
     def add_output(arc)
-        @outputs << arc.id unless arc.nil?
+        @outputs << arc.id unless (arc.nil? or !validate_input arc)
     end
 
     def add_marking(count = 1)
@@ -107,4 +107,17 @@ class PetriNet::Place < PetriNet::Base
         return true if name == object.name && description = object.description
     end
 
+private
+        def validate_input(arc)
+            self.inputs.each do |a|
+                return false if ((@net.get_objects[a] <=> arc) == 0)
+            end
+            true
+        end 
+        def validate_output(arc)
+            self.outputs.each do |a|
+                return false if ((@net.get_objects[a] <=> arc) == 0)
+            end
+            true
+        end
 end 

data/lib/petri_net/reachability_graph/edge.rb

@@ -1,50 +1,13 @@
-class PetriNet::ReachabilityGraph::Edge < PetriNet::Base
-    # Human readable name
-    attr_reader :name
-    # Unique ID
-    attr_reader :id
-    # Graph this edge belongs to
-    attr_accessor :graph
-    # Probability of the relating transition
-    attr_accessor :probability
-    
+class PetriNet::ReachabilityGraph::Edge < PetriNet::Graph::Edge
     # Creates an edge for PetriNet::ReachabilityGraph
     def initialize(options = {}, &block)
-        @id = next_object_id
-        @name = (options[:name] or "Edge#{@id}")
-        @description = (options[:description] or "Edge #{@id}")
-        @source = options[:source] 
-        @destination = options[:destination]
-        @label = (options[:label] or @name)
-        @probability = options[:probability]
-
+        super(options)
         yield self unless block.nil?
     end
 
     # Validates the data holded by this edge, this will be used while adding the edge to the graph
     def validate
-        true
-    end
-
-    def to_gv
-        "\t#{@source.gv_id} -> #{@destination.gv_id}#{probability_to_gv};\n"
-    end
-
-    def ==(object)
-        return false unless object.class.to_s == "PetriNet::ReachabilityGraph::Edge"
-        (@source == object.yource && @destination == oject.destination)
-    end
-    def to_s
-        "#{@id}: #{@name} #{@source.id} -> #{@destination} )"
-    end
-
-    private
-    def probability_to_gv
-        if @probability 
-            " [ label = \"#{@probability.to_s}\" ] "
-        else
-            ''
-        end
+        super 
     end
 
 end

data/lib/petri_net/reachability_graph/graph.rb

@@ -1,122 +1,28 @@
-class PetriNet::InfiniteReachabilityGraphError < RuntimeError
-end
+require 'graphviz'
 
-class PetriNet::ReachabilityGraph < PetriNet::Base
+class PetriNet::ReachabilityGraph < PetriNet::Graph
     def initialize(net, options = Hash.new)
-        @objects = Array.new
-        @nodes = Hash.new
-        @edges = Hash.new
-        @name = net.name
-        if options['unlimited'].nil? 
-            @unlimited = true 
-        else 
-            @unlimited = options['unlimited']
-        end
+        options[:type] = "Reachability"
+        super(net, options)
+        self
     end
 
     def add_node(node)
-        double = false
         @nodes.each_value do |n|
             begin
-                if node > @objects[n]
-                    if @unlimited
-                        double = n
-                        break
-                        #return @objects[n].id *-1
-                    else
-                        raise PetriNet::ReachabilityGraph::InfiniteReachabilityGraphError
-                    end
+                if @objects[n] < node
+                    raise PetriNet::InfiniteReachabilityGraphError
                 end
             rescue ArgumentError
-                #just two different markings, completly ok
+                #Just an InfiniteNode
             end
-        end
-        return (@objects[double].id * -1) if double
-        node_index = @objects.index node
-        if (!node_index.nil?)
-            return @objects[node_index].id * -1
-        end
-
-        if (node.validate && (!@nodes.include? node.name))
-            @objects[node.id] = node
-            @nodes[node.name] = node.id
-            node.graph = self
-            return node.id
-        end
-        return false
-    end
-
-    def add_edge(edge)
-        if (edge.validate && (!@edges.include? edge.name))
-            @objects[edge.id] = edge
-            @edges[edge.name] = edge.id
-            edge.graph = self
-            return edge.id
-        end
-        return false
-    end
 
-    # Add an object to the Petri Net.
-    def <<(object)
-        case object.class.to_s
-        when "Array"
-            object.each {|o| self << o}
-        when "PetriNet::ReachabilityGraph::Edge"
-            add_edge(object)
-        when "PetriNet::ReachabilityGraph::Node"
-            add_node(object)
-        else
-            raise "(PetriNet::ReachabilityGraph) Unknown object #{object.class}."
         end
-        self
+        super node
     end
-    alias_method :add_object, :<<
-
-    def get_node(id)
-        return @objects[id]
-    end
-
-    def to_gv
-        # General graph options
-        str = "digraph #{@name} {\n"
-        str += "\t// General graph options\n"
-        str += "\trankdir = LR;\n"
-        str += "\tsize = \"10.5,7.5\";\n"
-        str += "\tnode [ style = filled, fillcolor = white, fontsize = 8.0 ]\n"
-        str += "\tedge [ arrowhead = vee, arrowsize = 0.5, fontsize = 8.0 ]\n"
-        str += "\n"
-
-        str += "\t// Nodes\n"
-        str += "\tnode [ shape = circle ];\n"
-        @nodes.each_value {|id| str += @objects[id].to_gv }
-        str += "\n"
-
-        str += "\t// Edges\n"
-        @edges.each_value {|id| str += @objects[id].to_gv }
-        str += "}\n"    # Graph closure
-
-        return str
-
-    end
-
-    def to_s
-        str = "Reachability Graph [#{@name}]\n"
-        str += "----------------------------\n"
-        str += "Description: #{@description}\n"
-        str += "Filename: #{@filename}\n"
-        str += "\n"
-
-        str += "Nodes\n"
-        str += "----------------------------\n"
-        @nodes.each_value {|p| str += @objects[p].to_s + "\n" }
-        str += "\n"
-
-        str += "Edges\n"
-        str += "----------------------------\n"
-        @edges.each_value {|t| str += @objects[t].to_s + "\n" }
-        str += "\n"
 
-        return str
+    def add_node!(node)
+        super node
     end
 
 end

data/lib/petri_net/reachability_graph/node.rb

@@ -1,119 +1,13 @@
-class PetriNet::ReachabilityGraph::Node < PetriNet::Base
-    include Comparable
-
-    # human readable name
-    attr_reader :name
-    # unique ID
-    attr_reader :id 
-    # Makking this node represents
-    attr_reader :markings
-    # The graph this node belongs to
-    attr_accessor :graph
-    # Omega-marked node (unlimited Petrinet -> coverabilitygraph)
-    attr_reader :omega_marked
-    # Incoming edges
-    attr_reader :inputs
-    # Outgoing edges
-    attr_reader :outputs
-    # Label of the node
-    attr_reader :label
-
+class PetriNet::ReachabilityGraph::Node < PetriNet::Graph::Node
     def initialize(options = {}, &block)
-        @id = next_object_id
-        @name = (options[:name] or "Node#{@id}")
-        @description = (options[:description] or "Node #{@id}")
-        @inputs = Array.new
-        @outputs = Array.new
-        @label = (options[:label] or @name)
-        @markings = options[:markings] 
-        if @markings.nil?
-            raise ArgumentError.new "Every Node needs markings"
-        end
-        if @markings.include? Float::INFINITY
-            @omega_marked = true 
-        else 
-            @omega_marked = false
-        end
-
+        super(options)
         yield self unless block.nil?
     end
 
-    # Add an omega-marking to a specified place
-    def add_omega object 
-        if object.class.to_s == "PetriNet::ReachabilityGraph::Node"
-            if self < object
-                counter = 0
-                object.markings.each do |marking|
-                    if @markings[counter] < marking 
-                        @markings[counter] = Float::INFINITY 
-                    end
-                    counter += 1
-                end
-            else
-                return false
-            end
-        elsif object.class.to_s == "Array"
-            object.each do |place|
-                markings[place] = Float::INFINITY
-            end
-        elsif object.class.to_s == "Fixnum"
-            markings[object] = Float::INFINITY
-        end
-        @omega_marked = true
-    end
-
-    def validate
-        true
-    end
-
-    def gv_id
-        "N#{@id}"
-    end
-
-    def to_gv
-        "\t#{self.gv_id} [ label = \"#{@markings}\" ];\n"
-    end
-
-    # Compare-operator, other Operators are available through comparable-mixin
-    def <=>(object)
-        return nil unless object.class.to_s == "PetriNet::ReachabilityGraph::Node"
-        if @markings == object.markings
-            return 0
-        end
-
-        counter = 0
-        less = true
-        self.markings.each do |marking|
-            if marking <= object.markings[counter] && less
-                less = true
-            else 
-                less = false
-                break
-            end
-            counter += 1
-        end
-        if less
-            return -1
-        end
-        counter = 0
-        more = true
-        self.markings.each do |marking|
-            if marking >= object.markings[counter] && more
-                more = true
-            else
-                more = false
-                break
-            end
-            counter += 1
-        end
-        if more
-            return 1
-        end
-        return nil
-    end
+end
 
-    def to_s
-        "#{@id}: #{@name} (#{@markings})"
+class PetriNet::ReachabilityGraph::InfinityNode < PetriNet::ReachabilityGraph::Node
+    def initialize()
+        super(markings: [Float::INFINITY])
     end
-
 end

data/lib/petri_net/reachability_graph.rb

@@ -1,97 +1,6 @@
+require_relative 'graph'
 require_relative 'reachability_graph/graph'
 require_relative 'reachability_graph/node'
 require_relative 'reachability_graph/edge'
-class PetriNet::ReachabilityGraph < PetriNet::Base
-=begin 
-    def initialize(net)
-        @objects = Array.new
-        @nodes = Hash.new
-        @edges = Hash.new
-        @name = net.name
-    end
-
-    def add_node(node)
-        node_index = @objects.index node
-        if (!node_index.nil?)
-            return @objects[node_index].id * -1
-        end
-
-        if (node.validate && (!@nodes.include? node.name))
-            @objects[node.id] = node
-            @nodes[node.name] = node.id
-            node.graph = self
-            return node.id
-        end
-        return false
-    end
-
-    def add_edge(edge)
-        if (edge.validate && (!@edges.include? edge.name))
-            @objects[edge.id] = edge
-            @edges[edge.name] = edge.id
-            edge.graph = self
-            return edge.id
-        end
-        return false
-    end
-
-    # Add an object to the Petri Net.
-    def <<(object)
-        case object.class.to_s
-        when "Array"
-            object.each {|o| self << o}
-        when "PetriNet::ReachabilityGraph::Edge"
-            add_edge(object)
-        when "PetriNet::ReachabilityGraph::Node"
-            add_node(object)
-        else
-            raise "(PetriNet::ReachabilityGraph) Unknown object #{object.class}."
-        end
-        self
-    end
-    alias_method :add_object, :<<
-
-    def to_gv
-        # General graph options
-        str = "digraph #{@name} {\n"
-        str += "\t// General graph options\n"
-        str += "\trankdir = LR;\n"
-        str += "\tsize = \"10.5,7.5\";\n"
-        str += "\tnode [ style = filled, fillcolor = white, fontsize = 8.0 ]\n"
-        str += "\tedge [ arrowhead = vee, arrowsize = 0.5, fontsize = 8.0 ]\n"
-        str += "\n"
-
-        str += "\t// Nodes\n"
-        str += "\tnode [ shape = circle ];\n"
-        @nodes.each_value {|id| str += @objects[id].to_gv }
-        str += "\n"
-
-        str += "\t// Edges\n"
-        @edges.each_value {|id| str += @objects[id].to_gv }
-        str += "}\n"    # Graph closure
-
-        return str
-
-    end
-
-    def to_s
-        str = "Reachability Graph [#{@name}]\n"
-        str += "----------------------------\n"
-        str += "Description: #{@description}\n"
-        str += "Filename: #{@filename}\n"
-        str += "\n"
-
-        str += "Nodes\n"
-        str += "----------------------------\n"
-        @nodes.each_value {|p| str += @objects[p].to_s + "\n" }
-        str += "\n"
-
-        str += "Edges\n"
-        str += "----------------------------\n"
-        @edges.each_value {|t| str += @objects[t].to_s + "\n" }
-        str += "\n"
-
-        return str
-    end
-=end
-end
+#class PetriNet::ReachabilityGraph < PetriNet::Base
+#end

data/lib/petri_net/transition.rb

@@ -30,12 +30,12 @@ module PetriNet
 
         # Add an input arc
         def add_input(arc)
-            @inputs << arc.id unless arc.nil?
+            @inputs << arc.id unless (arc.nil? or !validate_input arc)
         end
 
         # Add an output arc
         def add_output(arc)
-            @outputs << arc.id unless arc.nil?
+            @outputs << arc.id unless (arc.nil? or !validate_output arc)
         end
 
         # GraphViz ID
@@ -108,5 +108,19 @@ module PetriNet
             end
             true
         end
+        
+private
+        def validate_input(arc)
+            self.inputs.each do |a|
+                return false if ((@net.get_objects[a] <=> arc) == 0)
+            end
+            true
+        end 
+        def validate_output(arc)
+            self.outputs.each do |a|
+                return false if ((@net.get_objects[a] <=> arc) == 0)
+            end
+            true
+        end
     end 
 end

data/lib/petri_net/version.rb

@@ -1,7 +1,7 @@
 module PetriNet
     # Current Version
-    VERSION = "0.7.2"
+    VERSION = "0.7.9.1"
     # True if this is a debug-version and should not be used in productive systems
-    DEBUG = false
+    DEBUG = false 
 end
 

data/lib/petri_net.rb

@@ -23,11 +23,12 @@
 # This library provides a way to represent petri nets in ruby and do some algorithms on them as generating the Reachability Graph. 
 
 # Holds the path of the base-file petri_net.rb
-PETRI_LIB_FILE_PATH = File.dirname(__FILE__)
-require "#{PETRI_LIB_FILE_PATH}/petri_net/base"
-require "#{PETRI_LIB_FILE_PATH}/petri_net/net"
-require "#{PETRI_LIB_FILE_PATH}/petri_net/place"
-require "#{PETRI_LIB_FILE_PATH}/petri_net/transition"
-require "#{PETRI_LIB_FILE_PATH}/petri_net/arc"
-require "#{PETRI_LIB_FILE_PATH}/petri_net/marking"
-require "#{PETRI_LIB_FILE_PATH}/petri_net/reachability_graph"
+PETRI_NET_LIB_FILE_PATH = File.dirname(__FILE__)
+require "#{PETRI_NET_LIB_FILE_PATH}/petri_net/base"
+require "#{PETRI_NET_LIB_FILE_PATH}/petri_net/net"
+require "#{PETRI_NET_LIB_FILE_PATH}/petri_net/place"
+require "#{PETRI_NET_LIB_FILE_PATH}/petri_net/transition"
+require "#{PETRI_NET_LIB_FILE_PATH}/petri_net/arc"
+require "#{PETRI_NET_LIB_FILE_PATH}/petri_net/marking"
+require "#{PETRI_NET_LIB_FILE_PATH}/petri_net/reachability_graph"
+require "#{PETRI_NET_LIB_FILE_PATH}/petri_net/coverability_graph"

data/petri_net.gemspec

@@ -6,7 +6,7 @@ Gem::Specification.new do |gem|
   gem.email         = ["\"cclausen@tzi.de\""]
   gem.description   = %q{A Petri net modeling gem}
   gem.summary       = %q{You can create Petri Nets and do some calculations with them like generating the Reachability Graph}
-  gem.homepage      = "https://github.com/cclausen/petri"
+  gem.homepage      = "https://github.com/cclausen/petri_net"
 
   gem.files         = `git ls-files`.split($\)
   gem.executables   = gem.files.grep(%r{^bin/}).map{ |f| File.basename(f) }
@@ -16,6 +16,7 @@ Gem::Specification.new do |gem|
   gem.version       = PetriNet::VERSION
   
   gem.license       = 'MIT'
-  #gem.add_dependency "ruby-graphviz"
+  gem.add_dependency "ruby-graphviz"
+  gem.add_dependency "graphviz"
   gem.add_development_dependency "net-sftp"
 end

data/test/reachability_graph/tc_graph.rb

@@ -57,5 +57,129 @@ Edges
 ", @net.generate_reachability_graph().to_s, "Reachability Graph of sample net"
     end
 
+    def test_to_gv
+        fill_net
+#        @net.generate_reachability_graph().to_gv_new
+    end
+
+    def test_simple_net_1
+        @net = PetriNet::Net.new(:name => 'SimpleNet1', :description => 'PTP')
+        @net << PetriNet::Place.new(name: 'A')
+        @net << PetriNet::Place.new(name: 'B')
+        @net << PetriNet::Transition.new(name:'T')
+        @net << PetriNet::Arc.new(source:@net.get_place('A'), destination:@net.get_transition('T'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T'), destination:@net.get_place('B'))
+        @net.get_place('A').add_marking
+        rn = @net.generate_reachability_graph
+        assert_equal "Reachability Graph [SimpleNet1]\n----------------------------\nDescription: \nFilename: \n\nNodes\n----------------------------\n6: Node6 ([1, 0])\n7: Node7 ([0, 1])\n\nEdges\n----------------------------\n8: Edge8 6 -> 7: Node7 ([0, 1]) )\n\n", rn.to_s
+
+    end
+
+    def test_simple_net_2
+        @net = PetriNet::Net.new(:name => 'SimpleNet2', :description => 'PTTPP')
+        @net << PetriNet::Place.new(name: 'A')
+        @net << PetriNet::Place.new(name: 'B')
+        @net << PetriNet::Place.new(name: 'C')
+        @net << PetriNet::Transition.new(name:'T1')
+        @net << PetriNet::Transition.new(name:'T2')
+        @net << PetriNet::Arc.new(source:@net.get_place('A'), destination:@net.get_transition('T1'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T1'), destination:@net.get_place('B'))
+        @net << PetriNet::Arc.new(source:@net.get_place('A'), destination:@net.get_transition('T2'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T2'), destination:@net.get_place('C'))
+        @net.get_place('A').add_marking
+        rn = @net.generate_reachability_graph
+        assert_equal "Reachability Graph [SimpleNet2]\n----------------------------\nDescription: \nFilename: \n\nNodes\n----------------------------\n10: Node10 ([1, 0, 0])\n11: Node11 ([0, 1, 0])\n13: Node13 ([0, 0, 1])\n\nEdges\n----------------------------\n12: Edge12 10 -> 11: Node11 ([0, 1, 0]) )\n14: Edge14 10 -> 13: Node13 ([0, 0, 1]) )\n\n", rn.to_s
+
+    end
+
+    def test_simple_net_3
+        @net = PetriNet::Net.new(:name => 'SimpleNet3', :description => 'PTPPinf')
+        @net << PetriNet::Place.new(name: 'A')
+        @net << PetriNet::Place.new(name: 'B')
+        @net << PetriNet::Transition.new(name:'T')
+        @net << PetriNet::Arc.new(source:@net.get_place('A'), destination:@net.get_transition('T'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T'), destination:@net.get_place('B'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T'), destination:@net.get_place('A'))
+        @net.get_place('A').add_marking
+        rn = @net.generate_reachability_graph
+        assert_equal "Reachability Graph [SimpleNet3]\n----------------------------\nDescription: \nFilename: \n\nNodes\n----------------------------\n7: Node7 ([1, 0])\n8: Node8 ([1, 1])\n10: Node10 ([Infinity])\n\nEdges\n----------------------------\n9: Edge9 7 -> 8: Node8 ([1, 1]) )\n11: Edge11 8 -> 10: Node10 ([Infinity]) )\n\n", rn.to_s
+
+    end
+
+    def test_simple_net_4
+        @net = PetriNet::Net.new(:name => 'SimpleNet4', :description => 'PTPPinf')
+        @net << PetriNet::Place.new(name: 'A')
+        @net << PetriNet::Place.new(name: 'B')
+        @net << PetriNet::Transition.new(name:'T1')
+        @net << PetriNet::Transition.new(name:'T2')
+        @net << PetriNet::Arc.new(source:@net.get_place('A'), destination:@net.get_transition('T1'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T1'), destination:@net.get_place('B'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T1'), destination:@net.get_place('A'))
+        @net << PetriNet::Arc.new(source:@net.get_place('B'), destination:@net.get_transition('T2'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T2'), destination:@net.get_place('A'))
+        @net.get_place('A').add_marking
+        rn = @net.generate_reachability_graph
+        assert_equal "Reachability Graph [SimpleNet4]\n----------------------------\nDescription: \nFilename: \n\nNodes\n----------------------------\n10: Node10 ([1, 0])\n11: Node11 ([1, 1])\n13: Node13 ([Infinity])\n15: Node15 ([2, 0])\n17: Node17 ([Infinity])\n\nEdges\n----------------------------\n12: Edge12 10 -> 11: Node11 ([1, 1]) )\n14: Edge14 11 -> 13: Node13 ([Infinity]) )\n16: Edge16 10 -> 15: Node15 ([2, 0]) )\n18: Edge18 15 -> 17: Node17 ([Infinity]) )\n\n", rn.to_s
 
+    end
+
+    def test_simple_net_5
+        @net = PetriNet::Net.new(:name => 'SimpleNet5', :description => 'PTPTP')
+        @net << PetriNet::Place.new(name: 'A')
+        @net << PetriNet::Place.new(name: 'B')
+        @net << PetriNet::Transition.new(name:'T1')
+        @net << PetriNet::Transition.new(name:'T2')
+        @net << PetriNet::Arc.new(source:@net.get_place('A'), destination:@net.get_transition('T1'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T1'), destination:@net.get_place('B'))
+        @net << PetriNet::Arc.new(source:@net.get_place('B'), destination:@net.get_transition('T2'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T2'), destination:@net.get_place('A'))
+        @net.get_place('A').add_marking
+        @net.to_gv_new
+        rn = @net.generate_reachability_graph
+        assert_equal "Reachability Graph [SimpleNet5]\n----------------------------\nDescription: \nFilename: \n\nNodes\n----------------------------\n9: Node9 ([1, 0])\n10: Node10 ([0, 1])\n\nEdges\n----------------------------\n11: Edge11 9 -> 10: Node10 ([0, 1]) )\n\n", rn.to_s
+
+        rn.to_gv
+    end
+
+    def test_real_net_1
+        @net = PetriNet::Net.new(:name => 'RealNet1', :description => 'Failed in real situation')
+        @net << PetriNet::Place.new(name: 'A')
+        @net << PetriNet::Place.new(name: 'B')
+        @net << PetriNet::Place.new(name: 'C')
+        @net << PetriNet::Place.new(name: 'D')
+        @net << PetriNet::Transition.new(name:'T1')
+        @net << PetriNet::Transition.new(name:'T2')
+        @net << PetriNet::Transition.new(name:'T3')
+        @net << PetriNet::Arc.new(source:@net.get_place('A'), destination:@net.get_transition('T1'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T1'), destination:@net.get_place('B'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T1'), destination:@net.get_place('D'))
+        @net << PetriNet::Arc.new(source:@net.get_place('B'), destination:@net.get_transition('T2'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T2'), destination:@net.get_place('C'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T2'), destination:@net.get_place('D'))
+        @net << PetriNet::Arc.new(source:@net.get_place('D'), destination:@net.get_transition('T3'))
+        @net << PetriNet::Arc.new(source:@net.get_transition('T3'), destination:@net.get_place('A'))
+        @net.get_place('A').add_marking
+        @net.to_gv_new
+        rg = @net.generate_reachability_graph
+
+        rg.to_gv
+        #TODO assert_equal "", rg.to_s
+
+    end
+
+    def test_empty_net1
+        @net = PetriNet::Net.new(:name => 'EmptyNet1', :description => 'Should be boring')
+        @net.generate_reachability_graph # Don't know what to test here, bit this crashed with an Error before...
+    end
+    def test_empty_net2
+        @net = PetriNet::Net.new(:name => 'EmptyNet2', :description => 'Should be boring')
+        @net << PetriNet::Place.new(name: 'A')
+        @net.generate_reachability_graph # Don't know what to test here, bit this crashed with an Error before...
+    end
+    def test_empty_net3
+        @net = PetriNet::Net.new(:name => 'EmptyNet3', :description => 'Should be boring')
+        @net << PetriNet::Place.new(name: 'A')
+        @net << PetriNet::Transition.new(name:'T1')
+        @net.generate_reachability_graph # Don't know what to test here, bit this crashed with an Error before...
+    end
 end