Measuring concurrency of regular distributed computations

DOI10.1007/3-540-59293-8_230zbMath1496.68147OpenAlexW1511348715MaRDI QIDQ5096760

René Thoraval, Claude Jard, Cyrille Bareau, Benoît Caillaud

Publication date: 18 August 2022

Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59293-8_230

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Time, clocks, and the ordering of events in a distributed system
• On-line computations of the ideal lattice of posets
• Reachability analysis on distributed executions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Measuring concurrency of regular distributed computations