diff --git a/README.md b/README.md
new file mode 100644
index 0000000000000000000000000000000000000000..87de015ded026f348a4c368c7b2c0aff28537e13
--- /dev/null
+++ b/README.md
@@ -0,0 +1,40 @@
+SimpleKit for Ruby is a minimalist implementation of discrete event
+simulation using event graphs.
+
+Copyright (C) 2012-2018  Paul J. Sanchez
+
+This library is free software; you can redistribute it and/or
+modify it under the terms of the MIT free software license.
+
+**This library is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.**
+
+### DESCRIPTION
+
+SimpleKit for Ruby is a very minimal Ruby implementation of discrete event
+simulation based on Lee Schruben's "Event Graph" approach.  I wrote it to
+illustrate to CS students how simulation works "under the hood".  You are
+welcome to use it as you wish so long as you clearly understand that it was
+created to be a teaching tool.  For serious simulation modeling with event
+graphs I recommend Lee Schruben's `SIGMA` package or Arnie Buss's `SimKit`.
+
+### WHAT'S WHAT
+
+This top level folder contains this file, `README.md`, and the
+`simplekit.gemspec` used to create the gem installation.
+
+To install `SimpleKit` for Ruby, use Ruby's `gem` command:
+
+	gem build simplekit.gemspec
+	gem install simplekit-<version>.gem
+
+(You may need to authenticate as an administrator to install gems.)
+
+There are two subdirectories.  Source code for `SimpleKit` can be found
+in `lib/simplekit.rb`.  Local documentation can be generated using Ruby's
+`rdoc` command or `yard`.
+
+Examples can be found in the `demos` folder, which contains several relatively simple models to
+illustrate `SimpleKit` usage.  These include samples of
+event scheduling, both with and without arguments, and event cancellation.
diff --git a/ReadMe.1st b/ReadMe.1st
deleted file mode 100644
index 873ee6506806538bb554059abe3ae5df39b1bacd..0000000000000000000000000000000000000000
--- a/ReadMe.1st
+++ /dev/null
@@ -1,43 +0,0 @@
-SimpleKit-ruby is a minimalist Ruby library which implements discrete event
-simulation using event graphs.
-
-Copyright (C) 2012-2017  Paul J. Sanchez
-
-This library is free software; you can redistribute it and/or
-modify it under the terms of the MIT free software license.
-
-This library is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
-
-DESCRIPTION
-
-SimpleKit-ruby is a very minimal Ruby implementation of discrete event
-simulation based on Lee Schruben's "Event Graph" approach.  I wrote it
-to illustrate to CS students how simulation works.  You are welcome to
-use it as long as you clearly understand that it was designed as a
-teaching tool.  For serious simulation modeling with event graphs I
-recommend Lee Schruben's SIGMA package or Arnie Buss's SimKit.
-
-WHAT'S WHAT
-
-This top level folder contains this file, "ReadMe.1st", the
-simplekit.gemspec used to create the gem installation.
-
-To install SimpleKit-ruby, use Ruby's "gem" command:
-
-	gem build simplekit.gemspec
-	gem install simplekit-<version>.gem
-
-You may need to authenticate as an administrator to install gems.
-
-There are two subdirectories.  Source code for SimpleKit-ruby can be found
-in lib/simplekit.rb.  Documentation can be generated using Ruby's
-rdoc command.
-
-The second subdirectory is "demos", and contains three simple models to
-illustrate SimpleKit-ruby usage.  "MyModel.rb" demonstrates basic event
-scheduling and halting the model.  "MyModelArgs.rb" uses random times
-for the event scheduling, and shows how to schedule with arguments for
-the event methods.  Finally, "MMk.rb" implements an M/M/k queueing
-model.
diff --git a/demos/AoModel.rb b/demos/AoModel.rb
index a7649e4f883dbf8af3542f85ca7b705363ac3427..99a1c0f6e6c2180ec46903eb02c7a4b3d5be0bd7 100644
--- a/demos/AoModel.rb
+++ b/demos/AoModel.rb
@@ -1,6 +1,5 @@
 #!/usr/bin/env ruby
 
-require 'rubygems' if RUBY_VERSION =~ /^1\.8/
 require_relative '../lib/simplekit'
 
 # Demonstration model of Operational Availability (Ao).
diff --git a/demos/CancelQ.rb b/demos/CancelQ.rb
new file mode 100644
index 0000000000000000000000000000000000000000..7880f7017c4c30ce8f56e133c309c1dad391a070
--- /dev/null
+++ b/demos/CancelQ.rb
@@ -0,0 +1,22 @@
+#!/usr/bin/env ruby
+
+require_relative '../lib/simplekit'
+
+class MyModel
+  include SimpleKit
+
+  def init
+    @x = 1
+    schedule(:increment, rand(2), n: 1, char: 'z'.ord)
+    cancel(:increment, char: 'q'.ord)
+  end
+
+  def increment(n:, char:)
+    @x += n
+    printf "%f, %f, %c\n", model_time, @x, char
+    schedule(:increment, 2.0 * rand(2), n: @x, char: char - 1, priority: 3)
+  end
+end
+
+srand(42)
+MyModel.new.run
diff --git a/demos/MMk.rb b/demos/MMk.rb
index 90b37062778ebf886e8c22c0c3615ba3ff1b5619..241f34b1122064c9e064a801e2d752dff2e1c7d7 100644
--- a/demos/MMk.rb
+++ b/demos/MMk.rb
@@ -1,6 +1,5 @@
 #!/usr/bin/env ruby
 
-require 'rubygems' if RUBY_VERSION =~ /^1\.8/
 require_relative '../lib/simplekit'
 
 # Demonstration model of an M/M/k queueing system.  There are k servers
diff --git a/demos/MMk_shutdown.rb b/demos/MMk_shutdown.rb
new file mode 100644
index 0000000000000000000000000000000000000000..78c24487c2ccf5555b6dacf48014174f15bc183e
--- /dev/null
+++ b/demos/MMk_shutdown.rb
@@ -0,0 +1,80 @@
+#!/usr/bin/env ruby
+
+require_relative '../lib/simplekit'
+
+# Demonstration model of an M/M/k queueing system.  There are k servers
+# and both the arrival and service processes are memoryless (exponential).
+class MMk
+  include SimpleKit
+
+  # Constructor - initializes the model parameters.
+  # param: arrival_rate - The rate at which customers arrive to the system.
+  # param: service_rate - The rate at which individual servers serve.
+  # param: max_servers - The total number of servers in the system.
+  def initialize(arrival_rate, service_rate, max_servers)
+    @arrival_rate = arrival_rate
+    @service_rate = service_rate
+    @max_servers = max_servers
+  end
+
+  # Initialize the model state and schedule any necessary events.
+  # Note that this particular model will terminate based on
+  # time by scheduling a halt 100 time units in the future.
+  def init
+    @num_available_servers = @max_servers
+    @q_length = 0
+    schedule(:arrival, 0.0)
+    schedule(:close_doors, 100.0)
+    dump_state('init')
+  end
+
+  # An arrival event increments the queue length, schedules the next
+  # arrival, and schedules a begin_service event if a server is available.
+  def arrival
+    @q_length += 1
+    schedule(:arrival, exponential(@arrival_rate))
+    schedule(:begin_service, 0.0) if @num_available_servers > 0
+    dump_state('arrival')
+  end
+
+  # Start service for the first customer in line, removing that
+  # customer from the queue and utilizing one of the available servers.
+  # An end_service will be scheduled.
+  def begin_service
+    @q_length -= 1
+    @num_available_servers -= 1
+    schedule(:end_service, exponential(@service_rate))
+    dump_state('begin svc')
+  end
+
+  # Frees up an available server, and schedules a begin_service if
+  # anybody is waiting in line.
+  def end_service
+    @num_available_servers += 1
+    schedule(:begin_service, 0.0) if @q_length > 0
+    dump_state('end svc')
+  end
+
+  def close_doors
+    cancel(:arrival)
+  end
+
+  # Exponential random variate generator.
+  # param: rate - The rate (= 1 / mean) of the distribution.
+  # returns: A realization of the specified distribution.
+  def exponential(rate)
+    -Math.log(rand) / rate
+  end
+
+  # A report mechanism which dumps the time, current event, and values
+  # of the state variables to the console.
+  # param: event - The name of the event which invoked this method.
+  def dump_state(event)
+    printf "Time: %8.3f\t%10s - Q: %d\tServers Available: %d\n",
+           model_time, event, @q_length, @num_available_servers
+  end
+end
+
+# Instantiate an MMk object with a particular parameterization and run it.
+srand 7_654_321
+MMk.new(4.5, 1.0, 5).run
diff --git a/demos/MyModel.rb b/demos/MyModel.rb
index b91fbee2daaf8bb890b6df03febdd2f0d65a5bbf..fa336619e5d494290b01ea2ca07a73cb09c1cf87 100644
--- a/demos/MyModel.rb
+++ b/demos/MyModel.rb
@@ -1,7 +1,6 @@
 #!/usr/bin/env ruby
 
-require 'rubygems' if RUBY_VERSION =~ /^1\.8/
-require 'simplekit'
+require_relative '../lib/simplekit'
 
 class MyModel
   include SimpleKit
diff --git a/demos/MyModelArgs.rb b/demos/MyModelArgs.rb
index 1af10706df56b50ac426c4a6d18e14b985a5fe7b..db78ae0dafacd36f44dac3bd12eddd2a9a9287af 100644
--- a/demos/MyModelArgs.rb
+++ b/demos/MyModelArgs.rb
@@ -1,6 +1,5 @@
 #!/usr/bin/env ruby
 
-require 'rubygems' if RUBY_VERSION =~ /^1\.8/
 require_relative '../lib/simplekit'
 
 class MyModel
@@ -8,14 +7,14 @@ class MyModel
 
   def init
     @x = 1
-    schedule(:increment, rand(2), 1, 97)
+    schedule(:increment, rand(2), n: 1, char: 'z'.ord)
   end
 
-  def increment(n, c)
+  def increment(n:, char:)
     @x += n
-    schedule(:increment, 2.0 * rand(2), @x, c + 1)
-    printf "%f, %f, %c\n", model_time, @x, c
-    schedule(:halt, 0.0) if model_time > 10
+    schedule(:increment, 2.0 * rand(2), n: @x, char: char - 1, priority: 3)
+    printf "%f, %f, %c\n", model_time, @x, char
+    cancel_all :increment if model_time > 10
   end
 end
 
diff --git a/demos/sptf.rb b/demos/sptf.rb
new file mode 100644
index 0000000000000000000000000000000000000000..34b0f0f1b02a15900fd66c4c600469c48f773526
--- /dev/null
+++ b/demos/sptf.rb
@@ -0,0 +1,86 @@
+#!/usr/bin/env ruby
+
+require_relative '../lib/simplekit'
+
+# Create a Customer Struct that will store arrival times and processing times.
+Customer = Struct.new(:arrival_time, :processing_time) do
+  include Comparable
+  # rank customers by their processing times, smallest first.
+  def <=>(other)
+    processing_time <=> other.processing_time
+  end
+end
+
+# Demonstration model of a shortest-processing-time-first queueing system.
+# There are k servers and both the arrival and service processes could
+# be anything.
+class SPTF
+  include SimpleKit
+
+  # Constructor - initializes the model parameters.
+  # param: arrivalRate - The rate at which customers arrive to the system.
+  # param: serviceRate - The rate at which individual servers serve.
+  # param: maxServers - The total number of servers in the system.
+  # param: closeTime - The time the server would like to shut down.
+  def initialize(arrivalRate, serviceRate, maxServers, closeTime)
+    @arrivalRate = arrivalRate
+    @serviceRate = serviceRate
+    @maxServers = maxServers
+    @closeTime = closeTime
+  end
+
+  # Initialize the model state and schedule any necessary events.
+  def init
+    @numAvailableServers = @maxServers
+    @q = PriorityQueue.new
+    schedule(:arrival, 0.0)
+    schedule(:close_doors, @closeTime)
+  end
+
+
+  # An arrival event generates a customer and their associated service
+  # time, adds the customer to the queue, schedules the next arrival,
+  # and schedules a beginService event if a server is available.
+  def arrival
+    @q.push Customer.new(model_time, exponential(@serviceRate))
+    schedule(:arrival, exponential(@arrivalRate))
+    schedule(:beginService, 0.0) if (@numAvailableServers > 0)
+  end
+
+  # Start service for the first customer in line, removing that
+  # customer from the queue and utilizing one of the available
+  # servers.  An endService will be scheduled.  Report the current
+  # time and how long this customer spent in line.
+  def beginService
+    current_customer = @q.pop
+    @numAvailableServers -= 1
+    schedule(:endService, current_customer.processing_time)
+    printf "%f,%f\n", model_time, model_time - current_customer.arrival_time
+  end
+
+  # Frees up an available server, and schedules a beginService if
+  # anybody is waiting in line.  If the line is empty and it's after
+  # the desired closing time, halt the simulation.
+  def endService
+    @numAvailableServers += 1
+    unless @q.empty?
+      schedule(:beginService, 0.0)
+    end
+  end
+
+  # Commence shutdown by denying the next :arrival
+  def close_doors
+    cancel :arrival
+  end
+
+  # Exponential random variate generator.
+  # param: rate - The rate (= 1 / mean) of the distribution.
+  # returns: A realization of the specified distribution.
+  def exponential(rate)
+    -Math.log(rand) / rate
+  end
+end
+
+# Instantiate an SPTF object with a particular parameterization and run it.
+srand(9876543)  # set seed for repeatability
+SPTF.new(6, 1.0, 5, 20.0).run
diff --git a/lgpl.txt b/lgpl.txt
deleted file mode 100644
index b1e3f5a2638797271cbc9b91b856c05ed6942c8f..0000000000000000000000000000000000000000
--- a/lgpl.txt
+++ /dev/null
@@ -1,504 +0,0 @@
-		  GNU LESSER GENERAL PUBLIC LICENSE
-		       Version 2.1, February 1999
-
- Copyright (C) 1991, 1999 Free Software Foundation, Inc.
-     59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-[This is the first released version of the Lesser GPL.  It also counts
- as the successor of the GNU Library Public License, version 2, hence
- the version number 2.1.]
-
-			    Preamble
-
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-Licenses are intended to guarantee your freedom to share and change
-free software--to make sure the software is free for all its users.
-
-  This license, the Lesser General Public License, applies to some
-specially designated software packages--typically libraries--of the
-Free Software Foundation and other authors who decide to use it.  You
-can use it too, but we suggest you first think carefully about whether
-this license or the ordinary General Public License is the better
-strategy to use in any particular case, based on the explanations below.
-
-  When we speak of free software, we are referring to freedom of use,
-not price.  Our General Public Licenses are designed to make sure that
-you have the freedom to distribute copies of free software (and charge
-for this service if you wish); that you receive source code or can get
-it if you want it; that you can change the software and use pieces of
-it in new free programs; and that you are informed that you can do
-these things.
-
-  To protect your rights, we need to make restrictions that forbid
-distributors to deny you these rights or to ask you to surrender these
-rights.  These restrictions translate to certain responsibilities for
-you if you distribute copies of the library or if you modify it.
-
-  For example, if you distribute copies of the library, whether gratis
-or for a fee, you must give the recipients all the rights that we gave
-you.  You must make sure that they, too, receive or can get the source
-code.  If you link other code with the library, you must provide
-complete object files to the recipients, so that they can relink them
-with the library after making changes to the library and recompiling
-it.  And you must show them these terms so they know their rights.
-
-  We protect your rights with a two-step method: (1) we copyright the
-library, and (2) we offer you this license, which gives you legal
-permission to copy, distribute and/or modify the library.
-
-  To protect each distributor, we want to make it very clear that
-there is no warranty for the free library.  Also, if the library is
-modified by someone else and passed on, the recipients should know
-that what they have is not the original version, so that the original
-author's reputation will not be affected by problems that might be
-introduced by others.
-
-  Finally, software patents pose a constant threat to the existence of
-any free program.  We wish to make sure that a company cannot
-effectively restrict the users of a free program by obtaining a
-restrictive license from a patent holder.  Therefore, we insist that
-any patent license obtained for a version of the library must be
-consistent with the full freedom of use specified in this license.
-
-  Most GNU software, including some libraries, is covered by the
-ordinary GNU General Public License.  This license, the GNU Lesser
-General Public License, applies to certain designated libraries, and
-is quite different from the ordinary General Public License.  We use
-this license for certain libraries in order to permit linking those
-libraries into non-free programs.
-
-  When a program is linked with a library, whether statically or using
-a shared library, the combination of the two is legally speaking a
-combined work, a derivative of the original library.  The ordinary
-General Public License therefore permits such linking only if the
-entire combination fits its criteria of freedom.  The Lesser General
-Public License permits more lax criteria for linking other code with
-the library.
-
-  We call this license the "Lesser" General Public License because it
-does Less to protect the user's freedom than the ordinary General
-Public License.  It also provides other free software developers Less
-of an advantage over competing non-free programs.  These disadvantages
-are the reason we use the ordinary General Public License for many
-libraries.  However, the Lesser license provides advantages in certain
-special circumstances.
-
-  For example, on rare occasions, there may be a special need to
-encourage the widest possible use of a certain library, so that it becomes
-a de-facto standard.  To achieve this, non-free programs must be
-allowed to use the library.  A more frequent case is that a free
-library does the same job as widely used non-free libraries.  In this
-case, there is little to gain by limiting the free library to free
-software only, so we use the Lesser General Public License.
-
-  In other cases, permission to use a particular library in non-free
-programs enables a greater number of people to use a large body of
-free software.  For example, permission to use the GNU C Library in
-non-free programs enables many more people to use the whole GNU
-operating system, as well as its variant, the GNU/Linux operating
-system.
-
-  Although the Lesser General Public License is Less protective of the
-users' freedom, it does ensure that the user of a program that is
-linked with the Library has the freedom and the wherewithal to run
-that program using a modified version of the Library.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.  Pay close attention to the difference between a
-"work based on the library" and a "work that uses the library".  The
-former contains code derived from the library, whereas the latter must
-be combined with the library in order to run.
-
-		  GNU LESSER GENERAL PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. This License Agreement applies to any software library or other
-program which contains a notice placed by the copyright holder or
-other authorized party saying it may be distributed under the terms of
-this Lesser General Public License (also called "this License").
-Each licensee is addressed as "you".
-
-  A "library" means a collection of software functions and/or data
-prepared so as to be conveniently linked with application programs
-(which use some of those functions and data) to form executables.
-
-  The "Library", below, refers to any such software library or work
-which has been distributed under these terms.  A "work based on the
-Library" means either the Library or any derivative work under
-copyright law: that is to say, a work containing the Library or a
-portion of it, either verbatim or with modifications and/or translated
-straightforwardly into another language.  (Hereinafter, translation is
-included without limitation in the term "modification".)
-
-  "Source code" for a work means the preferred form of the work for
-making modifications to it.  For a library, complete source code means
-all the source code for all modules it contains, plus any associated
-interface definition files, plus the scripts used to control compilation
-and installation of the library.
-
-  Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running a program using the Library is not restricted, and output from
-such a program is covered only if its contents constitute a work based
-on the Library (independent of the use of the Library in a tool for
-writing it).  Whether that is true depends on what the Library does
-and what the program that uses the Library does.
-  
-  1. You may copy and distribute verbatim copies of the Library's
-complete source code as you receive it, in any medium, provided that
-you conspicuously and appropriately publish on each copy an
-appropriate copyright notice and disclaimer of warranty; keep intact
-all the notices that refer to this License and to the absence of any
-warranty; and distribute a copy of this License along with the
-Library.
-
-  You may charge a fee for the physical act of transferring a copy,
-and you may at your option offer warranty protection in exchange for a
-fee.
-
-  2. You may modify your copy or copies of the Library or any portion
-of it, thus forming a work based on the Library, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
-    a) The modified work must itself be a software library.
-
-    b) You must cause the files modified to carry prominent notices
-    stating that you changed the files and the date of any change.
-
-    c) You must cause the whole of the work to be licensed at no
-    charge to all third parties under the terms of this License.
-
-    d) If a facility in the modified Library refers to a function or a
-    table of data to be supplied by an application program that uses
-    the facility, other than as an argument passed when the facility
-    is invoked, then you must make a good faith effort to ensure that,
-    in the event an application does not supply such function or
-    table, the facility still operates, and performs whatever part of
-    its purpose remains meaningful.
-
-    (For example, a function in a library to compute square roots has
-    a purpose that is entirely well-defined independent of the
-    application.  Therefore, Subsection 2d requires that any
-    application-supplied function or table used by this function must
-    be optional: if the application does not supply it, the square
-    root function must still compute square roots.)
-
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Library,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Library, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote
-it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Library.
-
-In addition, mere aggregation of another work not based on the Library
-with the Library (or with a work based on the Library) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
-  3. You may opt to apply the terms of the ordinary GNU General Public
-License instead of this License to a given copy of the Library.  To do
-this, you must alter all the notices that refer to this License, so
-that they refer to the ordinary GNU General Public License, version 2,
-instead of to this License.  (If a newer version than version 2 of the
-ordinary GNU General Public License has appeared, then you can specify
-that version instead if you wish.)  Do not make any other change in
-these notices.
-
-  Once this change is made in a given copy, it is irreversible for
-that copy, so the ordinary GNU General Public License applies to all
-subsequent copies and derivative works made from that copy.
-
-  This option is useful when you wish to copy part of the code of
-the Library into a program that is not a library.
-
-  4. You may copy and distribute the Library (or a portion or
-derivative of it, under Section 2) in object code or executable form
-under the terms of Sections 1 and 2 above provided that you accompany
-it with the complete corresponding machine-readable source code, which
-must be distributed under the terms of Sections 1 and 2 above on a
-medium customarily used for software interchange.
-
-  If distribution of object code is made by offering access to copy
-from a designated place, then offering equivalent access to copy the
-source code from the same place satisfies the requirement to
-distribute the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
-  5. A program that contains no derivative of any portion of the
-Library, but is designed to work with the Library by being compiled or
-linked with it, is called a "work that uses the Library".  Such a
-work, in isolation, is not a derivative work of the Library, and
-therefore falls outside the scope of this License.
-
-  However, linking a "work that uses the Library" with the Library
-creates an executable that is a derivative of the Library (because it
-contains portions of the Library), rather than a "work that uses the
-library".  The executable is therefore covered by this License.
-Section 6 states terms for distribution of such executables.
-
-  When a "work that uses the Library" uses material from a header file
-that is part of the Library, the object code for the work may be a
-derivative work of the Library even though the source code is not.
-Whether this is true is especially significant if the work can be
-linked without the Library, or if the work is itself a library.  The
-threshold for this to be true is not precisely defined by law.
-
-  If such an object file uses only numerical parameters, data
-structure layouts and accessors, and small macros and small inline
-functions (ten lines or less in length), then the use of the object
-file is unrestricted, regardless of whether it is legally a derivative
-work.  (Executables containing this object code plus portions of the
-Library will still fall under Section 6.)
-
-  Otherwise, if the work is a derivative of the Library, you may
-distribute the object code for the work under the terms of Section 6.
-Any executables containing that work also fall under Section 6,
-whether or not they are linked directly with the Library itself.
-
-  6. As an exception to the Sections above, you may also combine or
-link a "work that uses the Library" with the Library to produce a
-work containing portions of the Library, and distribute that work
-under terms of your choice, provided that the terms permit
-modification of the work for the customer's own use and reverse
-engineering for debugging such modifications.
-
-  You must give prominent notice with each copy of the work that the
-Library is used in it and that the Library and its use are covered by
-this License.  You must supply a copy of this License.  If the work
-during execution displays copyright notices, you must include the
-copyright notice for the Library among them, as well as a reference
-directing the user to the copy of this License.  Also, you must do one
-of these things:
-
-    a) Accompany the work with the complete corresponding
-    machine-readable source code for the Library including whatever
-    changes were used in the work (which must be distributed under
-    Sections 1 and 2 above); and, if the work is an executable linked
-    with the Library, with the complete machine-readable "work that
-    uses the Library", as object code and/or source code, so that the
-    user can modify the Library and then relink to produce a modified
-    executable containing the modified Library.  (It is understood
-    that the user who changes the contents of definitions files in the
-    Library will not necessarily be able to recompile the application
-    to use the modified definitions.)
-
-    b) Use a suitable shared library mechanism for linking with the
-    Library.  A suitable mechanism is one that (1) uses at run time a
-    copy of the library already present on the user's computer system,
-    rather than copying library functions into the executable, and (2)
-    will operate properly with a modified version of the library, if
-    the user installs one, as long as the modified version is
-    interface-compatible with the version that the work was made with.
-
-    c) Accompany the work with a written offer, valid for at
-    least three years, to give the same user the materials
-    specified in Subsection 6a, above, for a charge no more
-    than the cost of performing this distribution.
-
-    d) If distribution of the work is made by offering access to copy
-    from a designated place, offer equivalent access to copy the above
-    specified materials from the same place.
-
-    e) Verify that the user has already received a copy of these
-    materials or that you have already sent this user a copy.
-
-  For an executable, the required form of the "work that uses the
-Library" must include any data and utility programs needed for
-reproducing the executable from it.  However, as a special exception,
-the materials to be distributed need not include anything that is
-normally distributed (in either source or binary form) with the major
-components (compiler, kernel, and so on) of the operating system on
-which the executable runs, unless that component itself accompanies
-the executable.
-
-  It may happen that this requirement contradicts the license
-restrictions of other proprietary libraries that do not normally
-accompany the operating system.  Such a contradiction means you cannot
-use both them and the Library together in an executable that you
-distribute.
-
-  7. You may place library facilities that are a work based on the
-Library side-by-side in a single library together with other library
-facilities not covered by this License, and distribute such a combined
-library, provided that the separate distribution of the work based on
-the Library and of the other library facilities is otherwise
-permitted, and provided that you do these two things:
-
-    a) Accompany the combined library with a copy of the same work
-    based on the Library, uncombined with any other library
-    facilities.  This must be distributed under the terms of the
-    Sections above.
-
-    b) Give prominent notice with the combined library of the fact
-    that part of it is a work based on the Library, and explaining
-    where to find the accompanying uncombined form of the same work.
-
-  8. You may not copy, modify, sublicense, link with, or distribute
-the Library except as expressly provided under this License.  Any
-attempt otherwise to copy, modify, sublicense, link with, or
-distribute the Library is void, and will automatically terminate your
-rights under this License.  However, parties who have received copies,
-or rights, from you under this License will not have their licenses
-terminated so long as such parties remain in full compliance.
-
-  9. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Library or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Library (or any work based on the
-Library), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Library or works based on it.
-
-  10. Each time you redistribute the Library (or any work based on the
-Library), the recipient automatically receives a license from the
-original licensor to copy, distribute, link with or modify the Library
-subject to these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties with
-this License.
-
-  11. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Library at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Library by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Library.
-
-If any portion of this section is held invalid or unenforceable under any
-particular circumstance, the balance of the section is intended to apply,
-and the section as a whole is intended to apply in other circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
-  12. If the distribution and/or use of the Library is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Library under this License may add
-an explicit geographical distribution limitation excluding those countries,
-so that distribution is permitted only in or among countries not thus
-excluded.  In such case, this License incorporates the limitation as if
-written in the body of this License.
-
-  13. The Free Software Foundation may publish revised and/or new
-versions of the Lesser General Public License from time to time.
-Such new versions will be similar in spirit to the present version,
-but may differ in detail to address new problems or concerns.
-
-Each version is given a distinguishing version number.  If the Library
-specifies a version number of this License which applies to it and
-"any later version", you have the option of following the terms and
-conditions either of that version or of any later version published by
-the Free Software Foundation.  If the Library does not specify a
-license version number, you may choose any version ever published by
-the Free Software Foundation.
-
-  14. If you wish to incorporate parts of the Library into other free
-programs whose distribution conditions are incompatible with these,
-write to the author to ask for permission.  For software which is
-copyrighted by the Free Software Foundation, write to the Free
-Software Foundation; we sometimes make exceptions for this.  Our
-decision will be guided by the two goals of preserving the free status
-of all derivatives of our free software and of promoting the sharing
-and reuse of software generally.
-
-			    NO WARRANTY
-
-  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
-WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
-EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
-OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
-KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
-LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
-THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
-  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
-WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
-AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
-FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
-CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
-LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
-RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
-FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
-SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
-DAMAGES.
-
-		     END OF TERMS AND CONDITIONS
-
-           How to Apply These Terms to Your New Libraries
-
-  If you develop a new library, and you want it to be of the greatest
-possible use to the public, we recommend making it free software that
-everyone can redistribute and change.  You can do so by permitting
-redistribution under these terms (or, alternatively, under the terms of the
-ordinary General Public License).
-
-  To apply these terms, attach the following notices to the library.  It is
-safest to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least the
-"copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the library's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    This library is free software; you can redistribute it and/or
-    modify it under the terms of the GNU Lesser General Public
-    License as published by the Free Software Foundation; either
-    version 2.1 of the License, or (at your option) any later version.
-
-    This library is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-    Lesser General Public License for more details.
-
-    You should have received a copy of the GNU Lesser General Public
-    License along with this library; if not, write to the Free Software
-    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-
-Also add information on how to contact you by electronic and paper mail.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the library, if
-necessary.  Here is a sample; alter the names:
-
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the
-  library `Frob' (a library for tweaking knobs) written by James Random Hacker.
-
-  <signature of Ty Coon>, 1 April 1990
-  Ty Coon, President of Vice
-
-That's all there is to it!
-
-
diff --git a/lib/priority_queue.rb b/lib/priority_queue.rb
index 0d77512d5061c6ec4b620d23a0e9fd266cc6bd1f..a8d023952c511f82ad6a4a6e20ea201db8427893 100644
--- a/lib/priority_queue.rb
+++ b/lib/priority_queue.rb
@@ -4,6 +4,7 @@ class PriorityQueue
     clear
   end
 
+  # Push +element+ onto the priority queue.
   def <<(element)
     @elements << element
     # bubble up the element that we just added
@@ -12,11 +13,13 @@ class PriorityQueue
 
   alias push <<
 
+  # Inspect the element at the head of the queue.
   def peek
     # the first element will always be the min, because of the heap constraint
     @elements[1]
   end
 
+  # Remove and return the next element from the queue, determined by priority.
   def pop
     # remove the last element of the list
     min = @elements[1]
@@ -26,10 +29,12 @@ class PriorityQueue
     min
   end
 
+  # Reset the priority queue to empty.
   def clear
     @elements = [nil]
   end
 
+  # Return a boolean indicating whether the queue is empty or not
   def empty?
     @elements.length < 2
   end
diff --git a/lib/simplekit.rb b/lib/simplekit.rb
index 5ebfcfa603324d91892c7fa45acc8e5a5096ef38..e4ef4d23b16186275efefbcd3ae3334e0462400c 100644
--- a/lib/simplekit.rb
+++ b/lib/simplekit.rb
@@ -1,15 +1,18 @@
+require 'set'
 require_relative 'priority_queue'
 
 # The +SimpleKit+ module provides basic event scheduling capabilities.
 #
 # Including +SimpleKit+ in your simulation model gives you methods +:run+,
-# +:model_time+, +:schedule+, and +:halt+ as mixins.  You <b>MUST NOT</b>
-# provide your own implementations of methods with these names in your model.
-# All but +:run+ are delegated to the +EventScheduler+ class.
+# +:model_time+, +:schedule+, +:cancel+, +:cancel_all+, and +:halt+ as mixins.
+# <b>DO NOT</b> create your own implementations of methods with these names
+# in your model. All but +:run+ are delegated to the +EventScheduler+ class.
 module SimpleKit
   # The set of module methods to be passed to the EventScheduler
   # if not found in the model class.
-  DELEGATED_METHODS = [:model_time, :schedule, :halt].freeze
+  DELEGATED_METHODS = %i[
+    model_time schedule cancel cancel_all halt
+  ].freeze
 
   # Run your model by creating a new +EventScheduler+ and invoking its
   # +run+ method.
@@ -21,11 +24,7 @@ module SimpleKit
   # If a method doesn't exist in the model class, try to delegate it
   # to +EventScheduler+.
   def method_missing(name, *args)
-    if DELEGATED_METHODS.include?(name)
-      @my_sim.send(name, *args)
-    else
-      super
-    end
+    DELEGATED_METHODS.include?(name) ? @my_sim.send(name, *args) : super
   end
 
   # Class +EventScheduler+ provides the computation engine for a
@@ -43,6 +42,7 @@ module SimpleKit
     def initialize(the_model)
       @user_model = the_model
       @event_list = PriorityQueue.new
+      @cancel_set = {}
     end
 
     # Add an event to the pending events list.
@@ -51,24 +51,53 @@ module SimpleKit
     #   - +event+ -> the event to be scheduled.
     #   - +delay+ -> the amount of time which should elapse before
     #     the event executes.
-    #   - +args+ -> an optional list of arguments to pass to the event
-    #     at invocation time.
-    def schedule(event, delay, *args)
+    #   - +args+ -> zero or more named arguments to pass to the event
+    #     at invocation time. These should be specified with labels, and
+    #     consequently they can be placed in any order.
+    def schedule(event, delay, **args)
       raise 'Model scheduled event with negative delay.' if delay < 0
-      @event_list.push EventNotice.new(event, @model_time + delay, args)
+      @event_list.push EventNotice.new(event, @model_time, delay, args)
+    end
+
+    # Cancel an individual occurrence of event type +event+.
+    # If no +args+ are provided, the next scheduled occurrence of +event+
+    # is targeted.  If a subset of the event's +args+ is provided, they must
+    # all be a match with the corresponding +args+ of the scheduled event
+    # in order for the cancellation to apply, but +args+ which are not
+    # specified do not affect the target event matching.
+    def cancel(event, **args)
+      @cancel_set[event] ||= Set.new
+      @cancel_set[event].add(args.empty? ? nil : args)
+    end
+
+    # Cancel all currently scheduled events of type +event+.
+    def cancel_all(event)
+      if event
+        PriorityQueue.new.tap do |pq|
+          while (event_notice = @event_list.pop)
+            pq.push event_notice unless event_notice.event == event
+          end
+          @event_list = pq
+        end
+      end
     end
 
     # Start execution of a model. The simulation +model_time+ is initialized
     # to zero and the model is initialized via the mandatory +init+ method.
-    # Then loop while events are pending on the +event_list+. The event with
-    # the smallest time is popped, +model_time+ is updated to the event time,
-    # and the event method is invoked.
+    # Then loop while events are pending on the +event_list+. The event with the
+    # smallest time is popped, +model_time+ is updated to the event time, and
+    # the event method is invoked with the +args+, if any, set by +schedule+.
     def run
       @model_time = 0.0
       @user_model.init
       while (current_event = @event_list.pop)
+        next if should_cancel?(current_event)
         @model_time = current_event.time
-        @user_model.send(current_event.event, *current_event.args)
+        if current_event.args.empty?
+          @user_model.send(current_event.event)
+        else
+          @user_model.send(current_event.event, current_event.args)
+        end
       end
     end
 
@@ -77,14 +106,51 @@ module SimpleKit
     def halt
       @event_list.clear
     end
-  end
 
-  # This is a private helper Struct for the EventScheduler class.
-  # Users should never try to access this directly.
-  EventNotice = Struct.new(:event, :time, *:args) do
-    include Comparable
-    def <=>(other)
-      time <=> other.time
+    private
+
+    # Private method that returns a boolean to determine if +event_notice+
+    # represents an event subject to cancellation.
+    def should_cancel?(event_notice)
+      e = event_notice.event
+      if @cancel_set.key? e
+        if @cancel_set[e].include? nil
+          @cancel_set[e].delete nil
+          @cancel_set.delete e if @cancel_set[e].empty?
+          return true
+        else
+          for hsh in @cancel_set[e] do
+            next unless event_notice.args >= hsh
+            @cancel_set[e].delete hsh
+            @cancel_set.delete e if @cancel_set[e].empty?
+            return true
+          end
+        end
+      end
+      false
+    end
+
+    # This is a private helper class for the EventScheduler class.
+    # Users should never try to access this directly.
+    class EventNotice
+      attr_reader :event, :time, :time_stamp, :priority, :args
+
+      def initialize(event, time, delay, args)
+        @event = event
+        @time_stamp = time
+        @time = time + delay
+        @args = args
+        @priority = @args && @args.key?(:priority) ? @args.delete(:priority) : 10
+      end
+
+      include Comparable
+      # Compare EventNotice objects for ordering, first by time,
+      # breaking ties using priority.
+      def <=>(other)
+        (time <=> other.time).tap do |outcome|
+          return priority <=> other.priority if outcome == 0
+        end
+      end
     end
   end
 end
diff --git a/simplekit.gemspec b/simplekit.gemspec
index a9516f9d93ba1bf57f17bceebcf08678d773fd31..b55126520421c292ebc4f89399d5b0d5b61463ea 100644
--- a/simplekit.gemspec
+++ b/simplekit.gemspec
@@ -1,10 +1,10 @@
 # -*- ruby -*-
-_VERSION = "0.4.5"
+_VERSION = "1.0.0"
 
 Gem::Specification.new do |s|
   s.name = "simplekit"
   s.version = _VERSION
-  s.date = "2017-12-01"
+  s.date = "2018-07-12"
   s.summary = "Discrete event simulation engine."
   s.homepage = "https://gitlab.nps.edu/pjsanche/simplekit-ruby.git"
   s.email = "pjs@alum.mit.edu"
@@ -14,7 +14,12 @@ Gem::Specification.new do |s|
     simplekit.gemspec
     lib/simplekit.rb
     lib/priority_queue.rb
+    demos/MMk.rb
+    demos/MMk_reference_output.txt
+    demos/MMk_shutdown.rb
+    demos/CancelQ.rb
+    demos/sptf.rb
   ]
-  s.required_ruby_version = '>= 1.8.1'
+  s.required_ruby_version = '>= 2.3.0'
   s.license = 'MIT'
 end