Towards state space reduction based on T-lumpability-consistent relations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5261 LNCS, Issue , 2008, Pages 64-78

  Bernardo, Marco ^a  

^a UNIVERSITY OF URBINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AGGREGATION ALGORITHMS; AXIOMATIZATION; BEHAVIORAL EQUIVALENCE; BISIMILARITY; EXACT RELATIONS; LUMPABILITY; STATE-SPACE REDUCTION; TRACE EQUIVALENCE;

TECHNICAL PRESENTATIONS;

EID: 70350524920     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87412-6_6     Document Type: Conference Paper

References (8)

1. Bernardo, M.: "Non-Bisimulation-Based Markovian Behavioral Equivalences". Journal of Logic and Algebraic Programming 72, 3-49 (2007)
2. Bernardo, M.: A Survey of Markovian Behavioral Equivalences. In: Bernardo, M., Hillston, J. (eds.) SFM 2007. LNCS, vol. 4486, pp. 180-219. Springer, Heidelberg (2007)
3. Buchholz, P.: Exact and Ordinary Lumpability in Finite Markov Chains. Journal of Applied Probability 31, 59-75 (1994)
4. Cleaveland, R., Hennessy, M.: Testing Equivalence as a Bisimulation Equivalence. Formal Aspects of Computing 5, 1-20 (1993)
5. Derisavi, S., Hermanns, H., Sanders, W.H.: Optimal State-Space Lumping in Markov Chains. Information Processing Letters 87, 309-315 (2003)
6. Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)
7. Paige, R., Tarjan, R.E.: Three Partition Refinement Algorithms. SIAM Journal on Computing 16, 973-989 (1987)
8. Wolf, V., Baier, C., Majster-Cederbaum, M.: Trace Machines for Observing Continuous-Time Markov Chains. In: Proc.of the 3rd Int. Workshop on Quantitative Aspects of Programming Languages (QAPL 2005), Edinburgh, UK. ENTCS, vol. 153(2), pp. 259-277 (2005)