openprocess 0.8.0__tar.gz → 0.10.5__tar.gz

{openprocess-0.8.0/openprocess.egg-info → openprocess-0.10.5}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: openprocess
-Version: 0.8.0
+Version: 0.10.5
 Summary: Process mining, Petri nets and workflows in one open app: every algorithm visible, every result reproducible, every step teachable
 Author: Sam Struthers
 License: MIT
@@ -68,7 +68,7 @@ tools (and, until version 0.7, went by the name CPNpy):
 | | What you can do | Instead of |
 |---|---|---|
 | **Petri nets & WF-nets** | Draw nets the way the lectures do. Get a soundness verdict with a counterexample for every violation, and replay it in the token game. Also: behavioural properties, P- and T-invariants, the footprint matrix, the reachability graph, PNML import and export. | WoPeD, ProM, pen and paper |
-| **Process mining** | Import XES or CSV logs, or type textbook logs like `[<a,b,c>^3, <a,c>^2]`. Filter them, explore variants, the dotted chart and the process map. Discover models (α-algorithm, Inductive Miner, Heuristics Miner, state-based regions). Check conformance (token replay, alignments, precision…) and compare logs. | ProM, Disco |
+| **Process mining** | Import XES or CSV logs, OCEL 2.0 object-centric logs, or type textbook logs like `[<a,b,c>^3, <a,c>^2]`. Filter them, explore variants, the dotted chart and the process map. Discover models (α-algorithm, Inductive Miner, Heuristics Miner, state-based regions). Check conformance (token replay, alignments, precision…) and compare logs. | ProM, Disco |
 | **Coloured Petri nets** | Open, edit and save CPN Tools models (`.cpn`), hierarchical ones included. Step through or simulate them, compute the state space, and export a simulation as an event log to mine. | CPN Tools / CPN IDE |
 | **Workflows** | Boxes on a canvas: a log, a miner, a fitness check, a comparison, a sweep over a setting, a prediction pipeline. Click a box to see its result, *how* it got there (the α-algorithm's eight steps, the replay per variant), its code and its settings. Change a setting and only what follows runs again. Saved as a `.cpnflow` file with everything needed to get the same numbers back. Your own algorithm is one Python function in a `boxes/` folder. | RapidProM |
 | **Learn** | A mode of its own for worksheets, built on the app: answer in boxes on the sheet (sets, markings, matrices, cuts and trees, alignments, a net in the editor or a workflow on the canvas beside it) and press **Check**. Most answers are checked automatically, often against answers worked out from the given log or net. Packs are plain Markdown, can be exams with a clock and points, and a past exam imports as a skeleton pack. Demo exercises included. | Answer sheets, a notes app and guesswork |
@@ -244,11 +244,11 @@ handling (unsound — try Analysis)**.
 2. Look through the tabs: *Overview*, *Variants*, *Cases*, *Dotted chart*,
    *Process map*, *Footprint*. **Filter…** keeps part of the log as a new
    log.
-3. On the *Discover* tab, pick an algorithm: the model and how it was
-   derived update straight away. **Open as model →** adds the result to the sidebar (under **MODELS**, or
-   **UNSAVED** in a folder until you press **Keep** to save it there).
-4. On the model's *Conformance* tab, choose a log and press **Check
-   conformance**.
+3. On the *Discover* tab, pick an algorithm and press **Discover in Mine →**:
+   an analysis opens with the log and the miner connected and run. Click the
+   miner for its result, *How* it was derived, and the *Code* it ran.
+4. **+ Add box ▸ Check fit** on that canvas, wired to the miner and the
+   log, scores fitness, precision and more, every step shown.
 
 **Simulate a coloured net**
 
@@ -267,15 +267,22 @@ round.
 
 ![The folder Week 2 in the sidebar, with its subfolders, one net open and the others listed](docs/screenshots/workspace.png)
 
+**Three spaces, one folder.** The switcher at the top of the window picks
+**Mine** (event logs and analyses), **Model** (Petri nets and coloured nets)
+or **Learn** (exercises). Each has its own sidebar, so mining and modelling
+never share a list; a document opens in its space, and the folder remembers
+which space you were in.
+
 **In the sidebar**
 
-- **Every event log and net in the folder** is listed, open or not. Files
-  that are not open yet are lighter: **click one to open it**. Closing a file
-  (✕ or ⌘W) puts it back in that state; it stays in the folder.
-- **Folders** shows the folder as it is on disk, with collapsible subfolders
-  (folders first, then files, by name). **By kind** groups the files into
-  event logs, Petri nets and coloured nets instead. The choice, and which
-  subfolders are open, is remembered for each folder.
+- **Mine lists the folder's analyses**, and its logs folded under them.
+  **Model lists its models.** Files that are not open yet are lighter:
+  **click one to open it**. Closing a file (✕ or ⌘W) puts it back in that
+  state; it stays in the folder.
+- **Flat lists, the same in both spaces.** The folder's own files first,
+  then each subfolder's under a caption naming it ("Week 5 / Part 1").
+  Nothing to unfold except LOGS. An empty folder shows in both spaces until
+  it has files.
 - **Organise from the app**: right-click for **New Folder…**, **Rename…**,
   **Show in Finder** and **Move to Bin** (recoverable from the Bin; never a
   hard delete). **Drag files onto a subfolder** to move them on disk. An open
@@ -416,8 +423,10 @@ links to the definitions it builds on; **Help ▸ Definitions** lists them all.
   a log's footprint (α-algorithm, footprint conformance).
 - **Reachability graph…**, or a coverability graph with ω when the net is
   unbounded.
-- **Conformance with a log…** opens the net as a model next to your logs,
-  for token replay and alignments.
+- **Check against a log ›** (Analysis tab) builds an analysis in Mine with
+  this net, a log you pick and *Check fit*, connected and run.
+- Every analysis card has a **{ } code** link that opens the function it is
+  computed by, so nothing here is a black box.
 
 | The counterexample, replayed | The footprint of the net |
 |---|---|
@@ -428,8 +437,10 @@ links to the definitions it builds on; **Help ▸ Definitions** lists them all.
 - **Step through / Simulate:** the token game, fired by hand or at random.
   With **Trace** ticked, every fired transition shows its step numbers and
   the arcs the tokens used light up, the latest step strongest.
-- **Generate event log…:** plays the net out many times and opens the
-  traces as a log.
+- **Mine a simulated log ›:** plays the net out many times, saves the traces
+  as a log in the folder and opens Mine on a new analysis reading it.
+- **Check against a log ›** (Analysis tab): picks a log and opens Mine on a
+  new analysis with this net, the log and *Check fit*, connected and run.
 - **Saving:** nets are saved as **PNML** (ProM, WoPeD and PM4Py read it), or
   as `.cpn`. *Save As* names the net after its file. With a folder open, a
   new net is `Untitled 1.pnml` in the folder from the start and is saved as
@@ -438,8 +449,9 @@ links to the definitions it builds on; **Help ▸ Definitions** lists them all.
 - **Renaming:** double-click the net's name in the sidebar, or its title
   above the canvas. The file is renamed with it, in the same folder (an
   existing file is never overwritten).
-- **Opening:** a `.pnml` file opens in this editor. A model you discovered
-  has **✎ Edit a copy** to bring it here.
+- **Opening:** a `.pnml` file opens in this editor. A net discovered in Mine
+  has **Open a copy in Model ›** to bring a copy here; the original result is
+  never changed, and the copy's header links back to the analysis.
 
 ![Renaming a transition in place](docs/screenshots/petri-editing.png)
 
@@ -475,21 +487,24 @@ links to the definitions it builds on; **Help ▸ Definitions** lists them all.
   - Time unit (Auto, or seconds up to years) and a grid step you can type in.
   - Colour and shape by any attribute. The default palette can be changed
     per value: right-click a value in the legend and pick its colour.
-- **Discover:**
+- **Discover** hands the log to an analysis in Mine (**Discover in Mine →**),
+  where the miner is a box with its result, its *How* and its *Code*:
   - α-algorithm, which shows its eight steps;
-  - Inductive Miner and IMf;
-  - Heuristics Miner, as a dependency graph or as a Petri net: which forks
-    are AND and which XOR is learned from the log (a causal net, whose
-    bindings are listed). Like in ProM, such a net fits its log but is not
-    always sound;
-  - **state-based regions**, two-phase: the log becomes a transition system
-    through a state function you choose (the prefix, postfix or both of each
-    event; as a set, multiset or sequence; over the last *k* events or all
-    of them), and its minimal regions become the places. The derivation
-    shows the transition system (pick a trace to light up the states it
-    passes through), the regions, GER and minimal pre- and post-regions of
-    every event, state separation and forward closure, and whether the
-    net's reachability graph is isomorphic to the transition system.
+  - Inductive Miner (with a noise setting for IMf);
+  - Heuristics Miner, as a Petri net: which forks are AND and which XOR is
+    learned from the log (a causal net, whose bindings are listed). Like in
+    ProM, such a net fits its log but is not always sound;
+  - **state-based regions**, two-phase: *Classical states* turns the log
+    into a transition system through a state function you choose (the
+    prefix, postfix or both of each event; as a set, multiset or sequence;
+    over the last *k* events or all of them), and *Regions to net* makes its
+    minimal regions the places. The derivation shows the transition system,
+    the regions, GER and minimal pre- and post-regions of every event, state
+    separation and forward closure, and whether the net's reachability graph
+    is isomorphic to the transition system.
+
+  In Learn, an exercise's log page keeps the miners on the page, since the
+  exercise is the context there.
 - **Transition systems** (File ▸ New Transition System…, or a `ts.txt` file):
   type one as `s0 -a-> s1, s0 -b-> s2` and get the same region analysis and
   synthesis. *Is this a region?* answers yes or no for any set of states
@@ -754,20 +769,41 @@ Miner, a fitness check), *Compare discovery* (three miners side by side),
 confidence* (bootstrap intervals, a test and a plot; needs the `science`
 extra) and *Predict the next activity*. Or start empty.
 
-- **The page is the canvas.** Three buttons in its header: **+ Add box**,
-  **Run ▶**, and **⋯** for Re-run, Record, Export experiment and Save.
+- **The page is the canvas.** Its header has **Canvas | Summary**, then
+  **+ Add box**, **Run ▶**, and **⋯** for Re-run, Record, Export experiment
+  and Save. The sidebar beside it lists the folder's analyses and, folded
+  under them, its logs.
 - **+ Add box** (or a double-click on the canvas) opens every box, by group:
   the six core groups side by side (Input, Filter, Discover, Check, Compare,
   Output) and one line for the rest (Science, Predict, Coloured nets, Sweep,
-  your own boxes) with *Show all*. Type to search them all: "alpha" finds the
-  α-algorithm; Enter adds the first match.
+  your own boxes) with *Show all*. Under *Input*, **the folder's own files**:
+  one click adds the box that reads the file, already set. Type to search
+  them all: "alpha" finds the α-algorithm, "boarding" the log; Enter adds the
+  first match.
+- **Files flow into the canvas.** Drop a log, an OCEL 2.0 object-centric log
+  (`.jsonocel`), a PNML file, a .cpn or a ts.txt on the canvas and it becomes
+  its input box at that spot; an input
+  box names its file ("INPUT · boarding.xes"). *Open log…* and *Log from
+  notation…* in the sidebar land as boxes on the current analysis (or a new
+  one named after the file). In a box's **Settings**, *Choose…* picks the
+  file and the list beside it offers only the files the box can read.
+- **Summary** is the key figure of every box, in one place: a tile per box,
+  in the order the boxes run (a score's first metric, a table's size, a
+  log's cases, a net's places and transitions). Nothing is computed there:
+  a tile is the box's result, as on the canvas, and a tile opens the box.
+  The process map under the tiles is the *Directly-follows graph* box's
+  result; an analysis without that box offers to add it in one click.
 - **Connect** by dragging from the dot on the right of a box: while you drag,
   only the inputs that take that kind of result light up, so a wrong
   connection cannot be made. Click a wire and press Delete to remove it.
 - **Click a box** and the side panel appears beside the canvas, on
   **Result** (the net, the log's figures, the table, the figure; a log's
   Result has *Open as log ›* for the dotted chart, process map, footprint,
-  variants and cases). Its other tabs: **How** (what the box reported: notes,
+  variants and cases, and a net's has *Open a copy in Model ›*). A page
+  opened this way shows "‹ Back to <analysis>" above its title. A
+  discovered net can be tidied on the Result tab by dragging its places and
+  transitions (the layout is saved with the workflow); the net itself is not
+  changed there. Its other tabs: **How** (what the box reported: notes,
   intermediate values, the derivation), **Code** (the box's few lines and,
   under them, the actual algorithm it calls: the α-algorithm's eight steps,
   the Inductive Miner's cuts, with the work each follows and *Whole file* for
@@ -793,6 +829,14 @@ extra) and *Predict the next activity*. Or start empty.
   material for a paper, which `openprocess run --check` can verify.
 - **The side panel** resizes by dragging the gap beside it; double-click the
   gap, or *View ▸ Reset Workflow Layout*, for its default width.
+- **Connections** (at the bottom of the sidebar, or *View ▸ Connections*)
+  draws what flows in, OpenProcess and its boxes, what flows out, and the
+  optional tools (pandas, numpy, scipy, matplotlib, …) with whether each is
+  installed, how to install it and the boxes it brings. All of it is read
+  from the box library.
+- **Motion** is kept short: a space switch, the side panel and Canvas ↔
+  Summary settle in a fifth of a second, and a box pulses once when it
+  finishes. `OPENPROCESS_NO_MOTION=1` turns it off.
 
 ## Workflows from Python
 

{openprocess-0.8.0 → openprocess-0.10.5}/README.md

@@ -29,7 +29,7 @@ tools (and, until version 0.7, went by the name CPNpy):
 | | What you can do | Instead of |
 |---|---|---|
 | **Petri nets & WF-nets** | Draw nets the way the lectures do. Get a soundness verdict with a counterexample for every violation, and replay it in the token game. Also: behavioural properties, P- and T-invariants, the footprint matrix, the reachability graph, PNML import and export. | WoPeD, ProM, pen and paper |
-| **Process mining** | Import XES or CSV logs, or type textbook logs like `[<a,b,c>^3, <a,c>^2]`. Filter them, explore variants, the dotted chart and the process map. Discover models (α-algorithm, Inductive Miner, Heuristics Miner, state-based regions). Check conformance (token replay, alignments, precision…) and compare logs. | ProM, Disco |
+| **Process mining** | Import XES or CSV logs, OCEL 2.0 object-centric logs, or type textbook logs like `[<a,b,c>^3, <a,c>^2]`. Filter them, explore variants, the dotted chart and the process map. Discover models (α-algorithm, Inductive Miner, Heuristics Miner, state-based regions). Check conformance (token replay, alignments, precision…) and compare logs. | ProM, Disco |
 | **Coloured Petri nets** | Open, edit and save CPN Tools models (`.cpn`), hierarchical ones included. Step through or simulate them, compute the state space, and export a simulation as an event log to mine. | CPN Tools / CPN IDE |
 | **Workflows** | Boxes on a canvas: a log, a miner, a fitness check, a comparison, a sweep over a setting, a prediction pipeline. Click a box to see its result, *how* it got there (the α-algorithm's eight steps, the replay per variant), its code and its settings. Change a setting and only what follows runs again. Saved as a `.cpnflow` file with everything needed to get the same numbers back. Your own algorithm is one Python function in a `boxes/` folder. | RapidProM |
 | **Learn** | A mode of its own for worksheets, built on the app: answer in boxes on the sheet (sets, markings, matrices, cuts and trees, alignments, a net in the editor or a workflow on the canvas beside it) and press **Check**. Most answers are checked automatically, often against answers worked out from the given log or net. Packs are plain Markdown, can be exams with a clock and points, and a past exam imports as a skeleton pack. Demo exercises included. | Answer sheets, a notes app and guesswork |
@@ -205,11 +205,11 @@ handling (unsound — try Analysis)**.
 2. Look through the tabs: *Overview*, *Variants*, *Cases*, *Dotted chart*,
    *Process map*, *Footprint*. **Filter…** keeps part of the log as a new
    log.
-3. On the *Discover* tab, pick an algorithm: the model and how it was
-   derived update straight away. **Open as model →** adds the result to the sidebar (under **MODELS**, or
-   **UNSAVED** in a folder until you press **Keep** to save it there).
-4. On the model's *Conformance* tab, choose a log and press **Check
-   conformance**.
+3. On the *Discover* tab, pick an algorithm and press **Discover in Mine →**:
+   an analysis opens with the log and the miner connected and run. Click the
+   miner for its result, *How* it was derived, and the *Code* it ran.
+4. **+ Add box ▸ Check fit** on that canvas, wired to the miner and the
+   log, scores fitness, precision and more, every step shown.
 
 **Simulate a coloured net**
 
@@ -228,15 +228,22 @@ round.
 
 ![The folder Week 2 in the sidebar, with its subfolders, one net open and the others listed](docs/screenshots/workspace.png)
 
+**Three spaces, one folder.** The switcher at the top of the window picks
+**Mine** (event logs and analyses), **Model** (Petri nets and coloured nets)
+or **Learn** (exercises). Each has its own sidebar, so mining and modelling
+never share a list; a document opens in its space, and the folder remembers
+which space you were in.
+
 **In the sidebar**
 
-- **Every event log and net in the folder** is listed, open or not. Files
-  that are not open yet are lighter: **click one to open it**. Closing a file
-  (✕ or ⌘W) puts it back in that state; it stays in the folder.
-- **Folders** shows the folder as it is on disk, with collapsible subfolders
-  (folders first, then files, by name). **By kind** groups the files into
-  event logs, Petri nets and coloured nets instead. The choice, and which
-  subfolders are open, is remembered for each folder.
+- **Mine lists the folder's analyses**, and its logs folded under them.
+  **Model lists its models.** Files that are not open yet are lighter:
+  **click one to open it**. Closing a file (✕ or ⌘W) puts it back in that
+  state; it stays in the folder.
+- **Flat lists, the same in both spaces.** The folder's own files first,
+  then each subfolder's under a caption naming it ("Week 5 / Part 1").
+  Nothing to unfold except LOGS. An empty folder shows in both spaces until
+  it has files.
 - **Organise from the app**: right-click for **New Folder…**, **Rename…**,
   **Show in Finder** and **Move to Bin** (recoverable from the Bin; never a
   hard delete). **Drag files onto a subfolder** to move them on disk. An open
@@ -377,8 +384,10 @@ links to the definitions it builds on; **Help ▸ Definitions** lists them all.
   a log's footprint (α-algorithm, footprint conformance).
 - **Reachability graph…**, or a coverability graph with ω when the net is
   unbounded.
-- **Conformance with a log…** opens the net as a model next to your logs,
-  for token replay and alignments.
+- **Check against a log ›** (Analysis tab) builds an analysis in Mine with
+  this net, a log you pick and *Check fit*, connected and run.
+- Every analysis card has a **{ } code** link that opens the function it is
+  computed by, so nothing here is a black box.
 
 | The counterexample, replayed | The footprint of the net |
 |---|---|
@@ -389,8 +398,10 @@ links to the definitions it builds on; **Help ▸ Definitions** lists them all.
 - **Step through / Simulate:** the token game, fired by hand or at random.
   With **Trace** ticked, every fired transition shows its step numbers and
   the arcs the tokens used light up, the latest step strongest.
-- **Generate event log…:** plays the net out many times and opens the
-  traces as a log.
+- **Mine a simulated log ›:** plays the net out many times, saves the traces
+  as a log in the folder and opens Mine on a new analysis reading it.
+- **Check against a log ›** (Analysis tab): picks a log and opens Mine on a
+  new analysis with this net, the log and *Check fit*, connected and run.
 - **Saving:** nets are saved as **PNML** (ProM, WoPeD and PM4Py read it), or
   as `.cpn`. *Save As* names the net after its file. With a folder open, a
   new net is `Untitled 1.pnml` in the folder from the start and is saved as
@@ -399,8 +410,9 @@ links to the definitions it builds on; **Help ▸ Definitions** lists them all.
 - **Renaming:** double-click the net's name in the sidebar, or its title
   above the canvas. The file is renamed with it, in the same folder (an
   existing file is never overwritten).
-- **Opening:** a `.pnml` file opens in this editor. A model you discovered
-  has **✎ Edit a copy** to bring it here.
+- **Opening:** a `.pnml` file opens in this editor. A net discovered in Mine
+  has **Open a copy in Model ›** to bring a copy here; the original result is
+  never changed, and the copy's header links back to the analysis.
 
 ![Renaming a transition in place](docs/screenshots/petri-editing.png)
 
@@ -436,21 +448,24 @@ links to the definitions it builds on; **Help ▸ Definitions** lists them all.
   - Time unit (Auto, or seconds up to years) and a grid step you can type in.
   - Colour and shape by any attribute. The default palette can be changed
     per value: right-click a value in the legend and pick its colour.
-- **Discover:**
+- **Discover** hands the log to an analysis in Mine (**Discover in Mine →**),
+  where the miner is a box with its result, its *How* and its *Code*:
   - α-algorithm, which shows its eight steps;
-  - Inductive Miner and IMf;
-  - Heuristics Miner, as a dependency graph or as a Petri net: which forks
-    are AND and which XOR is learned from the log (a causal net, whose
-    bindings are listed). Like in ProM, such a net fits its log but is not
-    always sound;
-  - **state-based regions**, two-phase: the log becomes a transition system
-    through a state function you choose (the prefix, postfix or both of each
-    event; as a set, multiset or sequence; over the last *k* events or all
-    of them), and its minimal regions become the places. The derivation
-    shows the transition system (pick a trace to light up the states it
-    passes through), the regions, GER and minimal pre- and post-regions of
-    every event, state separation and forward closure, and whether the
-    net's reachability graph is isomorphic to the transition system.
+  - Inductive Miner (with a noise setting for IMf);
+  - Heuristics Miner, as a Petri net: which forks are AND and which XOR is
+    learned from the log (a causal net, whose bindings are listed). Like in
+    ProM, such a net fits its log but is not always sound;
+  - **state-based regions**, two-phase: *Classical states* turns the log
+    into a transition system through a state function you choose (the
+    prefix, postfix or both of each event; as a set, multiset or sequence;
+    over the last *k* events or all of them), and *Regions to net* makes its
+    minimal regions the places. The derivation shows the transition system,
+    the regions, GER and minimal pre- and post-regions of every event, state
+    separation and forward closure, and whether the net's reachability graph
+    is isomorphic to the transition system.
+
+  In Learn, an exercise's log page keeps the miners on the page, since the
+  exercise is the context there.
 - **Transition systems** (File ▸ New Transition System…, or a `ts.txt` file):
   type one as `s0 -a-> s1, s0 -b-> s2` and get the same region analysis and
   synthesis. *Is this a region?* answers yes or no for any set of states
@@ -715,20 +730,41 @@ Miner, a fitness check), *Compare discovery* (three miners side by side),
 confidence* (bootstrap intervals, a test and a plot; needs the `science`
 extra) and *Predict the next activity*. Or start empty.
 
-- **The page is the canvas.** Three buttons in its header: **+ Add box**,
-  **Run ▶**, and **⋯** for Re-run, Record, Export experiment and Save.
+- **The page is the canvas.** Its header has **Canvas | Summary**, then
+  **+ Add box**, **Run ▶**, and **⋯** for Re-run, Record, Export experiment
+  and Save. The sidebar beside it lists the folder's analyses and, folded
+  under them, its logs.
 - **+ Add box** (or a double-click on the canvas) opens every box, by group:
   the six core groups side by side (Input, Filter, Discover, Check, Compare,
   Output) and one line for the rest (Science, Predict, Coloured nets, Sweep,
-  your own boxes) with *Show all*. Type to search them all: "alpha" finds the
-  α-algorithm; Enter adds the first match.
+  your own boxes) with *Show all*. Under *Input*, **the folder's own files**:
+  one click adds the box that reads the file, already set. Type to search
+  them all: "alpha" finds the α-algorithm, "boarding" the log; Enter adds the
+  first match.
+- **Files flow into the canvas.** Drop a log, an OCEL 2.0 object-centric log
+  (`.jsonocel`), a PNML file, a .cpn or a ts.txt on the canvas and it becomes
+  its input box at that spot; an input
+  box names its file ("INPUT · boarding.xes"). *Open log…* and *Log from
+  notation…* in the sidebar land as boxes on the current analysis (or a new
+  one named after the file). In a box's **Settings**, *Choose…* picks the
+  file and the list beside it offers only the files the box can read.
+- **Summary** is the key figure of every box, in one place: a tile per box,
+  in the order the boxes run (a score's first metric, a table's size, a
+  log's cases, a net's places and transitions). Nothing is computed there:
+  a tile is the box's result, as on the canvas, and a tile opens the box.
+  The process map under the tiles is the *Directly-follows graph* box's
+  result; an analysis without that box offers to add it in one click.
 - **Connect** by dragging from the dot on the right of a box: while you drag,
   only the inputs that take that kind of result light up, so a wrong
   connection cannot be made. Click a wire and press Delete to remove it.
 - **Click a box** and the side panel appears beside the canvas, on
   **Result** (the net, the log's figures, the table, the figure; a log's
   Result has *Open as log ›* for the dotted chart, process map, footprint,
-  variants and cases). Its other tabs: **How** (what the box reported: notes,
+  variants and cases, and a net's has *Open a copy in Model ›*). A page
+  opened this way shows "‹ Back to <analysis>" above its title. A
+  discovered net can be tidied on the Result tab by dragging its places and
+  transitions (the layout is saved with the workflow); the net itself is not
+  changed there. Its other tabs: **How** (what the box reported: notes,
   intermediate values, the derivation), **Code** (the box's few lines and,
   under them, the actual algorithm it calls: the α-algorithm's eight steps,
   the Inductive Miner's cuts, with the work each follows and *Whole file* for
@@ -754,6 +790,14 @@ extra) and *Predict the next activity*. Or start empty.
   material for a paper, which `openprocess run --check` can verify.
 - **The side panel** resizes by dragging the gap beside it; double-click the
   gap, or *View ▸ Reset Workflow Layout*, for its default width.
+- **Connections** (at the bottom of the sidebar, or *View ▸ Connections*)
+  draws what flows in, OpenProcess and its boxes, what flows out, and the
+  optional tools (pandas, numpy, scipy, matplotlib, …) with whether each is
+  installed, how to install it and the boxes it brings. All of it is read
+  from the box library.
+- **Motion** is kept short: a space switch, the side panel and Canvas ↔
+  Summary settle in a fifth of a second, and a box pulses once when it
+  finishes. `OPENPROCESS_NO_MOTION=1` turns it off.
 
 ## Workflows from Python
 

{openprocess-0.8.0 → openprocess-0.10.5}/openprocess/__init__.py

@@ -48,7 +48,7 @@ from .sim.simulator import Simulator
 #: The one place the version number is written (pyproject.toml, the update
 #: check and packaging/build.py read it from here).  A release is tagged
 #: "v" + this, e.g. v0.2.0.
-__version__ = "0.8.0"
+__version__ = "0.10.5"
 
 __all__ = [
     "Arc", "BindingElement", "CPNet", "Marking", "Multiset", "Page", "Place",

openprocess-0.10.5/openprocess/citation.py

@@ -0,0 +1,193 @@
+"""Citations: BibTeX for the app, and for the works each algorithm follows.
+
+The reference list (:mod:`openprocess.references`) is written for people, one
+line per work.  :func:`entry` turns such a line into a BibTeX entry, well
+enough for a bibliography: the authors before the title, the title between
+asterisks, the venue after it, the year at the end, and the DOI or URL when
+the reference has one.  :func:`app_bibtex` cites the app itself, with its
+version; ``CITATION.cff`` at the top of the repository says the same for
+GitHub's *Cite this repository*.
+"""
+
+from __future__ import annotations
+
+import datetime as _dt
+import re
+from dataclasses import dataclass, field
+
+from . import references as _references
+
+APP_TITLE = "OpenProcess: process mining, Petri nets and workflows in one open app"
+APP_URL = "https://github.com/s4mstruthers/openprocess"
+APP_AUTHORS = (("Struthers", "Sam"),)
+
+
+def app_version() -> str:
+    from . import __version__
+    return __version__
+
+
+# ---------------------------------------------------------------------------
+# One entry
+# ---------------------------------------------------------------------------
+@dataclass(frozen=True)
+class Entry:
+    """A BibTeX entry: its kind (``article``, ``book``, …), key and fields, in order."""
+
+    kind: str
+    key: str
+    fields: dict[str, str] = field(default_factory=dict)
+
+    def bibtex(self) -> str:
+        width = max((len(name) for name in self.fields), default=0)
+        lines = [f"@{self.kind}{{{self.key},"]
+        for name, value in self.fields.items():
+            if value:
+                lines.append(f"  {name.ljust(width)} = {{{_escape(value)}}},")
+        lines.append("}")
+        return "\n".join(lines)
+
+
+def _escape(value: str) -> str:
+    return value.replace("&", r"\&").replace("%", r"\%").replace("#", r"\#")
+
+
+_TITLE = re.compile(r"\*(.+?)\*")
+_YEAR = re.compile(r"\b(19|20)\d{2}\b")
+_VOLUME = re.compile(r"\s*(\d+)\((\d+)\):(\d+[–-]\d+)")
+_PAGES = re.compile(r"pp\.\s*(\d+[–-]\d+)")
+_PROCEEDINGS = ("LNCS", "LNBIP", "Proceedings", "Workshop", "Conference", "Demo Track", "CEUR", "Symposium",
+                "ICPM", "Models of Concurrency")
+
+
+def entry(reference: _references.Reference) -> Entry:
+    """The reference as a BibTeX entry (its kind guessed from the venue)."""
+    text = reference.citation.strip()
+    year_match = None
+    for year_match in _YEAR.finditer(text):
+        pass
+    year = year_match.group(0) if year_match else ""
+    link = reference.link or ""
+    doi, url = (link, "") if link.startswith("10.") else ("", link)
+    title_match = _TITLE.search(text)
+    if title_match is None:                        # a standard or a tool, named in one line
+        return Entry("misc", reference.key, {"title": text.rstrip("."), "year": year, "doi": doi, "url": url})
+    authors = text[:title_match.start()].strip().rstrip(".,").strip()
+    title = title_match.group(1).strip().rstrip(",")
+    rest = text[title_match.end():].strip().lstrip(".,").strip().rstrip(".")
+    rest = re.sub(r",?\s*" + re.escape(year) + r"\s*$", "", rest).strip().rstrip(",.") if year else rest
+    fields: dict[str, str] = {}
+    if any(ch.isdigit() for ch in authors) or " " not in authors:
+        fields["organization"] = authors          # "ISO/IEC 15909-2:2011"
+    else:
+        fields["author"] = " and ".join(part.strip() for part in re.split(r",\s*|\s+and\s+", authors) if part.strip())
+    fields["title"] = title
+    lower = text.lower()
+    volume = _VOLUME.search(rest)
+    if "thesis" in lower:
+        kind = "phdthesis"
+        fields["school"] = re.sub(r"^phd thesis,?\s*", "", rest, flags=re.I)
+    elif "working paper" in lower or "technical report" in lower:
+        kind = "techreport"
+        fields["institution"] = rest
+    elif volume is not None:
+        kind = "article"
+        fields["journal"] = rest[:volume.start()].strip().rstrip(",")
+        fields["volume"], fields["number"], fields["pages"] = volume.group(1), volume.group(2), volume.group(3)
+    elif any(word in rest for word in _PROCEEDINGS):
+        kind = "inproceedings"
+        booktitle, publisher = rest, ""
+        if ". Springer" in rest or rest.endswith("Springer"):
+            booktitle, _, publisher = rest.rpartition(". ")
+            publisher = publisher.strip() or "Springer"
+        pages = _PAGES.search(booktitle)
+        if pages:
+            fields["pages"] = pages.group(1)
+            booktitle = _PAGES.sub("", booktitle).strip().rstrip(",")
+        fields["booktitle"] = booktitle
+        fields["publisher"] = publisher
+    elif "edition" in rest or rest.endswith("Press") or rest.startswith("Springer") or rest.startswith("Cambridge"):
+        kind = "book"
+        edition = re.search(r"(\d+)(st|nd|rd|th) edition", rest)
+        if edition:
+            fields["edition"] = edition.group(1)
+            rest = re.sub(r",?\s*\d+(st|nd|rd|th) edition\.?\s*", " ", rest).strip().rstrip(".,")
+        fields["publisher"] = rest
+    else:
+        kind = "misc"
+        fields["howpublished"] = rest
+    fields["year"] = year
+    fields["doi"] = doi
+    fields["url"] = url
+    return Entry(kind, reference.key, fields)
+
+
+def entries_for_module(module: str) -> list[Entry]:
+    """The works the code in ``module`` follows (see :func:`references.topics_for_module`)."""
+    seen, out = set(), []
+    for topic in _references.topics_for_module(module):
+        for key in topic.sources:
+            reference = _references.reference(key)
+            if reference is not None and key not in seen:
+                seen.add(key)
+                out.append(entry(reference))
+    return out
+
+
+# ---------------------------------------------------------------------------
+# The app itself
+# ---------------------------------------------------------------------------
+def app_entry(version: str | None = None, year: int | None = None) -> Entry:
+    version = version or app_version()
+    year = year or _dt.date.today().year
+    return Entry("software", "openprocess", {
+        "author": " and ".join(f"{last}, {first}" for last, first in APP_AUTHORS),
+        "title": APP_TITLE,
+        "version": version,
+        "year": str(year),
+        "url": APP_URL,
+        "note": "Every algorithm shows its code and the paper it follows; every analysis keeps a record "
+                "that runs again",
+    })
+
+
+def app_bibtex(version: str | None = None, year: int | None = None) -> str:
+    return app_entry(version, year).bibtex()
+
+
+def app_text(version: str | None = None, year: int | None = None) -> str:
+    """The citation in one line, as a reference list would have it."""
+    version = version or app_version()
+    year = year or _dt.date.today().year
+    authors = ", ".join(f"{first} {last}" for last, first in APP_AUTHORS)
+    return f"{authors}. {APP_TITLE} (version {version}) [software], {year}. {APP_URL}"
+
+
+def cff_text(version: str | None = None, released: _dt.date | None = None) -> str:
+    """The contents of ``CITATION.cff`` (Citation File Format 1.2.0) for ``version``."""
+    version = version or app_version()
+    released = released or _dt.date.today()
+    authors = "\n".join(f"  - family-names: {last}\n    given-names: {first}" for last, first in APP_AUTHORS)
+    return (
+        "cff-version: 1.2.0\n"
+        "message: If you use OpenProcess in teaching or research, please cite it as below.\n"
+        "type: software\n"
+        f"title: {APP_TITLE}\n"
+        f"version: {version}\n"
+        f"date-released: {released.isoformat()}\n"
+        f"repository-code: {APP_URL}\n"
+        f"url: {APP_URL}\n"
+        "license: MIT\n"
+        "keywords:\n  - process mining\n  - Petri nets\n  - workflow nets\n  - conformance checking\n"
+        "  - teaching\n  - reproducible research\n"
+        f"authors:\n{authors}\n"
+        "abstract: >-\n"
+        "  OpenProcess is a desktop app for process mining and Petri net modelling in which\n"
+        "  every algorithm is a function whose code and source paper are one click away, and\n"
+        "  every analysis keeps a record of its inputs, versions and seeds so that its numbers\n"
+        "  can be checked again.\n"
+    )
+
+
+__all__ = ["Entry", "entry", "entries_for_module", "app_entry", "app_bibtex", "app_text", "cff_text",
+           "APP_TITLE", "APP_URL"]