Bounded Synthesis for Petri Games

DOI10.1007/978-3-319-23506-6_15zbMath1443.68110OpenAlexW2295266152MaRDI QIDQ3449635

Bernd Finkbeiner

Publication date: 4 November 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-23506-6_15

Mathematics Subject Classification ID

Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

The synthesis problem for repeatedly communicating Petri games, Solving high-level Petri games, High-level representation of benchmark families for Petri games, Unnamed Item, Tableaux for realizability of safety specifications, Unnamed Item, Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems, Encodings of Bounded Synthesis, From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata, Petri games: synthesis of distributed systems with causal memory, Unnamed Item

Uses Software

• DepQBF

Cites Work

• Bounded Synthesis
• Asynchronous Games over Tree Architectures
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automated Technology for Verification and Analysis
• Solving Sequential Conditions by Finite-State Strategies
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item