Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems

DOI10.1007/978-3-030-31784-3_22zbMath1437.68128arXiv2004.10413OpenAlexW3098667402MaRDI QIDQ3297600

Jesko Hecking-Harbusch, Niklas Metzger

Publication date: 20 July 2020

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.10413

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Unnamed Item

Uses Software

• Acacia+
• Unbeast

Cites Work

• Recent advances in unfolding technique
• Petri games: synthesis of distributed systems with causal memory
• Canonical prefixes of Petri net unfoldings
• Unfoldings: A partial-order approach to model checking.
• Non-prenex QBF Solving Using Abstraction
• Distributed synthesis for acyclic architectures
• Unbeast: Symbolic Bounded Synthesis
• Encodings of Bounded Synthesis
• Automated Synthesis of Distributed Controllers
• Bounded Synthesis for Petri Games
• Bounded Synthesis
• Dynamic partial-order reduction for model checking software
• Asynchronous Games over Tree Architectures
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automated Technology for Verification and Analysis
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item