petri_net_2020 1.0.0

data/lib/petri_net/transition.rb

@@ -0,0 +1,135 @@
+# frozen_string_literal: true
+
+module PetriNet
+  # Transition
+  class Transition < PetriNet::Base
+    # Unique ID
+    attr_accessor :id
+    # Huan readable name
+    attr_accessor :name
+    # Description
+    attr_accessor :description
+    # Probability of firing (this moment)
+    attr_accessor :probability
+    # List of input-arcs
+    attr_reader   :inputs
+    # List of output-arcs
+    attr_reader   :outputs
+    # The net this transition belongs to
+    attr_writer   :net
+
+    # Create a new transition.
+    def initialize(options = {}, &block)
+      @id = next_object_id
+      @name = (options[:name] || "Transition#{@id}")
+      @description = (options[:description] || "Transition #{@id}")
+      @inputs = []
+      @outputs = []
+      @probability = options[:probability]
+
+      yield self unless block.nil?
+    end
+
+    # Add an input arc
+    def add_input(arc)
+      @inputs << arc.id unless arc.nil? || !validate_input(arc)
+    end
+
+    # Add an output arc
+    def add_output(arc)
+      @outputs << arc.id unless arc.nil? || !validate_output(arc)
+    end
+
+    # GraphViz ID
+    def gv_id
+      "T#{@id}"
+    end
+
+    # Validate this transition.
+    def validate
+      return false if @id < 1
+      return false if @name.nil? || @name.empty?
+
+      true
+    end
+
+    # Stringify this transition.
+    def to_s
+      "#{@id}: #{@name}"
+    end
+
+    # GraphViz definition
+    def to_gv
+      "\t#{gv_id} [ label = \"#{@name}#{@probability ? ' ' + @probability.to_s : ''}\" ];\n"
+    end
+
+    def ==(object)
+      name == object.name && description = object.description
+    end
+
+    def preplaces
+      raise 'Not part of a net' if @net.nil?
+
+      places = []
+      places << @inputs.map { |i| @net.objects[i].source }
+    end
+
+    def postplaces
+      raise 'Not part of a net' if @net.nil?
+
+      @outputs.map { |o| @net.objects[o].source }
+    end
+
+    def activated?
+      raise 'Not part of a net' if @net.nil?
+
+      @inputs.each do |i|
+        return false if @net.get_object(i).source.markings.size < @net.get_object(i).weight
+      end
+
+      @outputs.each do |o|
+        return false if @net.get_object(o).destination.markings.size + @net.get_object(o).weight > @net.get_object(o).destination.capacity
+      end
+    end
+    alias firable? activated?
+
+    def activate!
+      @inputs.each do |i|
+        source = @net.get_object(i).source
+        source.add_marking(@net.get_object(i).weight - source.markings.size)
+      end
+
+      # what to do with outputs, if they have a capacity
+    end
+
+    def fire
+      raise 'Not part of a net' if @net.nil?
+      return false unless activated?
+
+      @inputs.each do |i|
+        @net.get_object(i).source.remove_marking @net.get_object(i).weight
+      end
+
+      @outputs.each do |o|
+        @net.get_object(o).destination.add_marking @net.get_object(o).weight
+      end
+      true
+    end
+
+    private
+
+    def validate_input(arc)
+      inputs.each do |a|
+        return false if (@net.get_objects[a] <=> arc) == 0
+      end
+      true
+    end
+
+    def validate_output(arc)
+      outputs.each do |a|
+        return false if (@net.get_objects[a] <=> arc) == 0
+      end
+      true
+    end
+  end
+end

data/lib/petri_net/version.rb

@@ -0,0 +1,8 @@
+# frozen_string_literal: true
+
+module PetriNet
+  # Current Version
+  VERSION = '1.0.0'
+  # True if this is a debug-version and should not be used in productive systems
+  DEBUG = false
+end

data/lib/petri_net.rb

@@ -0,0 +1,36 @@
+# frozen_string_literal: true
+
+#--
+# Copyright (c) 2009, Brian D. Nelson (bdnelson@wildcoder.com)
+#
+# Permission is hereby granted, free of charge, to any person obtaining a copy
+# of this software and associated documentation files (the "Software"), to deal
+# in the Software without restriction, including without limitation the rights
+# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+# copies of the Software, and to permit persons to whom the Software is
+# furnished to do so, subject to the following conditions:
+#
+# The above copyright notice and this permission notice shall be included in
+# all copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+# THE SOFTWARE.
+#++
+
+# 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_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

@@ -0,0 +1,23 @@
+# frozen_string_literal: true
+
+require File.expand_path('lib/petri_net/version', __dir__)
+
+Gem::Specification.new do |gem|
+  gem.authors       = ['cclausen']
+  gem.email         = ['"cclausen@tzi.de"']
+  gem.description   = 'A Petri net modeling gem'
+  gem.summary       = 'You can create Petri Nets and do some calculations with them like generating the Reachability Graph'
+  gem.homepage      = 'https://github.com/cclausen/petri_net'
+
+  gem.files         = `git ls-files`.split($OUTPUT_RECORD_SEPARATOR)
+  gem.executables   = gem.files.grep(%r{^bin/}).map { |f| File.basename(f) }
+  gem.test_files    = gem.files.grep(%r{^(test|spec|features)/})
+  gem.name          = 'petri_net_2020'
+  gem.require_paths = ['lib']
+  gem.version       = PetriNet::VERSION
+
+  gem.license       = 'MIT'
+  gem.add_dependency 'ruby-graphviz'
+  gem.add_dependency "rgl"
+  gem.add_development_dependency 'net-sftp'
+end

data/test/create.rb

@@ -0,0 +1,64 @@
+#!/usr/bin/env ruby
+# frozen_string_literal: true
+
+require 'rubygems'
+require 'logger'
+require "#{`pwd`.strip}/../lib/petri_net"
+
+puts '((Create PetriNet [Water]))'
+net = PetriNet::Net.new(name: 'Water',
+                        description: 'Creation of water from base elements')
+net.logger = Logger.new(STDOUT)
+
+puts '((Create Place 1 [Hydrogen]))'
+place = PetriNet::Place.new(name: 'Hydrogen')
+
+puts '((Add Place 1 [Hydrogen] to PetriNet))'
+net.add_place(place)
+
+puts '((Add Place 2 [Oxygen] to PetriNet))'
+net.add_place(PetriNet::Place.new(name: 'Oxygen'))
+
+puts '((Add Place 3 [Water] to PetriNet))'
+net << PetriNet::Place.new do |p|
+  p.name = 'Water'
+end
+
+puts '((Add Transition 1 [Join] to PetriNet))'
+net.add_transition(PetriNet::Transition.new(name: 'Join'))
+
+puts '((Add Arc 1 [Hydrogen.Join] to PetriNet))'
+net << PetriNet::Arc.new do |a|
+  a.name = 'Hydrogen.Join'
+  a.weight = 2
+  a.add_source(net.objects[net.places['Hydrogen']])
+  a.add_destination(net.objects[net.transitions['Join']])
+end
+
+puts '((Add Arc 2 [Oxygen.Join] to PetriNet))'
+arc = PetriNet::Arc.new do |a|
+  a.name = 'Oxygen.Join'
+  a.add_source(net.objects[net.places['Oxygen']])
+  a.add_destination(net.objects[net.transitions['Join']])
+end
+net.add_arc(arc)
+
+puts '((Add Arc 3 [Join.Water] to PetriNet))'
+net.add_arc(PetriNet::Arc.new(
+              name: 'Join.Water',
+              description: 'Join to Water',
+              source: net.objects[net.transitions['Join']],
+              destination: net.objects[net.places['Water']],
+              weight: 1
+            ))
+
+puts
+puts
+puts net.inspect
+puts
+puts
+puts net.to_s
+puts
+puts
+puts net.to_gv
+puts

data/test/reachability_graph/tc_graph.rb

@@ -0,0 +1,201 @@
+# frozen_string_literal: true
+
+require 'rubygems'
+require 'logger'
+require 'test/unit'
+
+class TestPetriNetReachabilityGraph < Test::Unit::TestCase
+  def setup
+    @net = PetriNet::Net.new(name: 'Water', description: 'Creation of water from base elements.')
+    @net.logger = Logger.new(STDOUT)
+  end
+
+  def fill_net
+    @net << PetriNet::Place.new(name: 'testplace')
+    @net << PetriNet::Transition.new(name: 'testtrans')
+    arc = PetriNet::Arc.new do |a|
+      a.name = 'testarc'
+      a.weight = 2
+      a.add_source(@net.get_place('testplace'))
+      a.add_destination(@net.get_transition('testtrans'))
+    end
+    @net << arc
+  end
+
+  def teardown
+    @net.reset
+  end
+
+  def test_trivial_generate_reachability_graph
+    assert_equal "Reachability Graph [Water]
+    ----------------------------
+    Description:
+    Filename:
+
+    Nodes
+    ----------------------------
+    1: Node1 ([])
+
+    Edges
+    ----------------------------
+
+    ", @net.generate_reachability_graph.to_s, 'Simple Reachability Graph with only one reachable state'
+  end
+
+  def test_generate_reachability_graph
+    fill_net
+    assert_equal "Reachability Graph [Water]
+    ----------------------------
+    Description:
+    Filename:
+
+    Nodes
+    ----------------------------
+    4: Node4 ([0])
+
+    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
+  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: Node6 ([1, 0]) -> 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: Node10 ([1, 0, 0]) -> 11: Node11 ([0, 1, 0]) )\n14: Edge14 10: Node10 ([1, 0, 0]) -> 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: Node7 ([1, 0]) -> 8: Node8 ([1, 1]) )\n11: Edge11 8: Node8 ([1, 1]) -> 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: Node10 ([1, 0]) -> 11: Node11 ([1, 1]) )\n14: Edge14 11: Node11 ([1, 1]) -> 13: Node13 ([Infinity]) )\n16: Edge16 10: Node10 ([1, 0]) -> 15: Node15 ([2, 0]) )\n18: Edge18 15: Node15 ([2, 0]) -> 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
+    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: Node9 ([1, 0]) -> 10: Node10 ([0, 1]) )\n13: Edge13 10: Node10 ([0, 1]) -> 9: Node9 ([1, 0]) )\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
+    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
+
+  def test_looped_net1
+    @net = PetriNet::Net.new(name: 'LoopedNet1', description: 'Should be looped')
+    @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_place('B'), destination: @net.get_transition('T2'))
+    @net << PetriNet::Arc.new(source: @net.get_transition('T1'), destination: @net.get_place('B'))
+    @net << PetriNet::Arc.new(source: @net.get_transition('T2'), destination: @net.get_place('A'))
+    @net.get_place('A').add_marking
+    @net.to_gv
+    rg = @net.generate_reachability_graph
+    rg.to_gv
+    assert_equal "Reachability Graph [LoopedNet1]\n----------------------------\nDescription: \nFilename: \n\nNodes\n----------------------------\n9: Node9 ([1, 0])\n10: Node10 ([0, 1])\n\nEdges\n----------------------------\n11: Edge11 9: Node9 ([1, 0]) -> 10: Node10 ([0, 1]) )\n13: Edge13 10: Node10 ([0, 1]) -> 9: Node9 ([1, 0]) )\n\n", rg.to_s
+  end
+end

data/test/reachability_graph/tc_node.rb

@@ -0,0 +1,65 @@
+# frozen_string_literal: true
+
+require 'rubygems'
+require 'logger'
+require 'test/unit'
+require "#{File.dirname(__FILE__)}/../../lib/petri_net"
+
+class TestReachabilityGraphNode < Test::Unit::TestCase
+  def setup
+    @net = PetriNet::Net.new(name: 'Water', description: 'Creation of water from base elements.')
+    @graph = PetriNet::ReachabilityGraph.new(@net)
+    @node = PetriNet::ReachabilityGraph::Node.new(@graph, markings: [1, 3, 5, 4, 0])
+  end
+
+  def teardown
+    @net.reset
+  end
+
+  def test_create_node
+    node = PetriNet::ReachabilityGraph::Node.new(@graph, markings: [1, 3, 5, 4, 0])
+    assert_not_nil node
+    assert_equal 'Node2', node.name
+    assert_equal [], node.inputs
+    assert_equal [], node.outputs
+    assert_equal node.name, node.label
+    assert_equal [1, 3, 5, 4, 0], node.markings
+    assert !node.omega_marked, 'should not be omega_marked as there is no omega-marking'
+  end
+
+  def test_omega_marking
+    node = PetriNet::ReachabilityGraph::Node.new(@graph, markings: [1, 3, 5, Float::INFINITY, 0])
+    assert node.omega_marked, 'should be omega_marked as there is an omega marking'
+  end
+
+  def test_adding_omega_marking
+    assert !@node.omega_marked
+    @node.add_omega 3
+    assert_equal [1, 3, 5, Float::INFINITY, 0], @node.markings
+    assert @node.omega_marked
+  end
+
+  def test_compare
+    node1 = PetriNet::ReachabilityGraph::Node.new(@graph, markings: [0, 1, 0, 0, 1])
+    node2 = PetriNet::ReachabilityGraph::Node.new(@graph, markings: [0, 1, 0, 0, 1])
+    node3 = PetriNet::ReachabilityGraph::Node.new(@graph, markings: [0, 0, 1, 0, 1])
+    node4 = PetriNet::ReachabilityGraph::Node.new(@graph, markings: [0, 2, 0, 0, 1])
+    node5 = PetriNet::ReachabilityGraph::Node.new(@graph, markings: [1, 1, 0, 0, 1])
+    node6 = PetriNet::ReachabilityGraph::Node.new(@graph, markings: [1, 1, 0, 0, 0])
+
+    assert node1 == node1
+    assert node2 == node2
+    assert node1 == node2
+    assert node1 >= node2
+    assert node1 <= node2
+    assert node3 != node1
+    assert_raise ArgumentError do node3 > node1 end
+    assert_raise ArgumentError do node3 < node1 end
+    assert node4 > node1
+    assert node1 < node4
+    assert node5 > node1
+    assert node4 != node5
+    assert_raise ArgumentError do node4 > node5 end
+    assert_raise ArgumentError do node6 > node1 end
+  end
+end