Dynamic controllability via timed game automata
DOI10.1007/S00236-016-0257-2zbMATH Open1350.68251DBLPjournals/acta/CimattiHMPR16OpenAlexW2273117767WikidataQ62041085 ScholiaQ62041085MaRDI QIDQ329422FDOQ329422
Alessandro Cimatti, Marco Roveri, Luke Hunsberger, Roberto Posenato, Andrea Micheli
Publication date: 21 October 2016
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11572/258653
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
Formal languages and automata (68Q45) Data structures (68P05) Agent technology and artificial intelligence (68T42)
Cites Work
- Maintaining knowledge about temporal intervals
- A theory of timed automata
- Temporal constraint networks
- CTP: A new constraint-based formalism for conditional, temporal planning
- Title not available (Why is that?)
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- Dynamic Controllability and Dispatchability Relationships
- Title not available (Why is that?)
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
- Solving strong controllability of temporal problems with uncertainty using SMT
- Flexible Plan Verification: Feasibility Results
- Strong Controllability of Disjunctive Temporal Problems with Uncertainty
- On the synthesis of discrete controllers for timed systems
- CONCUR 2005 – Concurrency Theory
- Efficient solution techniques for disjunctive temporal reasoning problems
Cited In (9)
- Efficient execution of dynamically controllable simple temporal networks with uncertainty
- Conditional simple temporal networks with uncertainty and decisions
- Mining Significant Temporal Networks Is Polynomial
- An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty
- Mining CSTNUDs significant for a set of traces is polynomial
- Dynamic controllability of temporal networks with instantaneous reaction
- Time-autonomy and time-controllability of discrete multidimensional behaviours
- Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty.
- GSM+T: A Timed Artifact-Centric Process Model.
Uses Software
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)
