y_petri 2.0.14 → 2.0.15

data/lib/y_petri/transition/construction.rb

@@ -56,7 +56,7 @@ class YPetri::Transition
   # the stoichiometry vector, as in all other stoichiometric transitions).
   #
   #   Transition.new stoichiometry: { A: -1, B: 1 },
-  #                  rate: λ { |a| a * 0.5 }
+  #                  rate: -> a { a * 0.5 }
   #       
   def initialize *args
     check_in_arguments *args       # the big work of checking in args

data/lib/y_petri/transition.rb

@@ -8,119 +8,115 @@ require_relative 'transition/timed'
 require_relative 'transition/ordinary_timeless'
 require_relative 'transition/assignment'
 
-# A Petri net transition. Usually depicted as square boxes, transitions
-# represent operations over the net's marking vector -- how the marking changes
-# when the transition activates (_fires_).
+# Transitions -- little boxes in Petri net drawings -- represent atomic
+# operations on the Petri net's marking.
 # 
 # === Domain and codomin
 #
-# Each transition has a _domain_ -- upstream places. Upstream places are those,
-# whose marking directly affects the transition's operation. Also, each
-# transition has a _codomain_ -- downstream places. Downstream places are those,
-# whose marking is directly affected by the transition's operation.
+# Each transition has a _domain_ (upstream places) and _codomain_ (downstream
+# places). Upstream places are those, whose marking directly affects
+# the transition. Downstream places are those, whose marking is directly affected
+# by the transition.
 #
 # === Action and action vector
 #
-# Every transition has an _action_ -- the operation it represents, the of what
-# happens to the marking of its codomain when it fires. With respect to the
-# transition's codomain, we can talk about the _action vector_ -- Δ state of the
-# codomain. For _non-stoichiometric_ transitions, this action vector is given
-# as the output of the _action closure_, or (for transitions with rate) of _rate
-# vector_ * Δ_time. For _stoichiometric_ transitions, this output needs to be
-# additionally multiplied by the transition's _stoichiometry vector_.
+# Every transition has an _action_ -- the operation it represents. The action
+# of _non-stoichiometric_ transitions is directly specified by the _action_
+# _closure_ (whose output arity should match the codomain size.) For
+# _stoichiometric_ transitions, the result of the action closure has to be
+# multiplied by the transition's _stoichiometry_ _vector_ to obtain the action.
+# Action of the _transitions_ _with_ _rate_ is specified indirectly by the
+# _rate_ _closure_.
 # 
-# === Basic types of transitions
+# === Rate
+#
+# In YPetri domain model, marking is always a discrete number of _tokens_ -- as
+# Carl Adam Petri handed it down to us. YPetri recognizes the usefulness of
+# representing a large number of tokens by a floating point number, but sees it
+# as a pragmatic measure only. Other Petri net implementations often make class
+# distincion between discrete and continuous places, and also distinguish between
+# _flux_ ("flow" of the continous transitions) and _propensity_ (firing
+# probability of discrete transitions). In YPetri, flux and propensity are
+# unified under the term _rate_, and the choice between discrete and stochastic
+# computation is seen as a concern of the simulation, not of the model.
+# 
+# === Basic transition types
 # 
-# We have already mentioned different types of transitions _stoichiometric_ and
-# _non-stoichometric_, with or without rate... In total, there are 6 basic types
-# of transitions in *YPetri*:
+# There are 6 basic types of transitions in YPetri:
 #
-# * *ts* – _timeless nonstoichiometric_
-# * *tS* – _timeless stoichiometric_
-# * *Tsr* – _timed rateless nonstoichiometric_
-# * *TSr* – _timed rateless stoichiometric_
-# * *sR* – _nonstoichiometric with rate_
-# * *SR* – _stoichiometric with rate_
+# * *ts* – timeless nonstoichiometric
+# * *tS* – timeless stoichiometric
+# * *Tsr* – timed rateless nonstoichiometric
+# * *TSr* – timed rateless stoichiometric
+# * *sR* – nonstoichiometric with rate
+# * *SR* – stoichiometric with rate
 #
-# These 6 kinds of YPetri transitions correspond to the vertices of a cube, with
-# the following 3 dimensions:
+# They arise by combining the 3 basic qualities:
 # 
-# - *Stoichiometricity*: _stoichiometric_ (S) / _nonstoichiometric_ (s)
-# - *Timedness*: _timed_ (T) / _timeless_ (t)
-# - *Having rate*: _having rate_ (R) / _not having rate_, _rateless_ (r)
+# 1. *Stoichiometricity*: _stoichiometric_ (*S*) / _nonstoichiometric_ (*s*)
+# 2. *Timedness*: _timed_ (*T*) / _timeless_ (*t*)
+# 3. *Having* *rate*: having _rate_ (*R*) / not having rate (_rateless_) (*r*)
 # 
-# ==== Stoichiometricity
+# ==== 1. Stoichiometricity
 # 
-# I. For stoichiometric transitions:
-#    1. Either *rate vector* is computed as *rate * stoichiometry vector*,
-#    2. or *action vector* is computed a *action * stoichiometry vector*.
-# II. For non-stoichiometric transitions:
-#    1. Either *Rate vector* is obtained as the *rate closure result*,
-#    2. or *action vector* is obtained as the *action closure result*.
+# * For *stoichiometric* transitions:
+#   - _either_ <b>rate vector</b> is obtained as
+#     <b>rate * stoichiometry vector</b>,
+#   - _or_ <b>action vector</b> is obtained as
+#     <b>action * stoichiometry vector</b>
+# * For *non-stoichiometric* transitions:
+#   - _either_ <b>rate vector</b> is obtained as the <b>rate closure result</b>,
+#   - _or_ <b>action vector</b> is obtained as the <b>action closure result</b>.
 # 
-# Summary: stoichiometricity distinguishes the *need to multiply the rate/action
-# closure result by stoichiometry*.
+# Summary: stoichiometricity distinguishes the <b>need to multiply the
+# rate/action closure result by stoichiometry</b>.
 #
-# ==== Having rate
+# ==== 2. Having rate
 # 
-# I. For transitions with rate, the closure *returns the rate*. The rate has to
-#    be multiplied by the time step (Δt) to get the action value.
-# II. For transitions without rate (_rateless transitions_), the closure result
-#     directly specifies the action.
+# * Transitions *with* *rate* have a _rate_ _closure_, whose result is to be
+#   multiplied by +Δt+.
+# * For transitions *without* *rate* (*rateless* transitions), the action
+#   closure specifies the action *directly*.
 #
-# Summary: Having vs. not having rate distinguishes the *need to multiply the
-# closure result by Δ time* -- differentiability of the action by time.
+# Summary: Having vs. not having rate distinguishes the <b>need to multiply the
+# closure result by Δ time</b> -- differentiability of the action by time.
 #
-# ==== Timedness
+# ==== 3. Timedness
 # 
-# I. Timed transitions are defined as those, whose action has time as a
-#    parameter. Transitions with rate are thus always timed. For rateless
-#    transitions, being timed means that the action closure expects time step
-#    (Δt) as its first argument -- its arity is thus its codomain size + 1.
-# II. Timeless transitions, in turn, are those, whose action is does not have
-#     time a parameter. Timeless transitions are necessarily also rateless.
-#     Arity of their action closure can be expected to match the domain size.
+# * Timed transitions are defined as those, whose action has time as a parameter.
+#   - Transitions with rate are therefore always timed.
+#   - For rateless transitions, being timed means, that their action closure
+#     <b>expects Δt as its first argument</b> -- arity thus equals codomain
+#     size + 1.
+# * Timeless transitions are those, whose action does not have time as
+#   a parameter. Timeless transitions are necessarily also rateless.
 # 
-# Summary: In rateless transitions, timedness distinguishes the *need to supply
-# time step duration as the first argument to the action closure*. Whereas the
-# transitions with rate are always timed, and vice-versa, timeless transitions
-# always rateless, there are only 6 instead of 2 ** 3 == 8 basic types.
+# Summary: In rateless transitions, timedness distinguishes the <b>need to
+# supply time step duration as the first argument to the action closure</b>.
+# As the transitions with rate are necessarily timed, and timeless transitions
+# necessarily rateless, there are only 6 instead of 2 ** 3 == 8 transition types.
 #
-# === Other transition types
+# === Other transition attributes
 #
-# ==== Assignment transitions (_A transitions_)
-# If +:assignment_action+ is set to _true_, it indicates that the transition
-# action entirely replaces the marking of its codomain with the result of its
-# action closure -- like we are used to from spreadsheets. This behavior does
-# not represent a truly novel type of a transition -- assignment transition is
-# merely a *ts transition that cares to clear the codomain before adding the
-# new value to it*. In other words, this behavior is (at least for numeric
-# types) already achievable with ordinary ts transitions, and existence of
-# specialized A transitions is just a convenience.
+# ==== Assignment transitions (_A_ _transitions_)
+# If +:assignment_action+ option is set to _true_, it makes the transition
+# entirely replace the codomain marking with its action closure result -- just
+# like spreadsheet functions do. This, however, is just a convenience, and does
+# not constitue a novel transition type, as it can be easily emulated by an
+# ordinary ts transition caring to subtract the current domain marking before
+# adding the desired values.
 #
-# ==== Functional / Functionless transitions
-# YPetri is a domain model of _functional Petri nets_. Original Petri's
+# ==== _Functional_ / _functionless_ transitions
+# Other Petri net implementation often make a distinction between "ordinary"
+# and "functional" transitions, where "ordinary" ("functionless") are the
+# transitions as Carl Adam Petri handed them down to us. YPetri transtions
+# are generally "functional", but the possibility of functionless transitions
+# is also provided -- stoichiometric transitions with no action or rate
+# specified become functionless transitions.
 # definition does not speak about transition "functions". The transitions are
 # defined as timeless and more or less assumed to be stoichiometric. Therefore,
 # in +YPetri::Transition+ constructor, stoichiometric transitions with no
 # function specified become functionless vanilla Petri net transitions.
-#
-# === "Discrete" vs. "continuous" in YPetri
-#
-# YPetri uses terminology of both "discrete" and "continuous" Petri nets. But
-# in fact, in YPetri domain model, place marking is always considered discrete
-# -- a discrete number of _tokens_, as defined by Carl Adam Petri. The meaning
-# of _continuous_ in YPetri is different: A pragmatic measure of approximating
-# this integer by a floating point number when the integer is so large, that the
-# impact of this approximation is acceptable. The responsibility for the
-# decision of how to represent the number of tokens is not a concern of the
-# domain model, but only of the simulation method. Therefore, in YPetri, there
-# are no _a priori_ "discrete" and "continuous" places or transitions.
-#
-# As for the transitions, terms _flux_ (flow), associated with continuous
-# transitions, and _propensity_, associated with discrete stochastic
-# transitions, are unified as _rate_. Again, the decision between "discrete"
-# and "stochastic" is a concern of the simulation method, not the domain model.
 # 
 class YPetri::Transition
   include NameMagic

data/lib/y_petri/version.rb

@@ -1,4 +1,4 @@
 module YPetri
-  VERSION = "2.0.14"
+  VERSION = "2.0.15"
   DEBUG = false
 end

data/lib/y_petri/workspace/parametrized_subclassing.rb

@@ -8,7 +8,8 @@ module YPetri::Workspace::ParametrizedSubclassing
 
     # Make them namespaces and inject dependencies:
     [ @Place, @Transition, @Net ].each do |klass|
-      klass.namespace!.class_exec do # make'em work together
+      klass.namespace!
+      klass.class_exec do # make'em work together
         define_method :Place do place_subclass end
         define_method :Transition do transition_subclass end
         define_method :Net do net_subclass end

data/lib/y_petri.rb

@@ -22,7 +22,6 @@ require_relative 'y_petri/place'
 require_relative 'y_petri/transition'
 require_relative 'y_petri/net'
 require_relative 'y_petri/simulation'
-require_relative 'y_petri/timed_simulation'
 require_relative 'y_petri/workspace'
 require_relative 'y_petri/manipulator'
 
@@ -48,7 +47,7 @@ module YPetri
   DEFAULT_SIMULATION_SETTINGS = lambda do
     { step_size: 0.02,
       sampling_period: 2,
-      target_time: 60 }
+      time: 0..60 }
   end
 
   GuardError = Class.new TypeError

data/test/acceptance/basic_usage_test.rb

@@ -23,7 +23,7 @@ describe "Basic use of TimedSimulation" do
   it "should work" do
     @m.net.must_be_kind_of ::YPetri::Net
     @m.run!
-    @m.simulation.must_be_kind_of ::YPetri::TimedSimulation
+    @m.simulation.must_be_kind_of ::YPetri::Simulation
     @m.plot_state
     sleep 3
   end

data/test/manipulator_test.rb

@@ -79,7 +79,7 @@ describe ::YPetri::Manipulator do
       @m.initial_marking @q => 2
       @m.set_step 0.01
       @m.set_sampling 1
-      @m.set_time 30
+      @m.set_time 0..30
     end
     
     it "works" do

data/test/net_test.rb

@@ -13,7 +13,8 @@ describe YPetri::Net do
     @pç = pç = Class.new YPetri::Place
     @nç = nç = Class.new YPetri::Net
     [ tç, pç, nç ].each { |ç|
-      ç.namespace!.class_exec {
+      ç.namespace!
+      ç.class_exec {
         define_method :Place do pç end
         define_method :Transition do tç end
         define_method :Net do nç end

data/test/place_test.rb

@@ -79,6 +79,8 @@ describe YPetri::Place do
     @p.guards.size.must_equal 4
     g = @p.federated_guard_closure
     -> { g.( 11.1 ) }.must_raise YPetri::GuardError
-    -> { @p.marking = -1.11 }.must_raise YPetri::GuardError
+    begin; @p.marking = -1.11; rescue YPetri::GuardError => err
+      err.message.must_equal 'Marking -1.11:Float of P1 should not be negative!'
+    end
   end
 end

data/test/simulation_test.rb

@@ -13,7 +13,8 @@ describe ::YPetri::Simulation do
     @tç = tç = Class.new( ::YPetri::Transition )
     @nç = nç = Class.new( ::YPetri::Net )
     [ @pç, @tç, @nç ].each { |klass|
-      klass.namespace!.class_exec {
+      klass.namespace!
+      klass.class_exec {
         private
         define_method :Place do pç end
         define_method :Transition do tç end
@@ -135,16 +136,16 @@ describe ::YPetri::Simulation do
   end
 
   it "has stoichiometry matrix for 3. tS transitions" do
-    @s.S_for_tS.must_equal Matrix.empty( 3, 0 )
+    @s.S_tS.must_equal Matrix.empty( 3, 0 )
   end
 
   it "has stoichiometry matrix for 4. Sr transitions" do
-    @s.S_for_TSr.must_equal Matrix.empty( 3, 0 )
+    @s.S_TSr.must_equal Matrix.empty( 3, 0 )
   end
 
   it "has stoichiometry matrix for 6. SR transitions" do
-    @s.S_for_SR.must_equal Matrix[[-1,  0, -1], [0, 1, 0], [1, 0, 1]]
-    @s.S.must_equal @s.S_for_SR
+    @s.S_SR.must_equal Matrix[[-1,  0, -1], [0, 1, 0], [1, 0, 1]]
+    @s.S.must_equal @s.S_SR
   end
 
   it "presents 1. ts" do
@@ -227,13 +228,13 @@ describe ::YPetri::Simulation do
 
   it "2. handles Tsr transitions" do
     @s.Δ_closures_for_Tsr.must_equal []
-    @s.Δ_for_Tsr( 1.0 ).must_equal Matrix.zero( @s.free_pp.size, 1 )
+    @s.Δ_Tsr( 1.0 ).must_equal Matrix.zero( @s.free_pp.size, 1 )
   end
 
   it "3. handles tS transitions" do
     @s.action_closures_for_tS.must_equal []
     @s.action_vector_for_tS.must_equal Matrix.column_vector( [] )
-    @s.α_for_t.must_equal Matrix.column_vector( [] )
+    @s.ᴀ_t.must_equal Matrix.column_vector( [] )
     @s.Δ_if_tS_fire_once.must_equal Matrix.zero( @s.free_pp.size, 1 )
   end
 
@@ -242,14 +243,14 @@ describe ::YPetri::Simulation do
     @s.action_closures_for_Tr.must_equal []
     @s.action_vector_for_TSr( 1.0 ).must_equal Matrix.column_vector( [] )
     @s.action_vector_for_Tr( 1.0 ).must_equal Matrix.column_vector( [] )
-    @s.Δ_for_TSr( 1.0 ).must_equal Matrix.zero( @s.free_pp.size, 1 )
+    @s.Δ_TSr( 1.0 ).must_equal Matrix.zero( @s.free_pp.size, 1 )
   end
 
   it "5. handles sR transitions" do
     assert_equal [], @s.rate_closures_for_sR
     assert_equal [], @s.rate_closures_for_s
     # @s.gradient_for_sR.must_equal Matrix.zero( @s.free_pp.size, 1 )
-    @s.Δ_Euler_for_sR( 1.0 ).must_equal Matrix.zero( @s.free_pp.size, 1 )
+    @s.Δ_sR( 1.0 ).must_equal Matrix.zero( @s.free_pp.size, 1 )
   end
 
   it "6. handles stoichiometric transitions with rate" do
@@ -259,11 +260,11 @@ describe ::YPetri::Simulation do
     @s.flux_vector_for_SR.must_equal Matrix.column_vector( [ 0.4, 1.0, 1.5 ] )
     @s.φ_for_SR.must_equal @s.flux_vector
     @s.SR_tt( :φ_for_SR ).must_equal( { T1: 0.4, T2: 1.0, T3: 1.5 } )
-    @s.Euler_action_vector_for_SR( 1 )
+    @s.first_order_action_vector_for_SR( 1 )
       .must_equal Matrix.column_vector [ 0.4, 1.0, 1.5 ]
-    @s.SR_tt( :Euler_action_for_SR, 1 ).must_equal( T1: 0.4, T2: 1.0, T3: 1.5 )
-    @s.Δ_Euler_for_SR( 1 ).must_equal Matrix[[-1.9], [1.0], [1.9]]
-    @s.free_pp( :Δ_Euler_for_SR, 1 ).must_equal( { P2: -1.9, P3: 1.0, P4: 1.9 } )
+    @s.SR_tt( :first_order_action_for_SR, 1 ).must_equal( T1: 0.4, T2: 1.0, T3: 1.5 )
+    @s.Δ_SR( 1 ).must_equal Matrix[[-1.9], [1.0], [1.9]]
+    @s.free_pp( :Δ_SR, 1 ).must_equal( { P2: -1.9, P3: 1.0, P4: 1.9 } )
   end
 
   it "presents sparse stoichiometry vectors for its transitions" do

data/test/timed_simulation_test.rb

@@ -13,7 +13,7 @@ include Pyper if require 'pyper'
 # Test of TimedSimulation class.
 # **************************************************************************
 #
-describe YPetri::TimedSimulation do  
+describe YPetri::Simulation::Timed do  
   before do
     # skip "to speed up testing"
     @a = YPetri::Place.new default_marking: 1.0
@@ -30,37 +30,41 @@ describe YPetri::TimedSimulation do
 
     describe "simulation with step size 1" do
       before do
-        @sim = YPetri::TimedSimulation.new net: @net,
-                                           initial_marking: @im_collection,
-                                           step: 1,
-                                           sampling: 10,
-                                           target_time: 100
+        @sim = YPetri::Simulation.new net: @net,
+                                      initial_marking: @im_collection,
+                                      step: 1,
+                                      sampling: 10,
+                                      time: 0..100
       end
 
       it "should #step! with expected results" do
         m = @sim.step!.marking
-        assert_in_delta 0.8, m[ 0 ], 1e-9
-        assert_in_delta 1.8, m[ 1 ], 1e-9
-        assert_in_delta 3.2, m[ 2 ], 1e-9
+        assert_in_delta 0.8, m[0]
+        assert_in_delta 1.8, m[1]
+        assert_in_delta 3.2, m[2]
       end
 
       it "should behave" do
-        assert_in_delta 0, ( Matrix.column_vector( [-0.02, -0.02, 0.02] ) -
-                             @sim.ΔE( 0.1 ) ).column( 0 ).norm, 1e-9
+        expect = Matrix.column_vector [-0.02, -0.02, 0.02]
+        ( expect - @sim.ΔE( 0.1 ) ).column( 0 ).norm.must_be_within_delta 0
+        @sim.Euler_step! 0.1
+        expect = Matrix.column_vector [0.98, 1.98, 3.02]
+        ( expect - @sim.marking_vector ).column( 0 ).norm.must_be_within_delta 0
+        @sim.method.must_equal :pseudo_Euler
+        @sim.send :reset!
         @sim.step! 0.1
-        assert_in_delta 0, ( Matrix.column_vector( [0.98, 1.98, 3.02] ) -
-                             @sim.marking_vector ).column( 0 ).norm, 1e-9
-
+        expect = Matrix.column_vector [0.98, 1.98, 3.02]
+        ( expect - @sim.marking_vector ).column( 0 ).norm.must_be_within_delta 0
       end
     end
 
     describe "simulation with step size 0.1" do
       before do
-        @sim = YPetri::TimedSimulation.new net: @net,
-                                           initial_marking: @im_collection,
-                                           step: 0.1,
-                                           sampling: 10,
-                                           target_time: 100
+        @sim = YPetri::Simulation.new net: @net,
+                                      initial_marking: @im_collection,
+                                      step: 0.1,
+                                      sampling: 10,
+                                      time: 0..100
       end
 
       it "should behave" do
@@ -72,7 +76,7 @@ describe YPetri::TimedSimulation do
       end
 
       it "should behave" do
-        @sim.run_until_target_time! 31
+        @sim.run_until 31
         expected_recording = {
           0 => [ 1, 2, 3 ],
           10 => [ 0.22265, 1.22265, 3.77735 ],
@@ -102,7 +106,7 @@ describe YPetri::TimedSimulation do
 
     describe "behavior of #step" do
       before do
-        @sim = YPetri::TimedSimulation.new net: @net,
+        @sim = YPetri::Simulation.new net: @net,
                  initial_marking: [ @a, @b, @c ].τBᴍHτ( &:default_marking ),
                  step: 1,
                  sampling: 10
@@ -124,11 +128,11 @@ describe YPetri::TimedSimulation do
                                      domain: @b,
                                      rate: -> a { a * 0.5 }
       @net = YPetri::Net.new << @a << @b << @c << @t3
-      @sim = YPetri::TimedSimulation.new net: @net,
-               initial_marking: { @a => 1, @b => 0.6, @c => 3 },
-               step: 1,
-               sampling: 10,
-               target_time: 2
+      @sim = YPetri::Simulation.new net: @net,
+                                    initial_marking: { @a => 1, @b => 0.6, @c => 3 },
+                                    step: 1,
+                                    sampling: 10,
+                                    time: 0..2
     end
 
     it "should exhibit correct behavior of #step" do

data/test/workspace_test.rb

@@ -25,7 +25,7 @@ describe YPetri::Workspace do
     @pp, @tt = [a, b, c], [t1, t2]
     @f_name = "test_output.csv"
     @w.set_imc @pp.τBᴍHτ( &:default_marking )
-    @w.set_ssc step: 0.1, sampling: 10, target_time: 50
+    @w.set_ssc step: 0.1, sampling: 10, time: 0..50
     @w.set_cc( {} )
     @sim = @w.new_timed_simulation
     File.delete @f_name rescue nil

data/test/y_petri_test.rb

@@ -11,10 +11,8 @@ require_relative '../lib/y_petri'     # tested component itself
 # 
 describe YPetri do
   it "should have basic classes" do
-    assert [ :Place, :Transition, :Net,
-             :Simulation, :TimedSimulation,
-             :Workspace, :Manipulator
-           ].all? { |ß| YPetri.const_get( ß ).is_a? Module }
+    [ :Place, :Transition, :Net, :Simulation, :Workspace, :Manipulator ]
+      .each { |ß| YPetri.const_get( ß ).must_be_kind_of Module }
   end
 end
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: y_petri
 version: !ruby/object:Gem::Version
-  version: 2.0.14
+  version: 2.0.15
 platform: ruby
 authors:
 - boris
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-06-27 00:00:00.000000000 Z
+date: 2013-06-30 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: y_support
@@ -82,7 +82,8 @@ files:
 - lib/y_petri/place/arcs.rb
 - lib/y_petri/place/guard.rb
 - lib/y_petri/simulation.rb
-- lib/y_petri/timed_simulation.rb
+- lib/y_petri/simulation/collections.rb
+- lib/y_petri/simulation/timed.rb
 - lib/y_petri/transition.rb
 - lib/y_petri/transition/arcs.rb
 - lib/y_petri/transition/assignment.rb