Reachability analysis on distributed executions

DOI10.1007/3-540-56610-4_94zbMath1497.68097OpenAlexW1571953574MaRDI QIDQ5044769

Claude Jard, Claire Diehl, Jean-Xavier Rampon

Publication date: 2 November 2022

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

Full work available at URL: https://doi.org/10.1007/3-540-56610-4_94

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Shared global states in distributed computations ⋮ Measuring concurrency of regular distributed computations ⋮ Faster possibility detection by combining two approaches ⋮ On-the-fly analysis of distributed computations ⋮ Efficient algorithms on distributive lattices

Cites Work

• An extended arithmetic
• Calcul des idéaux d'un ordonné fini
• Time, clocks, and the ordering of events in a distributed system
• Interval approximations of message causality in distributed executions
• Unnamed Item
• Unnamed Item

This page was built for publication: Reachability analysis on distributed executions