New Tool Converts Java Code to Petri Nets for Automated Concurrency Verification

Formal verification of concurrent software remains a longstanding challenge in computer science, requiring tools that balance the need to check complex properties against the practical reality that analysis must scale to real programs. A team of researchers has introduced a fresh approach to this problem through a tool called Petrify, which converts Java bytecode into Petri nets—a mathematical formalism for modeling concurrent systems—and then leverages existing model checking tools to analyze the resulting models.

How Petrify Works#

The core innovation involves mapping the runtime behavior of Java programs directly onto Petri net structures, which can then be processed by mature verification engines such as LoLA. By operating at the bytecode level rather than source code, the approach gains a practical advantage: it works uniformly across any version of Java and even supports Kotlin, which compiles to the same intermediate representation. The resulting prototype tool, jPetrify, demonstrates how this strategy can be applied in practice.

Balancing Precision and Scale#

Petrify navigates a deliberate trade-off in the formal verification landscape. Whereas some techniques prioritize detecting intricate properties but struggle with large programs, and others scale well but sacrifice accuracy, the Petri net encoding achieves both goals: the representation is precise enough to capture concurrent program semantics while remaining succinct enough that analysis time remains relatively stable as program parameters grow.

Current Focus and Future Directions#

Initial experiments concentrate on identifying fundamental concurrency issues, particularly deadlock conditions. The team frames this as a starting point, suggesting that the Petri net foundation opens doors for analyzing additional categories of concurrent behavior in the months ahead.