scientific article
From MaRDI portal
Publication:3384884
Publication date: 17 December 2021
Full work available at URL: https://arxiv.org/abs/1809.03099
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterized verification of synchronization in constrained reconfigurable broadcast networks
- Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
- On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks
- On the Verification of Timed Ad Hoc Networks
- On Moore Graphs with Diameters 2 and 3
- Parameterized Verification of Ad Hoc Networks
- Subgraphs and well‐quasi‐ordering
- Reasoning about systems with many processes
- Reachability in Networks of Register Protocols under Stochastic Schedulers
- Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks
- Parameterized Verification of Broadcast Networks of Register Automata
- Distributed local strategies in broadcast networks
- Playing with Probabilities in Reconfigurable Broadcast Networks
- Well-structured transition systems everywhere!
This page was built for publication: