Convex lattice equation systems
DOI10.1007/978-3-031-22337-2_21zbMath1528.68206OpenAlexW4312399762MaRDI QIDQ6113988
Kim Guldstrand Larsen, Mathias Claus Jensen, Giovanni Bacci, Giorgio Bacci
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22337-2_21
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Stochastic games, stochastic differential games (91A15) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantic domains for combining probability and non-determinism
- Metrics for weighted transition systems: axiomatization and complexity
- Metrics for labelled Markov processes
- Quantitative analysis of weighted transition systems
- Bisimulation through probabilistic testing
- The complexity of stochastic games
- Complete axiomatization for the total variation distance of Markov chains
- On the distance between timed automata
- A lattice-theoretical fixpoint theorem and its applications
- Computing Behavioral Distances, Compositionally
- On the Complexity of Computing Probabilistic Bisimilarity
- CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
- LATTICED SIMULATION RELATIONS AND GAMES
- Computing Probabilistic Bisimilarity Distances via Policy Iteration
- On-the-Fly Exact Computation of Bisimilarity Distances
- Prevision Domains and Convex Powercones
- Distributing probability over non-determinism
- Stochastic Games with Perfect Information and Time Average Payoff
- Formal Modeling and Analysis of Timed Systems
- Simple linear-time algorithms for minimal fixed points
This page was built for publication: Convex lattice equation systems
