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

DOI10.1007/978-3-540-87412-6_6zbMath1180.68186OpenAlexW1599711819MaRDI QIDQ3543307

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

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

Related Items (1)

The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism

Cites Work

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

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