Asynchronous transition system games for two processes and their analysis

DOI10.1007/978-3-031-89610-1_5MaRDI QIDQ6889861zbMATH OpenFDO

Authors Bharat Adsul, Nehul Jain

Publication date 4 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-89610-1_5

zbMATH Keywords

concurrencygame-theoretic modelsynthesis

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites work

• Asynchronous Games over Tree Architectures
• Automata on distributed alphabets
• Automata, logics, and infinite games. A guide to current research
• Distributed Asynchronous Games With Causal Memory are Undecidable
• Distributed synthesis for acyclic architectures
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 7278100 (Why is no real title available?)
• scientific article; zbMATH DE number 7830376 (Why is no real title available?)
• Notes on finite asynchronous automata
• On the control of asynchronous automata
• Petri games: synthesis of distributed systems with causal memory
• Solution of Church's problem: a tutorial
• Translating asynchronous games for distributed synthesis

This page was built for publication: Asynchronous transition system games for two processes and their analysis

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