Fair simulation
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 3919813 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- scientific article; zbMATH DE number 1538045 (Why is no real title available?)
- scientific article; zbMATH DE number 1775458 (Why is no real title available?)
- scientific article; zbMATH DE number 3339435 (Why is no real title available?)
- An algebraic theory of fair asynchronous communicating processes
- An automata-theoretic approach to branching-time model checking
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Divergence and fair testing
- Equivalences for fair Kripke structures
- Specifying Concurrent Program Modules
- The complementation problem for Büchi automata with applications to temporal logic
- The existence of refinement mappings
- Transformational design and implementation of a new efficient solution to the ready simulation problem
Cited in
(45)- Applicability of fair simulation
- A survey of stochastic -regular games
- Fair play for machines
- scientific article; zbMATH DE number 1538045 (Why is no real title available?)
- scientific article; zbMATH DE number 7577580 (Why is no real title available?)
- Latticed simulation relations and games
- Faster algorithms for alternating refinement relations
- Automata on infinite trees
- Splitting forward simulations to cope with liveness
- Fair testing and stubborn sets
- Good-for-MDPs automata for probabilistic analysis and reinforcement learning
- scientific article; zbMATH DE number 2086521 (Why is no real title available?)
- Bisimulation maps in presheaf categories
- The Gibbs cloner for combinatorial optimization, counting and sampling
- An inventory-transportation system with stochastic demand
- BÜCHI COMPLEMENTATION MADE TIGHTER
- Büchi automata can have smaller quotients
- Bridging the gap between fair simulation and trace inclusion.
- Multi-buffer simulations: decidability and complexity
- Minimizing GFG Transition-Based Automata
- scientific article; zbMATH DE number 7455749 (Why is no real title available?)
- Randomness for free
- Obligation Blackwell games and p-automata
- Graph Games and Reactive Synthesis
- Model-checking process equivalences
- Checking history-determinism is NP-hard for parity automata
- A hierarchy of nondeterminism
- Fair equivalence relations
- Game-theoretic simulation checking tool
- Matching in security-by-contract for mobile code
- Strategic dominance: a new preorder for nondeterministic processes
- History-determinism vs fair simulation
- Topological characterisation of multi-buffer simulation
- History-deterministic timed automata are not determinizable
- Simulation relations for fault-tolerance
- Latticed Simulation Relations and Games
- Strategy logic
- Bridging the gap between fair simulation and trace inclusion
- Fair simulation
- Simulation relations and applications in formal methods
- scientific article; zbMATH DE number 2080063 (Why is no real title available?)
- scientific article; zbMATH DE number 1903384 (Why is no real title available?)
- Simulations in rank-based Büchi automata complementation
- A survey of partial-observation stochastic parity games
- Quantitative fair simulation games
This page was built for publication: Fair simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854506)
