scientific article; zbMATH DE number 7089067
From MaRDI portal
Publication:5227517
Authors: Erwin Engeler 
Publication date: 6 August 2019
Full work available at URL: https://arxiv.org/abs/1809.11013
Title of this publication is not available (Why is that?)
Cites Work
- Reasoning about systems with many processes
- Synchronizing Automata and the Černý Conjecture
- Probabilistic automata on finite words: decidable and undecidable problems
- Algebras and combinators
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Title not available (Why is that?)
- Fixed-dimensional energy games are in pseudo-polynomial time
- Games for synthesis of controllers with partial observation.
- Hilbert's Twenty-Fourth Problem
- Computation in networks of passively mobile finite-state sensors
- Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
- Verification of population protocols
- Lambda terms for natural deduction, sequent calculus and cut elimination
- On regularity of unary probabilistic automata
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Reachability games on extended vector addition systems with states
- Deciding parity games in quasipolynomial time
- Infinite Synchronizing Words for Probabilistic Automata
- Title not available (Why is that?)
- Parameterised model checking for alternating-time temporal logic
- The Last Mathematician from Hilbert's Göttingen: Saunders Mac Lane as Philosopher of Mathematics
- Limit synchronization in Markov decision processes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227517)
