On the public citation graph
A Structural Characterization of Temporal Dynamic Controllability
0 signed · 73 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.1016/0004-3702(91)90006-6openalex-snapshot
Temporal constraint networks
inferredcites →https://doi.org/10.1016/s0004-3702(98)00068-xopenalex-snapshot
Remote Agent: to boldly go where no AI system has gone before
inferredcites →https://doi.org/10.1080/095281399146607openalex-snapshot
Handling contingency in temporal constraint networks: 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-031-01567-0openalex-snapshot
An Introduction to Constraint-Based Temporal Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_33openalex-snapshot
Dynamic Controllability and Dispatchability Relationships
inferred← citeshttps://doi.org/10.1007/978-3-319-25210-0_11openalex-snapshot
New Techniques for Checking Dynamic Controllability of Simple Temporal Networks with Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-319-25210-0_15openalex-snapshot
Revisiting Classical Dynamic Controllability: A Tighter Complexity Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-03848-8_6openalex-snapshot
Controllability in Temporal Conceptual Workflow Schemata
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/978-3-662-44440-5_20openalex-snapshot
Magic Loops and the Dynamic Controllability of Simple Temporal Networks with Uncertainty
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-016-0257-2openalex-snapshot
Dynamic controllability via Timed Game Automata
inferred← citeshttps://doi.org/10.1007/s10270-017-0643-4openalex-snapshot
Managing time-awareness in modularized processes
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.2017.11.006openalex-snapshot
Strong temporal planning with uncontrollable durations
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.ic.2021.104792openalex-snapshot
Determining temporal agreements in cross-organizational business processes
inferred← citeshttps://doi.org/10.1016/j.ins.2021.10.008openalex-snapshot
Adding flexibility to uncertainty: Flexible Simple Temporal Networks with Uncertainty (FTNU)
inferred← citeshttps://doi.org/10.1016/j.knosys.2016.08.029openalex-snapshot
Hierarchical task network-based emergency task planning with incomplete information, concurrency and uncertain duration
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.2009.14openalex-snapshot
Simple Algorithm for Simple Timed Games
inferred← citeshttps://doi.org/10.1109/time.2009.25openalex-snapshot
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
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.2014.21openalex-snapshot
Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation
inferred← citeshttps://doi.org/10.1109/time.2015.26openalex-snapshot
A Sound-and-Complete Propagation-Based Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks
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/2110363.2110382openalex-snapshot
Modelling temporal, data-centric medical processes
inferred← citeshttps://doi.org/10.1145/2245276.2245292openalex-snapshot
On the complexity of temporal controllabilities for workflow schemata
inferred← citeshttps://doi.org/10.1145/2857705.2857716openalex-snapshot
Security Constraints in Temporal Role-Based Access-Controlled Workflows
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.v28i1.9048openalex-snapshot
Chance-Constrained Probabilistic Simple Temporal Problems
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9652openalex-snapshot
Resolving Over-Constrained Probabilistic Temporal Problems through Chance Constraint Relaxation
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.v33i01.33017683openalex-snapshot
Automated Verification of Social Laws for Continuous Time Multi-Robot Systems
inferred← citeshttps://doi.org/10.1609/aaai.v34i06.6538openalex-snapshot
Dynamic Control of Probabilistic Simple Temporal Networks
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21213openalex-snapshot
Speeding Up the RUL¯ Dynamic-Controllability-Checking Algorithm for Simple Temporal Networks with Uncertainty
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13603openalex-snapshot
Incremental Dynamic Controllability Revisited
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13623openalex-snapshot
Resolving Uncontrollable Conditional Temporal Problems Using Continuous Relaxations
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13646openalex-snapshot
EfficientIDC: A Faster Incremental Dynamic Controllability Algorithm
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13723openalex-snapshot
Optimising Bounds in Simple Temporal Networks with Uncertainty under Dynamic Controllability Constraints
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.v29i1.3480openalex-snapshot
Propagating Piecewise-Linear Weights in Temporal Networks
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15988openalex-snapshot
Privacy-Preserving Algorithm for Decoupling of Multi-Agent Plans with Uncertainty
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31487openalex-snapshot
Converting Simple Temporal Networks with Uncertainty into Minimal Equivalent Dispatchable Form
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.13065openalex-snapshot
Dynamic Controllability of Temporal Plans in Uncertain and Partially Observable Environments
inferred← citeshttps://doi.org/10.1613/jair.5431openalex-snapshot
Resolving Over-Constrained Temporal Problems with Uncertainty through Conflict-Directed Relaxation
inferred← citeshttps://doi.org/10.18725/oparu-3221openalex-snapshot
Simple Temporal Networks with Partially Shrinkable Uncertainty (extended version)
inferred← citeshttps://doi.org/10.18725/oparu-4506openalex-snapshot
Controlling time-awareness in modularized processes (extended version)
inferred← citeshttps://doi.org/10.2200/s00557ed1v01y201312aim026openalex-snapshot
An Introduction to Constraint-Based Temporal Reasoning
inferred← citeshttps://doi.org/10.24963/ijcai.2017/598openalex-snapshot
Faster Conflict Generation for Dynamic Controllability
inferred← citeshttps://doi.org/10.24963/ijcai.2018/12openalex-snapshot
Managing Communication Costs under Temporal Uncertainty
inferred← citeshttps://doi.org/10.24963/ijcai.2019/765openalex-snapshot
Faster Dynamic Controllability Checking in Temporal Networks with Integer Bounds
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.3233/jifs-17681openalex-snapshot
Resource-constrained Hierarchical Task Network planning under uncontrollable durations for emergency decision-making
inferred← citeshttps://doi.org/10.3384/lic.diva-119409openalex-snapshot
Efficient Temporal Reasoning with Uncertainty
inferred← citeshttps://doi.org/10.3390/app12031461openalex-snapshot
Dynamic Controllability of Processes without Surprises
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.48550/arxiv.1512.06404openalex-snapshot
Security Constraints in Temporal Role-Based Access-Controlled Workflows (Extended Version)
inferred← citeshttps://doi.org/10.5220/0004260501570170openalex-snapshot
Magic Loops in Simple Temporal Networks with Uncertainty - Exploiting Structure to Speed Up Dynamic Controllability Checking
inferred← citeshttps://doi.org/10.5220/0004758100630073openalex-snapshot
A Faster Algorithm for Checking the Dynamic Controllability of Simple Temporal Networks with Uncertainty
inferred← citeshttps://doi.org/10.5220/0004815801300141openalex-snapshot
Classical Dynamic Controllability Revisited - A Tighter Bound on the Classical Algorithm
inferred← citeshttps://doi.org/10.5220/0005200903700381openalex-snapshot
Simple Temporal Networks with Partially Shrinkable Uncertainty
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.