Parameterized verification of many identical probabilistic timed processes
From MaRDI portal
Recommendations
- Formal Modeling and Analysis of Timed Systems
- Parameterized verification of time-sensitive models of ad hoc network protocols
- Parameterized model checking of networks of timed automata with Boolean guards
- Model checking and abstraction to the aid of parameterized systems (a survey)
- Liveness of parameterized timed networks
Cited in
(14)- Verification of multiprocess probabilistic protocols
- Parameterized verification of coverability in infinite state broadcast networks
- A counter abstraction technique for verifying properties of probabilistic swarm systems
- Fair termination for parameterized probabilistic concurrent systems
- Parameterized verification of coverability in well-structured broadcast networks
- scientific article; zbMATH DE number 1512608 (Why is no real title available?)
- scientific article; zbMATH DE number 7471686 (Why is no real title available?)
- Controlling a population
- Consistency for parametric interval Markov chains
- Verification of randomized consensus algorithms under round-rigid adversaries
- Formal Modeling and Analysis of Timed Systems
- Parameterized analysis of reconfigurable broadcast networks
- Reconfigurable broadcast networks and asynchronous shared-memory systems are equivalent
- Parameterized model-checking of discrete-timed networks and symmetric-broadcast systems
This page was built for publication: Parameterized verification of many identical probabilistic timed processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963938)
