Release prepared.

.travis.yml

@@ -1,8 +1,14 @@
+install:
+  - wget https://s3.amazonaws.com/rebar3/rebar3 && chmod +x rebar3
 language: erlang
+script: ./rebar3 eunit
 otp_release:
+  - 19.2
+  - 19.1
   - 19.0
   - 18.3
   - 18.2.1
   - 18.2
   - 18.1
   - 18.0
+

README.md

@@ -2,9 +2,9 @@
 
 **[gen_pnet documentation](http://cuneiform-lang.org/man/gen_pnet/)**
 
-Some applications exhibit behavioral patterns that lend themselves to Petri Nets. The major advantage of modeling applications with Petri Nets is that they provide a natural view on the concurrent behavior of an application. This is achieved by making explicit the preconditions for an operation to be carried out while leaving implicit how and when an operation is triggered and what other operations might run in parallel.
+Some applications exhibit behavioral patterns that lend themselves to Petri nets. The major advantage of modeling applications with Petri nets is that they provide a natural view on the concurrent behavior of an application. This is achieved by making explicit the preconditions for an operation to be carried out while leaving implicit how and when an operation is triggered and what other operations might run in parallel.
 
-This OTP library is a framework for programming with Petri Nets. It implements a very general form of Petri Nets: Colored Petri Nets (CPN). I.e., tokens may not only be markers but can be any conceivable data structure. Furthermore, a place can hold any number of tokens not just one.
+This OTP library is a framework for programming with Petri nets. It implements a very general form of Petri nets using Erlang terms as tokens. I.e., tokens are not only markers but can be any conceivable data structure. Furthermore, a place can hold any number of tokens not just one.
 
-While many simulation libraries only mimic the concurrent behavior of Petri Nets, the `gen_pnet' library allows the definition of Nets with an arbitrary number of transitions competing for a place's tokens neither imposing order in the form of an orverarching loop nor otherwise constraining parallelism.
+While many simulation libraries only mimic the concurrent behavior of Petri nets, the `gen_pnet' library allows the definition of nets with an arbitrary number of transitions competing for a place's tokens neither imposing order in the form of an orverarching loop nor otherwise constraining parallelism.
 

doc/overview.edoc

@@ -7,11 +7,13 @@
 @reference <a href="https://github.com/joergen7/gen_pnet">Source code</a> hosted at GitHub.
 @doc
 
-Some applications exhibit behavioral patterns that lend themselves to Petri Nets. The major advantage of modeling applications with Petri Nets is that they provide a natural view on the concurrent behavior of an application. This is achieved by making explicit the preconditions for an operation to be carried out while leaving implicit how and when an operation is triggered and what other operations might run in parallel.
+Some applications exhibit behavioral patterns that lend themselves to Petri nets. The major advantage of modeling applications with Petri nets is that they provide a natural view on the concurrent behavior of an application. This is achieved by making explicit the preconditions for an operation to be carried out while leaving implicit how and when an operation is triggered and what other operations might run in parallel.
+
+This OTP library is a framework for programming with Petri nets. It implements a very general form of Petri nets using Erlang terms as tokens. I.e., tokens are not only markers but can be any conceivable data structure. Furthermore, a place can hold any number of tokens not just one.
+
+While many simulation libraries only mimic the concurrent behavior of Petri nets, the `gen_pnet' library allows the definition of nets with an arbitrary number of transitions competing for a place's tokens neither imposing order in the form of an orverarching loop nor otherwise constraining parallelism.
 
-This OTP library is a framework for programming with Petri Nets. It implements a very general form of Petri Nets: Colored Petri Nets (CPN). I.e., tokens may not only be markers but can be any conceivable data structure. Furthermore, a place can hold any number of tokens not just one.
 
-While many simulation libraries only mimic the concurrent behavior of Petri Nets, the `gen_pnet' library allows the definition of Nets with an arbitrary number of transitions competing for a place's tokens neither imposing order in the form of an orverarching loop nor otherwise constraining parallelism.
 
 <h2>Quick Start</h2>
 

src/gen_pnet.app.src

@@ -0,0 +1,15 @@
+{application, gen_pnet,
+ [{description, "An OTP behavior for implementing Petri nets."},
+  {vsn, "0.1.0-release"},
+  {registered, []},
+  {applications,
+   [kernel,
+    stdlib
+   ]},
+  {env,[]},
+  {modules, [gen_pnet]},
+
+  {maintainers, ["Jorgen Brandt <brandjoe@hu-berlin.de>"]},
+  {licenses, []},
+  {links, []}
+ ]}.

src/gen_pnet.erl

@@ -1,7 +1,7 @@
 %% -*- erlang -*-
 %%
 %%
-%% A generic Petri net OTP library
+%% An OTP behavior for implementing Petri nets.
 %%
 %% Licensed under the Apache License, Version 2.0 (the "License");
 %% you may not use this file except in compliance with the License.