CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68460OpenAlexW1737342522MaRDI QIDQ5897508

Ron van der Meyden, Thomas Wilke

Publication date: 1 November 2006

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

Full work available at URL: https://doi.org/10.1007/11539452

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) Distributed systems (68M14)

Related Items (7)

Distributed synthesis for well-connected architectures ⋮ Observation and distinction: representing information in infinite games ⋮ Unnamed Item ⋮ On Decidability of a Logic of Gossips ⋮ Verification of multi-agent systems with public actions against strategy logic ⋮ Uniform strategies, rational relations and jumping automata ⋮ Synthesis in presence of dynamic links

This page was built for publication: CONCUR 2005 – Concurrency Theory