CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMATH Open1134.68460OpenAlexW1737342522MaRDI QIDQ5897508FDOQ5897508

Authors: 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

Recommendations

• Logic for Programming, Artificial Intelligence, and Reasoning
• Knowledge-based synthesis of distributed systems using event structures
• SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS
• Automated Technology for Verification and Analysis
• Distributed Synthesis for Alternating-Time Logics

Mathematics Subject Classification ID

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

Cited In (10)

• Uniform strategies, rational relations and jumping automata
• Synthesis in presence of dynamic links
• Distributed synthesis for well-connected architectures
• Title not available (Why is that?)
• On decidability of a logic of gossips
• Knowledge-based synthesis of distributed systems using event structures
• Logic for Programming, Artificial Intelligence, and Reasoning
• Title not available (Why is that?)
• Verification of multi-agent systems with public actions against strategy logic
• Observation and distinction: representing information in infinite games

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

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