Multi-core Reachability for Timed Automata

DOI10.1007/978-3-642-33365-1_8MaRDI QIDQ4649388zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andreas Engelbredt Dalsgaard, Alfons W. Laarman, Mads Chr. Olesen, Jaco van de Pol, Kim G. Larsen

Publication date 21 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33365-1_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 7297846
• Optimal time-bounded reachability analysis for concurrent systems
• scientific article; zbMATH DE number 2064231
• Timed automata relaxation for reachability
• Optimal reachability for multi-priced timed automata
• scientific article; zbMATH DE number 1839448
• Concurrency in timed automata

Cited in

(8)

• Dealing with practical limitations of distributed timed model checking for timed automata
• scientific article; zbMATH DE number 1670779 (Why is no real title available?)
• A stack-slicing algorithm for multi-core model checking
• Improving search order for reachability testing in timed automata
• scientific article; zbMATH DE number 1982208 (Why is no real title available?)
• Improved multi-core nested depth-first search
• Mcta: heuristics and search for timed systems
• Optimal time-bounded reachability analysis for concurrent systems

Describes a project that uses

Uses Software

• Uppaal
• LTSmin
• opaal

This page was built for publication: Multi-core Reachability for Timed Automata

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