Corrigendum to “Revisiting reachability in polynomial interrupt timed automata” [Information Processing Letters 174 (2022) 106208]
Information Processing Letters（2022）
Abstract
• Corrigendum to the paper “Revisiting reachability in polynomial interrupt timed automata”. • The lower bound is corrected from PSPACE to NP.
MoreTranslated text
Key words
automata”,reachability,information processing letters
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined