Reachability analysis based on structured representations

DOI10.1007/3-540-61363-3_15zbMath1418.68146OpenAlexW1591563876MaRDI QIDQ4633167

Peter Kemper

Publication date: 2 May 2019

Published in: Application and Theory of Petri Nets 1996 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61363-3_15

zbMATH Keywords

state spacecontinuous time Markov chainsuccessor statelocal transitionstructure representation

Mathematics Subject Classification ID

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 (1)

Model-checking large structured Markov chains.

Cites Work

• Unnamed Item
• Unnamed Item
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Kronecker products and shuffle algebra
• Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space
• A decomposition approach for stochastic reward net models
• Modular Analysis of Petri Nets
• A distributed algorithm for GSPN reachability graph generation

This page was built for publication: Reachability analysis based on structured representations