On the public citation graph
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
0 signed · 43 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11889205_28openalex-snapshot
A Structural Characterization of Temporal Dynamic Controllability
inferredcites →https://doi.org/10.1016/0004-3702(91)90006-6openalex-snapshot
Temporal constraint networks
inferredcites →https://doi.org/10.1080/095281399146607openalex-snapshot
Handling contingency in temporal constraint networks: from consistency to controllabilities
inferredcites →https://doi.org/10.1109/time.1997.600786openalex-snapshot
Contingent durations in temporal CSPs: from consistency to controllabilities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-79382-1_15openalex-snapshot
Semi-contingent Task Durations: Characterization and Controllability
inferred← citeshttps://doi.org/10.1007/978-3-031-01567-0openalex-snapshot
An Introduction to Constraint-Based Temporal Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-662-44440-5_19openalex-snapshot
An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty - Revisited
inferred← citeshttps://doi.org/10.1007/s00236-015-0227-0openalex-snapshot
Efficient execution of dynamically controllable simple temporal networks with uncertainty
inferred← citeshttps://doi.org/10.1007/s00236-015-0248-8openalex-snapshot
Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
inferred← citeshttps://doi.org/10.1007/s00236-015-0252-zopenalex-snapshot
Planning and execution with flexible timelines: a formal account
inferred← citeshttps://doi.org/10.1007/s00236-016-0257-2openalex-snapshot
Dynamic controllability via Timed Game Automata
inferred← citeshttps://doi.org/10.1007/s41666-019-00060-5openalex-snapshot
Promoting Independence with a Schedule Management Assistant that Anticipates Disruptions
inferred← citeshttps://doi.org/10.1016/j.artint.2015.03.002openalex-snapshot
An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103384openalex-snapshot
Quantifying controllability in temporal networks with uncertainty
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.005openalex-snapshot
Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution
inferred← citeshttps://doi.org/10.1109/time.2010.16openalex-snapshot
A Fast Incremental Algorithm for Managing the Execution of Dynamically Controllable Temporal Networks
inferred← citeshttps://doi.org/10.1109/time.2010.17openalex-snapshot
Towards Temporal Controllabilities for Workflow Schemata
inferred← citeshttps://doi.org/10.1109/time.2013.13openalex-snapshot
A Faster Execution Algorithm for Dynamically Controllable STNUs
inferred← citeshttps://doi.org/10.1109/time.2014.13openalex-snapshot
Incremental Dynamic Controllability in Cubic Worst-Case Time
inferred← citeshttps://doi.org/10.1109/time.2015.16openalex-snapshot
An Executable Semantics of Flexible Plans in Terms of Timed Game Automata
inferred← citeshttps://doi.org/10.1109/tsmc.2014.2300055openalex-snapshot
Representing Business Processes Through a Temporal Data-Centric Workflow Modeling Language: An Application to the Management of Clinical Pathways
inferred← citeshttps://doi.org/10.1145/2245276.2245292openalex-snapshot
On the complexity of temporal controllabilities for workflow schemata
inferred← citeshttps://doi.org/10.1145/3555776.3577618openalex-snapshot
Dynamic Controllability of Parameterized CSTNUs
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9040openalex-snapshot
Using Timed Game Automata to Synthesize Execution Strategies for Simple Temporal Networks with Uncertainty
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10401openalex-snapshot
Dynamic Controllability of Disjunctive Temporal Networks: Validation and Synthesis of Executable Strategies
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6538openalex-snapshot
Dynamic Control of Probabilistic Simple Temporal Networks
inferred← citeshttps://doi.org/10.1609/icaps.v26i1.13739openalex-snapshot
The Mathematics of Dispatchability Revisited
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13820openalex-snapshot
Dynamic Controllability of Controllable Conditional Temporal Problems with Uncertainty
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3456openalex-snapshot
Quantifying Degrees of Controllability in Temporal Networks with Uncertainty
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19809openalex-snapshot
Simple Temporal Networks for Improvisational Teamwork
inferred← citeshttps://doi.org/10.1613/jair.1.11375openalex-snapshot
Dynamic Controllability of Controllable Conditional Temporal Problems with Uncertainty
inferred← citeshttps://doi.org/10.1613/jair.1.11453openalex-snapshot
Conditional Simple Temporal Networks with Uncertainty and Resources
inferred← citeshttps://doi.org/10.1613/jair.1.13065openalex-snapshot
Dynamic Controllability of Temporal Plans in Uncertain and Partially Observable Environments
inferred← citeshttps://doi.org/10.1613/jair.3840openalex-snapshot
Distributed Reasoning for Multiagent Simple Temporal Problems
inferred← citeshttps://doi.org/10.18725/oparu-3221openalex-snapshot
Simple Temporal Networks with Partially Shrinkable Uncertainty (extended version)
inferred← citeshttps://doi.org/10.2200/s00557ed1v01y201312aim026openalex-snapshot
An Introduction to Constraint-Based Temporal Reasoning
inferred← citeshttps://doi.org/10.3233/ia-170112openalex-snapshot
Disjunctive temporal networks with uncertainty via SMT: Recent results and directions
inferred← citeshttps://doi.org/10.4230/lipics.time.2017.23openalex-snapshot
Conditional Simple Temporal Networks with Uncertainty and Decisions
inferred← citeshttps://doi.org/10.48550/arxiv.1212.2005openalex-snapshot
The Dynamic Controllability of Conditional STNs with Uncertainty
inferred← citeshttps://doi.org/10.48550/arxiv.1401.4606openalex-snapshot
Drake: An Efficient Executive for Temporal Plans with Choice
inferred← citeshttps://doi.org/10.5220/0005200903700381openalex-snapshot
Simple Temporal Networks with Partially Shrinkable Uncertainty
inferred← citeshttps://doi.org/10.70675/40c2985dz31eaz4c21zb123z805114da3a7fopenalex-snapshot
Temporal and Hierarchical Models for Planning and Acting in Robotics
inferred← citeshttps://doi.org/10.70675/41637fdaz54c1z41fcz90c1z447f575444b9openalex-snapshot
Learning off-road maneuver plans for autonomous vehicles
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.