A semantics for every GSPN
DOI10.1007/978-3-642-38697-8_6zbMATH Open1381.68199OpenAlexW78405526WikidataQ57800959 ScholiaQ57800959MaRDI QIDQ5300867FDOQ5300867
Authors: Christian Eisentraut, Holger Hermanns, Joost-Pieter Katoen, Lijun Zhang 
Publication date: 28 June 2013
Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38697-8_6
Recommendations
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Model Checking Interactive Markov Chains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interactive Markov chains. And the quest for quantified quality
- Exact and ordinary lumpability in finite Markov chains
- A Compositional Approach to Performance Modelling
- Concurrency and composition in a stochastic world
- An Analysis of Stochastic Shortest Path Problems
- Comparative branching-time semantics for Markov chains
- Introduction to generalized stochastic Petri nets
- Title not available (Why is that?)
- Weak bisimulation is sound and complete for pCTL\(^*\)
- Efficient modelling and generation of Markov automata
- Testing Finitary Probabilistic Processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Axiomatising divergence
Cited In (17)
- Expressing and computing passage time measures of GSPN models with HASL
- Title not available (Why is that?)
- 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
- The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
- One net fits all. A unifying semantics of dynamic fault trees using GSPNs
- 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 modest Markov automata tutorial
- A complete axiomatic semantics of spawning
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)
