On the public citation graph

Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation

0 signed · 54 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.
Claim with ORCID
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.
See reference health

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.1007/3-540-48738-7_22openalex-snapshot
Time Constraints in Workflow Systems
inferredcites →https://doi.org/10.1007/3-540-59042-0_76openalex-snapshot
On the synthesis of discrete controllers for timed systems
inferredcites →https://doi.org/10.1007/978-3-319-07046-9_33openalex-snapshot
Dynamic Controllability and Dispatchability Relationships
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_14openalex-snapshot
UPPAAL-Tiga: Time for Playing Games!
inferredcites →https://doi.org/10.1007/978-3-540-74970-7_64openalex-snapshot
Strong Controllability of Disjunctive Temporal Problems with Uncertainty
inferredcites →https://doi.org/10.1007/978-3-540-75454-1_3openalex-snapshot
Efficient On-the-Fly Algorithms for Partially Observable Timed Games
inferredcites →https://doi.org/10.1007/978-3-642-03848-8_6openalex-snapshot
Controllability in Temporal Conceptual Workflow Schemata
inferredcites →https://doi.org/10.1007/978-3-642-33558-7_20openalex-snapshot
Solving Temporal Problems Using SMT: Strong Controllability
inferredcites →https://doi.org/10.1007/978-3-642-36926-1_15openalex-snapshot
Time Constraints in Workflow Systems
inferredcites →https://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
inferredcites →https://doi.org/10.1007/978-3-662-44440-5_20openalex-snapshot
Magic Loops and the Dynamic Controllability of Simple Temporal Networks with Uncertainty
inferredcites →https://doi.org/10.1016/0004-3702(91)90006-6openalex-snapshot
Temporal constraint networks
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/s0004-3702(03)00113-9openalex-snapshot
Efficient solution techniques for disjunctive temporal reasoning problems
inferredcites →https://doi.org/10.1023/a:1025894003623openalex-snapshot
CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning
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.2010.16openalex-snapshot
A Fast Incremental Algorithm for Managing the Execution of Dynamically Controllable Temporal Networks
inferredcites →https://doi.org/10.1109/time.2013.13openalex-snapshot
A Faster Execution Algorithm for Dynamically Controllable STNUs
inferredcites →https://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
inferredcites →https://doi.org/10.1145/2240166.2240169openalex-snapshot
Conceptual modeling of flexible temporal workflows
inferredcites →https://doi.org/10.1145/967900.968040openalex-snapshot
Architectures for a temporal workflow management system
inferredcites →https://doi.org/10.1609/aaai.v28i1.9040openalex-snapshot
Using Timed Game Automata to Synthesize Execution Strategies for Simple Temporal Networks with Uncertainty
inferredcites →https://doi.org/10.4230/lipics.time.2017.23openalex-snapshot
Conditional Simple Temporal Networks with Uncertainty and Decisions
inferredcites →https://doi.org/10.48550/arxiv.1212.2005openalex-snapshot
The Dynamic Controllability of Conditional STNs with Uncertainty
inferredcites →https://doi.org/10.5220/0004256101440156openalex-snapshot
An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty
inferredcites →https://doi.org/10.5220/0004758100630073openalex-snapshot
A Faster Algorithm for Checking the Dynamic Controllability of Simple Temporal Networks with Uncertainty

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-319-26138-6_2openalex-snapshot
Time Management in Workflows with Loops
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_18openalex-snapshot
A New Approach to Checking the Dynamic Consistency of Conditional Simple Temporal Networks
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-016-0257-2openalex-snapshot
Dynamic controllability via Timed Game Automata
inferred← citeshttps://doi.org/10.1007/s10601-026-09392-7openalex-snapshot
Conditional temporal planning: how chance encounters and casual collaborations may raise great expectations
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.2018.11.008openalex-snapshot
Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty
inferred← citeshttps://doi.org/10.1016/j.ic.2017.08.008openalex-snapshot
Checking dynamic consistency of conditional hyper temporal networks via mean payoff games
inferred← citeshttps://doi.org/10.1016/j.is.2015.10.002openalex-snapshot
Process time patterns: A formal foundation
inferred← citeshttps://doi.org/10.1016/j.jbi.2017.02.015openalex-snapshot
An artificial intelligence framework for compensating transgressions and its application to diet management
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.023openalex-snapshot
Conditional simple temporal networks with uncertainty and decisions
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/time.2015.18openalex-snapshot
Dynamic Consistency of Conditional Simple Temporal Networks via Mean Payoff Games: A Singly-Exponential Time DC-checking
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/time.2016.17openalex-snapshot
Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete
inferred← citeshttps://doi.org/10.1140/epjb/e2015-60657-4openalex-snapshot
Modern temporal network theory: a colloquium
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/icaps.v26i1.13756openalex-snapshot
Checking the Dynamic Consistency of Conditional Temporal Networks with Bounded Reaction Times
inferred← citeshttps://doi.org/10.1613/jair.1.11453openalex-snapshot
Conditional Simple Temporal Networks with Uncertainty and Resources
inferred← citeshttps://doi.org/10.24963/ijcai.2018/184openalex-snapshot
Simpler and Faster Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks
inferred← citeshttps://doi.org/10.24963/ijcai.2019/886openalex-snapshot
Complexity Bounds for the Controllability of Temporal Networks with Conditions, Disjunctions, and Uncertainty (Extended Abstract)
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.48550/arxiv.1602.06260openalex-snapshot
Checking Dynamic Consistency of Conditional Hyper Temporal Networks via Mean Payoff Games (Hardness and (pseudo) Singly-Exponential Time Algorithm)
inferred← citeshttps://doi.org/10.48550/arxiv.1608.04132openalex-snapshot
Instantaneous Reaction-Time in Dynamic-Consistency Checking of Conditional Simple Temporal Networks -- Extended version with an Improved Upper Bound --
inferred← citeshttps://doi.org/10.48550/arxiv.2108.01021openalex-snapshot
Learning off-road maneuver plans for autonomous vehicles
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.