scientific article; zbMATH DE number 7471672
From MaRDI portal
Publication:5028432
Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/1911.01195
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Markov decision processesgamespopulation protocolsparameterized verificationregular cost functionsparameterized synthesis
Cites Work
- Unnamed Item
- The residue of vector sets with applications to decidability problems in Petri nets
- Automata, logics, and infinite games. A guide to current research
- Controlling a random population
- The theory of well-quasi-ordering: a frequently discovered concept
- Regular Cost Functions, Part I: Logic and Algebra over Words
- Two Recursively Inseparable Problems for Probabilistic Automata
- Maximal Flow Through a Network
- Eager Markov Chains
- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
- Reasoning about systems with many processes
- Distance desert automata and the star height problem
- Parameterized Verification of Infinite-State Processes with Global Conditions
- Ordering by Divisibility in Abstract Algebras
This page was built for publication:
