Conversation
Signed-off-by: Victor Voronin <vivo@eiva.com>
Signed-off-by: Victor Voronin <vivo@eiva.com>
vivoeiva
force-pushed
the
fix/boolean-path-formulas
branch
from
September 17, 2026 10:57
86735b3 to
1e836e2
Compare
There was a problem hiding this comment.
🔵 Needs a closer look
Add tests combining one state operand with one path operand in both orders.
Pull request overview
Updates JaniParser to correctly distinguish state and path boolean formulas.
Changes:
- Added path-aware boolean formula construction.
- Expanded parser tests for boolean formula classifications.
File summaries
| File | Summary |
|---|---|
src/test/storm/parser/JaniParserTest.cpp |
Adds coverage for path/state boolean formulas. |
src/storm-parsers/parser/JaniParser.cpp |
Selects formula types based on path operands; mixed state/path operand coverage remains needed. |
Review details
Suppressed comments (1)
src/storm-parsers/parser/JaniParser.cpp:337
- This branch is intended to handle the case where only one operand is a path formula, but every new binary test uses two path operands. A regression from
||to&&would therefore still pass the conjunction, disjunction, and implication tests; add a JANI property with one state operand and one path operand (ideally in both operand orders) and assert that it produces aBinaryBooleanPathFormula.
if (left->isPathFormula() || right->isPathFormula()) {
- Files reviewed: 2/2 changed files
- Comments generated: 0
- Review effort level: Lite
💡 Add a code-review agent skill or configure MCP servers for context-aware, tailored reviews. Learn more in the docs.
volkm
approved these changes
Sep 17, 2026
volkm
left a comment
Contributor
There was a problem hiding this comment.
The code looks good to me.
@tquatmann Are the any conceptual issues with this change I might have overlooked?
This branch has not been deployed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Currently JaniParser emits
BooleanStateFormulawhenever it reaches a boolean operator over some other operator(s). This change it to actual check if one of the op's underneath is a path operator and emitsBooleanPathFormula/BooleanStateFormuladepending on that check.Tests expanded to check for new behavior. The embedded
die.janialso passes through the actual MC and emits plausible results.