Coverability problem of asynchronous multi-process timed automata

DOI10.13328/J.CNKI.JOS.005209zbMATH Open1389.68045MaRDI QIDQ3132074FDOQ3132074

Authors: Li Liu, Guoqiang Li 

Publication date: 29 January 2018

Recommendations

• scientific article; zbMATH DE number 2080041
• scientific article; zbMATH DE number 1497794
• A theory of timed automata
• scientific article; zbMATH DE number 795181
• scientific article; zbMATH DE number 1507209

zbMATH Keywords

timed automatareal-time systemcoverabilityread-arc timed Petri net

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

This page was built for publication: Coverability problem of asynchronous multi-process timed automata

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