Mining CSTNUDs significant for a set of traces is polynomial
From MaRDI portal
Publication:2051798
DOI10.1016/j.ic.2021.104773OpenAlexW3175864717MaRDI QIDQ2051798
Guido Sciavicco, Tiziano Villa, Matteo Zavatteri
Publication date: 25 November 2021
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2021.104773
Cites Work
- Unnamed Item
- Dynamic controllability via timed game automata
- Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way
- Temporal constraint networks
- CTP: A new constraint-based formalism for conditional, temporal planning
- Conditional simple temporal networks with uncertainty and decisions
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- Conditional Simple Temporal Networks with Uncertainty and Resources
This page was built for publication: Mining CSTNUDs significant for a set of traces is polynomial