A Semantics for Every GSPN

DOI10.1007/978-3-642-38697-8_6zbMath1381.68199OpenAlexW78405526WikidataQ57800959 ScholiaQ57800959MaRDI QIDQ5300867

Christian Eisentraut, Holger Hermanns, Li-jun Zhang, Joost-Pieter Katoen

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

zbMATH Keywords

semanticscontinuous-time Markov chainsconfusion(weak) bisimulationstochastic netstimed nets

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (13)

Unnamed Item ⋮ Markov automata with multiple objectives ⋮ Cost vs. time in stochastic games and Markov automata ⋮ Probabilistic bisimulation for realistic schedulers ⋮ Computing Behavioral Relations for Probabilistic Concurrent Systems ⋮ On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets ⋮ Confluence reduction for Markov automata ⋮ Identity-Based Cryptosystems and Quadratic Residuosity ⋮ Bayesian network semantics for Petri nets ⋮ Probabilistic Bisimulation for Realistic Schedulers ⋮ Multi-objective optimization of long-run average and total rewards ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive Markov chains. And the quest for quantified quality
• Weak bisimulation is sound and complete for pCTL\(^*\)
• Comparative branching-time semantics for Markov chains
• Axiomatising divergence
• Efficient Modelling and Generation of Markov Automata
• Introduction to Generalized Stochastic Petri Nets
• Testing Finitary Probabilistic Processes
• Model Checking Interactive Markov Chains
• Concurrency and Composition in a Stochastic World
• An Analysis of Stochastic Shortest Path Problems
• Exact and ordinary lumpability in finite Markov chains
• A Compositional Approach to Performance Modelling

This page was built for publication: A Semantics for Every GSPN