scientific article; zbMATH DE number 7278100

DOI10.4230/LIPIcs.FSTTCS.2017.28zbMath1491.68121arXiv1710.05368MaRDI QIDQ5136320

Paul Gölz, Bernd Finkbeiner

Publication date: 25 November 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Petri netsreactive synthesisdistributed informationcausal memory

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 (7)

Distributed Asynchronous Games With Causal Memory are Undecidable ⋮ The synthesis problem for repeatedly communicating Petri games ⋮ Solving high-level Petri games ⋮ High-level representation of benchmark families for Petri games ⋮ Unnamed Item ⋮ Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems ⋮ Canonical representations for direct generation of strategies in high-level Petri games

Uses Software

• Acacia+
• Unbeast

Cites Work

• Unnamed Item
• Unnamed Item
• Petri games: synthesis of distributed systems with causal memory
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Model checking using net unfoldings
• Distributed synthesis for acyclic architectures
• Unbeast: Symbolic Bounded Synthesis
• Encodings of Bounded Synthesis
• Bounded Synthesis for Petri Games
• Provably Difficult Combinatorial Games
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automated Technology for Verification and Analysis
• Solving Sequential Conditions by Finite-State Strategies

This page was built for publication: