swMATH1544MaRDI QIDQ14250FDOQ14250
Author name not available (Why is that?)
Official website: http://depend.cs.uni-sb.de/index.php?id=278
Cited In (61)
- PTGTSs
- A theory of stochastic systems. II: Process algebra
- Compositional design of stochastic timed automata
- Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe-construction
- Tweaking the odds in probabilistic timed automata
- Transient analysis of hierarchical semi-Markov process models with tool support in Stateflow
- Model checking probabilistic systems
- Superposition-based analysis of first-order probabilistic timed automata
- Dependability analysis of the data communication system in train control system
- A compositional translation of timed automata with deadlines to Uppaal timed automata
- Extending Timed Process Algebra with Discrete Stochastic Time
- Validation of Stochastic Systems
- A compositional modelling and analysis framework for stochastic hybrid systems
- Formal techniques for performance analysis: blending SAN and PEPA
- Revisiting sequential composition in process calculi
- Out of control: reducing probabilistic models by control-state elimination
- Model checking duration calculus: a practical approach
- TimeNET
- SPADES
- E-LOTOS
- LOTOS
- HOL/SPIN
- MOTOR
- SHARPE
- PEPS
- POMDP
- IF-2.0
- LiQuor
- ProbDiVinE
- PASS
- MarCaSPiS
- Fiacre
- mctau
- DSPNexpress
- Augur 2
- Storm
- IDLVALID
- FAUST2
- UPPAAL CORA
- HyPro
- AODV
- A linear process-algebraic format with data for probabilistic automata
- Performance evaluation of distributed systems based on a discrete real- and stochastic-time process algebra
- AMYTISS
- Jani
- StocHy
- Model checking for probabilistic timed automata
- SMP-tool
- Reconciling urgency and variable abstraction in a hybrid compositional setting
- PAYNT
- StocHy - automated verification and synthesis of stochastic processes
- Model-checking timed automata with deadlines with Uppaal
- Reconciling real and stochastic time: the need for probabilistic refinement
- CONCUR 2005 – Concurrency Theory
- Bisimulations for non-deterministic labelled Markov processes
- Title not available (Why is that?)
- Möbius
- Hybrid Systems: Computation and Control
- A survey of Markovian behavioral equivalences
- Bisimulation of labelled state-to-function transition systems coalgebraically
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
This page was built for software: MoDeST
