The paper introduces an ATL*-based temporal and epistemic logic framework for analyzing winning strategies in sabotage games on dynamic graphs.
Petri nets: Properties, analysis and applications
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
A recursive algorithm transforms workflow nets into POWL 2.0 models with formal proofs of language preservation and completeness for separable nets, succeeding on 1,493 benchmark models.
Two complementary static analysis methods for colored Petri net unfolding reduce net size via equivalence classes and color overapproximation, outperforming prior tools on MCC benchmarks in size and solved queries.
citing papers explorer
-
Strategies in Sabotage Games: Temporal and Epistemic Perspectives
The paper introduces an ATL*-based temporal and epistemic logic framework for analyzing winning strategies in sabotage games on dynamic graphs.
-
Hierarchical Decomposition of Separable Workflow-Nets
A recursive algorithm transforms workflow nets into POWL 2.0 models with formal proofs of language preservation and completeness for separable nets, succeeding on 1,493 benchmark models.
-
Methods for Efficient Unfolding of Colored Petri Nets
Two complementary static analysis methods for colored Petri net unfolding reduce net size via equivalence classes and color overapproximation, outperforming prior tools on MCC benchmarks in size and solved queries.