Distributed algorithms for time optimal reachability analysis

DOI10.1007/978-3-319-44878-7_10MaRDI QIDQ4603566zbMATH OpenOpenAlexFDO

Authors Zhengkui Zhang, Brian Nielsen, Kim G. Larsen

Publication date 16 February 2018

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

Full work available at URL https://doi.org/10.1007/978-3-319-44878-7_10

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Recommendations

• A work-efficient distributed algorithm for reachability analysis.
• A work-efficient distributed algorithm for reachability analysis
• Lazy reachability analysis in distributed systems
• Let's be lazy, we have time -- or, lazy reachability analysis for timed automata
• d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata

Cited in

(9)

• Fast distributed algorithms to make mutually coordinated decisions in stringent real time
• A work-efficient distributed algorithm for reachability analysis
• Joint optimization and reachability analysis in graph transformation systems with time
• d-IRA: A Distributed Reachability Algorithm for Analysis of Linear Hybrid Automata
• Efficient distributed algorithms by using the archimedean time assumption
• Reachability analysis on distributed executions
• New classes of distributed time complexity
• Distributed Extended Beam Search for Quantitative Model Checking
• Optimal time-bounded reachability analysis for concurrent systems

Describes a project that uses

Uses Software

• Uppaal

This page was built for publication: Distributed algorithms for time optimal reachability analysis

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