Perfect timed communication is hard

DOI10.1007/978-3-030-00151-3_6MaRDI QIDQ1631220zbMATH OpenOpenAlexFDO

Authors Parosh A. Abdulla, Mohamed Faouzi Atig, Shankara Narayanan Krishna

Publication date 6 December 2018

Full work available at URL https://doi.org/10.1007/978-3-030-00151-3_6

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
• Reachability of communicating timed processes
• Meeting deadlines together
• Reachability results for timed automata with unbounded data structures
• Timed lossy channel systems

Cited in

(8)

• Timed Basic Parallel Processes
• Reachability results for timed automata with unbounded data structures
• Meeting deadlines together
• When to ask for an update: timing in strategic communication
• Current communication difficulties
• Reachability of communicating timed processes
• Progress-preserving refinements of CTA
• Communicating Timed Automata: The More Synchronous, the More Difficult to Verify

This page was built for publication: Perfect timed communication is hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1631220)