Dynamic controllability via timed game automata
From MaRDI portal
Recommendations
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- Dynamic controllability and dispatchability relationships
- Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty
- Dynamic controllability of simple temporal networks with uncertainty: simple rules and fast real-time execution
- Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm
Cites work
- scientific article; zbMATH DE number 5547866 (Why is no real title available?)
- scientific article; zbMATH DE number 3241254 (Why is no real title available?)
- A theory of timed automata
- CONCUR 2005 – Concurrency Theory
- CTP: A new constraint-based formalism for conditional, temporal planning
- Dynamic controllability and dispatchability relationships
- Efficient solution techniques for disjunctive temporal reasoning problems
- Flexible plan verification: feasibility results
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
- Maintaining knowledge about temporal intervals
- On the synthesis of discrete controllers for timed systems
- Solving strong controllability of temporal problems with uncertainty using SMT
- Strong Controllability of Disjunctive Temporal Problems with Uncertainty
- Temporal constraint networks
Cited in
(12)- Conditional simple temporal networks with uncertainty and decisions
- Time-autonomy and time-controllability of discrete multidimensional behaviours
- Mining CSTNUDs significant for a set of traces is polynomial
- Dynamic controllability of temporal networks with instantaneous reaction
- Mining Significant Temporal Networks Is Polynomial
- Dynamic controllability and dispatchability relationships
- Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty
- Efficient execution of dynamically controllable simple temporal networks with uncertainty
- Semantics and controllability of time-aware business processes
- Extending conditional simple temporal networks with partially shrinkable uncertainty
- GSM+T: a timed artifact-centric process model
- An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty
This page was built for publication: Dynamic controllability via timed game automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329422)
