A semantics for every GSPN
From MaRDI portal
Publication:5300867
Recommendations
Cites work
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3543391 (Why is no real title available?)
- scientific article; zbMATH DE number 1786473 (Why is no real title available?)
- scientific article; zbMATH DE number 1786479 (Why is no real title available?)
- scientific article; zbMATH DE number 763717 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A Compositional Approach to Performance Modelling
- An Analysis of Stochastic Shortest Path Problems
- Axiomatising divergence
- Comparative branching-time semantics for Markov chains
- Concurrency and composition in a stochastic world
- Efficient modelling and generation of Markov automata
- Exact and ordinary lumpability in finite Markov chains
- Interactive Markov chains. And the quest for quantified quality
- Introduction to generalized stochastic Petri nets
- Model Checking Interactive Markov Chains
- Testing Finitary Probabilistic Processes
- Weak bisimulation is sound and complete for pCTL\(^*\)
Cited in
(17)- Expressing and computing passage time measures of GSPN models with HASL
- scientific article; zbMATH DE number 7147446 (Why is no real title available?)
- Identity-Based Cryptosystems and Quadratic Residuosity
- Bayesian network semantics for Petri nets
- On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets
- Integrating TwoTowers and GreatSPN through a compact net semantics
- Multi-objective optimization of long-run average and total rewards
- Probabilistic bisimulation for realistic schedulers
- Model-based evaluation of the power versus performance of network routing algorithms
- One net fits all. A unifying semantics of dynamic fault trees using GSPNs
- The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
- Cost vs. time in stochastic games and Markov automata
- Probabilistic bisimulation for realistic schedulers
- Computing Behavioral Relations for Probabilistic Concurrent Systems
- Confluence reduction for Markov automata
- A complete axiomatic semantics of spawning
- A modest Markov automata tutorial
This page was built for publication: A semantics for every GSPN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300867)