FactorBound: Certified Subprocess-Extraction Bounds for Process Flowcharts
A tool for engineers that calculates how much a complex process map can be simplified.
An analysis feature for process-modeling tools that computes provable upper and lower bounds on how much a big flowchart can shrink when refactored into subprocesses, so teams know when their restructuring is as good as it can get.
Concept
An analysis add-on for business-process suites and process-mining platforms. Input: a large flowchart — a BPMN process, a process model discovered from event logs, or exported legacy decision logic. The tool computes two numbers for the model: an upper bound, achieved by a constructive procedure/subprocess factoring, and a lower bound proving that no factoring can compress the model further, yielding a certified optimality gap. Process teams use the report to (a) decide whether a restructuring effort is worth it at all, and (b) know when their manually refactored subprocess hierarchy is provably near-optimal, so they can stop refactoring. The wedge: replace guesswork about "how much smaller could this diagram be?" with matching, provable bounds.
Why now
The paper [0] applies its automata analysis to a schema-theoretic problem: the succinctness with which functional schemas (procedure-calling programs) can express equivalent large flowchart schemas, obtaining closely matching upper and lower bounds for a succinctness measure. That is precisely the ingredient a factoring-bounds report needs: without a lower bound, any compression feature can implicitly claim optimality; with closely matching bounds, the tool can state both what is achievable and what is impossible. The evidence supports an offline analysis and reporting capability — the paper demonstrates bounds and constructions, not a deployed refactoring engine — so the product is scoped to planning and reporting, with the constructive upper-bound factoring offered as a suggested decomposition.
Written by GLM · 12 Oct 2026
AI assessment
A niche but technically sound analysis tool for BPMN optimization that transforms theoretical succinctness bounds into a practical 'optimality gap' report for process architects.
- Evidence strength 4/5
- The idea leverages a strong foundation of automata theory regarding succinctness and descriptive complexity (specifically DPDA and finite-state machine equivalence) to justify the possibility of computing these bounds.
- Market pull 3/5
- While the named beneficiaries (Celonis, SAP) manage massive process models, the urgency for 'provable optimality' in diagram layout is lower than the urgency for process performance or compliance.
- Novelty & moat 5/5
- The idea applies high-level theoretical computer science (succinctness bounds) to a specific, underserved problem in BPMN modeling, filling a gap not addressed by the listed catalog ideas.
- Feasibility 3/5
- Implementing the constructive procedures for upper bounds is straightforward, but implementing the lower-bound proofs for complex, real-world BPMN models may be computationally expensive or mathematically fragile.
- Wedge clarity 4/5
- The 'optimality gap' report is a sharp, specific entry point that provides immediate value without requiring the tool to take over the actual refactoring process.
- Simplicity / focus 5/5
- The product is focused on a single, clear function: calculating and reporting bounds on model compression.
Scored by Gemma 4 · 17 Oct 2026. Rated against a fixed rubric (evidence, market, novelty, feasibility, wedge, simplicity), relative to the closest ideas already in the catalog. A prior estimate to compare ideas before real-world signal arrives.
Persona discussion
AI personas trained on real people's expertise debate this idea as it evolves.
View the discussion →Act on this idea
Ideas only matter if someone runs with them. Your message goes straight to the founder's inbox — nothing is stored on our servers.
Business analysis
The SWOT analysis reveals that FactorBound leverages a strong theoretical foundation in automata succinctness to solve a specific pain point in BPMN modeling. While it offers a unique 'optimality certificate' that incumbents lack, its success depends on bridging the gap between complex pushdown automata theory and the practical, often messy, reality of business process diagrams.
Strengths3
Weaknesses3
Opportunities3
Threats3
Essential for evaluating the internal technical strength of the provable bounds against the external opportunity of integrating with major BPMN platforms. · Generated 2026-10-17 by Gemma 4AI-generatedFull SWOT Analysis →
Who benefits
- Celoniscompany
Celonis's process mining outputs enormous discovered process flowcharts; a certified bound on how much subprocess extraction can compress a model tells analysts when a readable refactoring is provably near-optimal instead of endlessly restructured.
- Camundacompany
Camunda's BPMN suite encourages subprocess decomposition; a factoring-bounds report would tell modelers the best-possible size reduction before they invest in restructuring, and certify when they have reached it.
- SAP Signaviocompany
SAP Signavio customers maintain large process hierarchies; an optimality-gap analyzer for subprocess extraction would prioritize modernization work on the models with the most provable compression headroom.
- Sparx Systemscompany
Sparx's Enterprise Architect is used for large flowchart-based specifications; a minimum-factored-size bound report would add a differentiating analysis feature for oversized diagrams that teams currently refactor by intuition.
Research it builds on
- Adding nesting structure to wordsRajeev Alur, P. Madhusudan · 2009 · 334 citationsAll ideas from this paper →
- Decision procedures for families of deterministic pushdown automataLeslie Gabriel Valiant · 2026 · 86 citationsAll ideas from this paper →
- Regularity and Related Problems for Deterministic Pushdown AutomataLeslie Gabriel Valiant · 1975 · 84 citationsAll ideas from this paper →
- Model Checking of Recursive Probabilistic SystemsKousha Etessami, Mihalis Yannakakis · 2012 · 27 citationsAll ideas from this paper →
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGESGiovanni Pighizzini · 2009 · 16 citationsAll ideas from this paper →
- On the power of bounded concurrency IITirza Hirst, David Harel · 1994 · 16 citationsAll ideas from this paper →
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and SuccinctShibashis Guha, Ismaël Jecker, Karoliina Lehtinen et al. · 2024 · 12 citationsAll ideas from this paper →