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
- 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
- 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?)
- 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
(46)- The Gibbs cloner for combinatorial optimization, counting and sampling
- Simulation relations for fault-tolerance
- Multi-buffer simulations: decidability and complexity
- Applicability of fair simulation
- Automata on infinite trees
- Bisimulation maps in presheaf categories
- A survey of partial-observation stochastic parity games
- Matching in security-by-contract for mobile code
- Bridging the gap between fair simulation and trace inclusion
- Splitting forward simulations to cope with liveness
- Fair testing and stubborn sets
- Büchi automata can have smaller quotients
- Graph Games and Reactive Synthesis
- Fair play for machines
- Latticed Simulation Relations and Games
- Latticed simulation relations and games
- A survey of stochastic -regular games
- scientific article; zbMATH DE number 1332671 (Why is no real title available?)
- scientific article; zbMATH DE number 2080063 (Why is no real title available?)
- scientific article; zbMATH DE number 1538045 (Why is no real title available?)
- Faster algorithms for alternating refinement relations
- scientific article; zbMATH DE number 2086521 (Why is no real title available?)
- Model-checking process equivalences
- scientific article; zbMATH DE number 1903384 (Why is no real title available?)
- Obligation Blackwell games and p-automata
- Topological characterisation of multi-buffer simulation
- Canonicity in GFG and transition-based automata
- Good-for-MDPs automata for probabilistic analysis and reinforcement learning
- Minimizing GFG Transition-Based Automata
- Minimization and canonization of GFG transition-based automata
- Quantitative fair simulation games
- Fair equivalence relations
- BÜCHI COMPLEMENTATION MADE TIGHTER
- Bridging the gap between fair simulation and trace inclusion.
- Fair simulation
- Simulation relations and applications in formal methods
- History-deterministic timed automata are not determinizable
- Simulations in rank-based Büchi automata complementation
- Checking history-determinism is NP-hard for parity automata
- A hierarchy of nondeterminism
- Strategic dominance: a new preorder for nondeterministic processes
- History-determinism vs fair simulation
- An inventory-transportation system with stochastic demand
- Game-theoretic simulation checking tool
- Randomness for free
- Strategy logic
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)
