Efficient checking of link-reversal-based concurrent systems

DOI10.1007/978-3-642-32940-1_34zbMATH Open1364.68284OpenAlexW90060165MaRDI QIDQ2912698FDOQ2912698

Authors: Matthias Függer, Josef Widder 

Publication date: 25 September 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-32940-1_34

Recommendations

• Time complexity of link reversal routing
• Analysis of Link Reversal Routing Algorithms
• scientific article; zbMATH DE number 2080053
• Link reversal routing with binary link labels: work complexity
• Using partial orders for the efficient verification of deadlock freedom and safety properties

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Efficient checking of link-reversal-based concurrent systems

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