Obligation properties in LTLf+ admit a direct symbolic translation to deterministic weak automata, enabling linear-time synthesis via DWA games with effectiveness comparable to LTLf.
Strategy Synthesis for Data-Aware Dynamic Systems with Multiple Actors
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Extends Petri nets with identifiers for object- and resource-aware systems and defines generalized correctness criteria with decidability analysis.
citing papers explorer
-
Symbolic Synthesis for LTLf+ Obligations
Obligation properties in LTLf+ admit a direct symbolic translation to deterministic weak automata, enabling linear-time synthesis via DWA games with effectiveness comparable to LTLf.
-
Correctness Notions for Petri Nets with Identifiers
Extends Petri nets with identifiers for object- and resource-aware systems and defines generalized correctness criteria with decidability analysis.