CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452MaRDI QIDQ5897508zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(12)

• Synthesis in presence of dynamic links
• Uniform strategies, rational relations and jumping automata
• Observation and distinction: representing information in infinite games
• On decidability of a logic of gossips
• Knowledge-based synthesis of distributed systems using event structures
• scientific article; zbMATH DE number 869756 (Why is no real title available?)
• scientific article; zbMATH DE number 7455739 (Why is no real title available?)
• Logic for Programming, Artificial Intelligence, and Reasoning
• An epistemic perspective on subjective and objective time
• Model-checking strategic abilities in information-sharing systems
• Verification of multi-agent systems with public actions against strategy logic
• Distributed synthesis for well-connected architectures

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)