Pages that link to "Item:Q2321284"
From MaRDI portal
The following pages link to Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty (Q2321284):
Displaying 6 items.
- Dynamic controllability via timed game automata (Q329422) (← links)
- Quantifying controllability in temporal networks with uncertainty (Q2046026) (← links)
- Determining temporal agreements in cross-organizational business processes (Q2051815) (← links)
- Probabilistic Temporal Networks with Ordinary Distributions: Theory, Robustness and Expected Utility (Q5154757) (← links)
- A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form (Q6116194) (← links)
- Dynamic controllability of temporal networks with instantaneous reaction (Q6205017) (← links)