scientific article; zbMATH DE number 7089067
From MaRDI portal
Publication:5227517
Publication date: 6 August 2019
Full work available at URL: https://arxiv.org/abs/1809.11013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Verification of population protocols
- Algebras and combinators
- 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
- Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
- Infinite Synchronizing Words for Probabilistic Automata
- 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
- The Last Mathematician from Hilbert's Göttingen: Saunders Mac Lane as Philosopher of Mathematics
- Reasoning about systems with many processes
- Hilbert's Twenty-Fourth Problem
- Parameterised Model Checking for Alternating-Time Temporal Logic.
- Lambda terms for natural deduction, sequent calculus and cut elimination
- Deciding parity games in quasipolynomial time
- Limit Synchronization in Markov Decision Processes
- Computation in networks of passively mobile finite-state sensors
This page was built for publication:
