Tools and Algorithms for the Construction and Analysis of Systems
From MaRDI portal
(Redirected from Tools and Algorithms for the Construction and Analysis of Systems)
Tools and Algorithms for the Construction and Analysis of Systems (scientific article; zbMATH DE number 2227828)
Tools and Algorithms for the Construction and Analysis of Systems (scientific article; zbMATH DE number 2227828)
Recommendations
Cited in
(24)- Memory-efficient tactics for randomized LTL model checking
- On minimising the maximum expected verification time
- Uniform sampling for timed automata with application to language inclusion measurement
- Statistical model checking for variability-intensive systems: applications to bug detection and minimization
- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
- Bayesian statistical model checking with application to Stateflow/Simulink verification
- A maximal entropy stochastic process for a timed automaton
- Monte Carlo tableau proof search
- Probabilistic verification and approximation
- Statistical probabilistic model checking with a focus on time-bounded properties
- Formal Verification Based on Guided Random Walks
- Beyond series-parallel concurrent systems: the case of arch processes
- Statistical Model Checking for Variability-Intensive Systems
- Quantitative and algorithmic aspects of barrier synchronization in concurrency
- scientific article; zbMATH DE number 7204953 (Why is no real title available?)
- Evaluating complex MAC protocols for sensor networks with APMC
- Meanings of model checking
- Monte Carlo methods for process algebra
- Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement
- Model Checking-Based Genetic Programming with an Application to Mutual Exclusion
- The Combinatorics of Barrier Synchronization
- Proving Non-inclusion of Büchi Automata Based on Monte Carlo Sampling
- Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
- A quantitative study of pure parallel processes
This page was built for publication: Tools and Algorithms for the Construction and Analysis of Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703764)