scientific article; zbMATH DE number 7204929

DOI10.4230/LIPIcs.CONCUR.2017.12zbMath1437.68175arXiv1707.02058MaRDI QIDQ5111624

Blaise Genest, Nathalie Bertrand, Hugo Gimbert, Miheer Dewaskar

Publication date: 27 May 2020

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

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

zbMATH Keywords

controlmodel-checkingparametric systems

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Agent technology and artificial intelligence (68T42) Multi-agent systems (93A16)

Related Items (7)

Controlling a random population ⋮ Unnamed Item ⋮ Expressive Power of Broadcast Consensus Protocols ⋮ Running time analysis of broadcast consensus protocols ⋮ The complexity of synchronizing Markov decision processes ⋮ Unnamed Item ⋮ Bounds for synchronizing Markov decision processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parameterised verification for multi-agent systems
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Games for synthesis of controllers with partial observation.
• Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
• Model checking of systems with many identical timed processes
• Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
• Infinite Synchronizing Words for Probabilistic Automata
• On the Verification of Timed Ad Hoc Networks
• Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
• Synchronizing Automata and the Černý Conjecture
• Reachability Games on Extended Vector Addition Systems with States
• Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
• Reasoning about systems with many processes
• Deciding parity games in quasipolynomial time
• Verification of Population Protocols
• Limit Synchronization in Markov Decision Processes
• Playing with Probabilities in Reconfigurable Broadcast Networks
• Computation in networks of passively mobile finite-state sensors

This page was built for publication: