Dynamic controllability via timed game automata

DOI10.1007/s00236-016-0257-2zbMath1350.68251OpenAlexW2273117767WikidataQ62041085 ScholiaQ62041085MaRDI QIDQ329422

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

zbMATH Keywords

dynamic controllabilitytemporal networkstimed game automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05) Agent technology and artificial intelligence (68T42)

Related Items (8)

An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty ⋮ Dynamic controllability of temporal networks with instantaneous reaction ⋮ Mining Significant Temporal Networks Is Polynomial ⋮ GSM+T: A Timed Artifact-Centric Process Model. ⋮ Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty. ⋮ Mining CSTNUDs significant for a set of traces is polynomial ⋮ Conditional simple temporal networks with uncertainty and decisions ⋮ Efficient execution of dynamically controllable simple temporal networks with uncertainty

Uses Software

• UPPAAL TIGA

Cites Work

• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Efficient solution techniques for disjunctive temporal reasoning problems
• Temporal constraint networks
• A theory of timed automata
• Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
• CTP: A new constraint-based formalism for conditional, temporal planning
• Solving strong controllability of temporal problems with uncertainty using SMT
• Flexible Plan Verification: Feasibility Results
• Strong Controllability of Disjunctive Temporal Problems with Uncertainty
• Handling contingency in temporal constraint networks: from consistency to controllabilities
• On the synthesis of discrete controllers for timed systems
• Dynamic Controllability and Dispatchability Relationships
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Dynamic controllability via timed game automata