Towards State Space Reduction Based on T-Lumpability-Consistent Relations

DOI10.1007/978-3-540-87412-6_6MaRDI QIDQ3543307zbMATH OpenOpenAlexFDO

Authors Marco Bernardo

Publication date 2 December 2008

Published in Computer Performance Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87412-6_6

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) 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

• Non-bisimulation-based Markovian behavioral equivalences
• Markovian testing and trace equivalences exactly lump more than Markovian bisimilarity
• A survey of Markovian behavioral equivalences
• Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
• Proportional lumpability

Cites work

• A survey of Markovian behavioral equivalences
• Exact and ordinary lumpability in finite Markov chains
• Non-bisimulation-based Markovian behavioral equivalences
• Optimal state-space lumping in Markov chains
• Testing equivalence as a bisimulation equivalence
• Three Partition Refinement Algorithms

Cited in

(3)

• Non-bisimulation-based Markovian behavioral equivalences
• Markovian testing and trace equivalences exactly lump more than Markovian bisimilarity
• The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism

This page was built for publication: Towards State Space Reduction Based on T-Lumpability-Consistent Relations

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