Symbolic Methods for the State Space Exploration of GSPN Models

DOI10.1007/3-540-46029-2_12MaRDI QIDQ4738777zbMATH OpenOpenAlexFDO

Authors Ian Davies, William J. Knottenbelt, Pieter Kritzinger

Publication date 11 August 2004

Published in Computer Performance Evaluation: Modelling Techniques and Tools (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46029-2_12

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A distributed algorithm for GSPN reachability graph generation
• scientific article; zbMATH DE number 1324664
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• scientific article; zbMATH DE number 19255
• scientific article; zbMATH DE number 1507203

Cited in

(4)

• scientific article; zbMATH DE number 1701768 (Why is no real title available?)
• A symbolic out-of-core solution method for Markov models
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• A distributed algorithm for GSPN reachability graph generation

This page was built for publication: Symbolic Methods for the State Space Exploration of GSPN Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738777)