The following pages link to MoDeST (Q14250):
Displaying 31 items.
- A linear process-algebraic format with data for probabilistic automata (Q764285) (← links)
- Tweaking the odds in probabilistic timed automata (Q832050) (← links)
- Transient analysis of hierarchical semi-Markov process models with tool support in Stateflow (Q832061) (← links)
- Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe-construction (Q832097) (← links)
- Formal techniques for performance analysis: blending SAN and PEPA (Q877152) (← links)
- Revisiting sequential composition in process calculi (Q890611) (← links)
- Model checking duration calculus: a practical approach (Q939170) (← links)
- Dependability analysis of the data communication system in train control system (Q1047332) (← links)
- Reconciling real and stochastic time: the need for probabilistic refinement (Q1941867) (← links)
- Model-checking timed automata with deadlines with Uppaal (Q1941900) (← links)
- Out of control: reducing probabilistic models by control-state elimination (Q2152665) (← links)
- Model checking for probabilistic timed automata (Q2248072) (← links)
- A compositional modelling and analysis framework for stochastic hybrid systems (Q2248073) (← links)
- A theory of stochastic systems. II: Process algebra (Q2575855) (← links)
- A Survey of Markovian Behavioral Equivalences (Q3084590) (← links)
- Model Checking Probabilistic Systems (Q3176386) (← links)
- Bisimulations for non-deterministic labelled Markov processes (Q3225737) (← links)
- Performance Evaluation of Distributed Systems Based on a Discrete Real- and Stochastic-Time Process Algebra (Q3400551) (← links)
- Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically (Q3460420) (← links)
- Reconciling Urgency and Variable Abstraction in a Hybrid Compositional Setting (Q3588083) (← links)
- A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata (Q3648831) (← links)
- (Q4665739) (← links)
- Superposition-Based Analysis of First-Order Probabilistic Timed Automata (Q4933313) (← links)
- AMYTISS (Q5146400) (← links)
- StocHy - automated verification and synthesis of stochastic processes (Q5239247) (← links)
- Validation of Stochastic Systems (Q5325834) (← links)
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems (Q5464755) (← links)
- Extending Timed Process Algebra with Discrete Stochastic Time (Q5505429) (← links)
- Compositional Design of Stochastic Timed Automata (Q5740181) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897479) (← links)
- Hybrid Systems: Computation and Control (Q5898967) (← links)
