Optimal time-bounded reachability analysis for concurrent systems

DOI10.1007/978-3-030-17465-1_11MaRDI QIDQ6091409zbMATH OpenOpenAlexFDO

Authors Yuliya Butkova, Gereon Fox

Publication date 24 November 2023

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-17465-1_11

Mathematics Subject Classification ID

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

Recommendations

• Distributed algorithms for time optimal reachability analysis
• Efficient hybrid reachability analysis for asynchronous concurrent systems
• Efficient Reachability Analysis for Time Petri Nets
• Reachability in timed counter systems
• Multi-core Reachability for Timed Automata
• Optimal reachability in cost time Petri nets
• Efficient model-checking of dense-time systems with time-convexity analysis
• Reachability analysis for timed automata using max-plus algebra

Cited in

(4)

• An algorithm for exact bounds on the time separation of events in concurrent systems
• scientific article; zbMATH DE number 2080057 (Why is no real title available?)
• Multi-core Reachability for Timed Automata
• scientific article; zbMATH DE number 5587270 (Why is no real title available?)

This page was built for publication: Optimal time-bounded reachability analysis for concurrent systems

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