Model-checking infinite state-space systems with fine-grained abstractions using SPIN
From MaRDI portal
Recommendations
Cited in
(17)- Latticed-LTL synthesis in the presence of noisy inputs
- Weighted automata
- Computation tree logic model checking based on multi-valued possibility measures
- Beyond vacuity: towards the strongest passing formula
- Model checking of linear-time properties in multi-valued systems
- Inherent vacuity in lattice automata
- Latticed Simulation Relations and Games
- Don't know for multi-valued systems
- Multi-valued model checking games
- Linear temporal logic symbolic model checking
- Model Checking Quantitative Linear Time Logic
- Lattice Automata
- Formal verification of three-valued digital waveforms
- Minimizing deterministic lattice automata
- An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information
- Robustness of temporal logic specifications for continuous-time signals
- Weighted automata and multi-valued logics over arbitrary bounded lattices
This page was built for publication: Model-checking infinite state-space systems with fine-grained abstractions using SPIN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4531751)