Bisimulation relations for weighted automata

Theoretical Computer Science

Volumn 393, Issue 1-3, 2008, Pages 109-123

  Buchholz, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Aggregation; Bisimulation; Congruence; Equivalence; Finite automata; Weighted automata

Indexed keywords

COMPUTER SIMULATION; EQUIVALENCE CLASSES; PROBABILISTIC LOGICS; PROBLEM SOLVING; STOCHASTIC MODELS;

BACKWARD BISIMULATION; BISIMULATION; STOCHASTIC SYSTEMS; WEIGHTED AUTOMATA;

FINITE AUTOMATA;

EID: 39749154241     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.11.018     Document Type: Article

References (44)

1. Ajmone-Marsan M., Balbo G., and Conte G. A class of generalized stochastic Petri nets for performance evaluation of multiprocessor systems. ACM Transactions on Computer Systems 2 2 (1984) 93-122
2. Aziz A., Sanwal K., Singhai V., and Brayton R. Verifying continuous time Markov chains. Computer Aided Verification'97. LNCS vol. 1102 (1997), Springer 269-278
3. Baccelli F., Cohen G., Olsder G., and Quadrat J. Synchronization and Linearity (1992), John Wiley and Sons
4. Baier C., Engelen B., and Majster-Cederbaum M. Deciding bisimilarity and similarity for probabilistic processes. Journal of Computer and System Sciences 60 1 (2000) 187-231
5. Baier C., Haverkort B., Hermanns H., and Katoen J.P. Model checking algorithms for continuous time Markov chains. IEEE Transactions on Software Engineering 29 7 (2003) 524-541
6. Bloom S.L., and Esik Z. Iteration theories. EATCS Monographs on Theoretical Computer Science (1993), Springer
7. Blute R., Deshrnais J., Edalat A., and Panangaden R. Bisimulation for labelled Markov processes. 12th Annual IEEE Symposium on Logic in Computer Science (1997), IEEE CS Press 149-158
8. Buchholz P. Markovian process algebra: composition and equivalence. In: Herzog U., and Rettelbach M. (Eds). Proc. of the 2nd Work. on Process Algebras and Performance Modelling. Arbeitsberichte des IMMD vol. 27 (1994), University of Erlangen 11-30
9. Buchholz P. Equivalence relations for stochastic automata networks. In: Stewart W.J. (Ed). Computations with Markov Chains (1995), Kluwer Academic Publishers 197-216
10. Buchholz P. A notion of equivalence for stochastic Petri nets. In: De Michelis G., and Diaz M. (Eds). Application and Theory of Petri Nets 1995. LNCS vol. 935 (1995), Springer 161-180
11. Buchholz P. Exact performance equivalence - an equivalence relation for stochastic automata. Theoretical Computer Science 215 1-2 (1999) 263-287
12. Buchholz P. Hierarchical structuring of superposed GSPNs. IEEE Transactions on Software Engineering 25 2 (1999) 166-181
13. Buchholz P. Efficient computation of equivalent and reduced representations for stochastic automata. Int. Journ. Computer Systems Science and Engineering 15 2 (2000) 93-103
14. Buchholz P., and Kemper P. Quantifying the dynamic behavior of process algebras. In: de Alfaro L., and Gilmore S. (Eds). Process Algebras and Probabilistic Methods. LNCS vol. 2165 (2001), Springer 184-199
15. Buchholz P., and Kemper P. Efficient computation and representation of large reachability sets for composed automata. Discrete Event Dynamic Systems Theory and Applications 12 3 (2002) 265-286
16. Buchholz P., and Kemper P. Weak bisimulation for (max/+) automata and related models. Journal of Automata, Languages and Combinatorics 8 2 (2003) 187-218
17. P. Buchholz, P. Kemper, Model checking for automata with transition costs, (2006) (submitted for publication)
18. Ciardo G., Miner A.S., and Donatelli S. Using the exact state space of a model to compute approximate stationary measures. In: Kurose J., and Nain P. (Eds). Proc. ACM Sigmetrics (2000), ACM Press 207-216
19. Cleaveland R., Parrow J., and Steffen B. The concurrency workbench: A semantics based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems 15 1 (1993) 36-72
20. de~Vink E.P., and Rutten J.J.M.M. Bisimulation for probabilistic transition systems: A coalgebraic approach. In: Degano P., Gorrieri R., and Marchetti-Spaccamela A. (Eds). Proc. ICALP'97. LNCS vol. 1256 (1997), Springer 460-470
21. Derisavi S., Hermanns H., and Sanders W.H. Optimal state space lumping in Markov chains. Information Processing Letters 54 2 (2003) 309-315
22. Desharnais J., Edalat A., and Panangaden R. Bisimulation for labelled Markov processes. Information and Computation 179 2 (2002) 163-193
23. Eilenberg S. Automata, Languages and Machines Part A. Pure and Applied Mathematics: A Series of Monographs and Textbook vol. 58 (1974), Academic Press
24. Gaubert S. Performance evaluation of (max/+) automata. IEEE Transactions on Automatic Control 40 12 (1995) 2014-2025
25. Graf S., Steffen B., and Lüttgen G. Compositional minimization of finite state systems. Formal Aspects of Computing 8 5 (1996) 607-616
26. Hennessy M.C., and Milner R. Algebraic laws for non-determinism and concurrency. Journal of the ACM 32 (1985) 137-161
27. Hermanns H., Herzog U., and Mertsiotakis V. Stochastic process algebras - between LOTOS and Markov chains. Computer Networks and ISDN Systems 30 9-10 (1998) 901-924
28. Hermanns H., and Rettelbach M. Syntax, semantics, equivalences, and axioms for MTIPP. In: Herzog U., and Rettelbach M. (Eds). Proc. of the 2nd Work. on Process Algebras and Performance Modelling. Arbeitsberichte des IMMD vol. 27 (1994), University of Erlangen
29. J. Hillston, A compositional approach for performance modelling. Ph.D. Thesis, University of Edinburgh, Dep. of Comp. Sc., 1994
30. Hillston J. The nature of synchronization. In: Herzog U., and Rettelbach M. (Eds). Proc. of the 2nd Workshop on Process Algebra and Performance Modeling. Arbeitsberichte des IMMD vol. 27 (1994), University of Erlangen 51-70
31. Hillston J. Compositional Markovian modelling using a process algebra. In: Stewart W.J. (Ed). Computations with Markov Chains (1995), Kluwer Academic Publishers 177-196
32. Jou C.C., and Smolka S. Equivalences, congruences and complete axiomatizations for probabilistic processes. In: Baeten J.C.M., and Klop J.W. (Eds). Proc. CONCUR'90. LNCS vol. 458 (1990), Springer 367-383
33. Kemeny J.G., and Snell J.L. Finite Markov Chains (1976), Springer
34. Kuich W., and Salomaa A. Semirings, Automata, Languages. ETACS Monographs on Theoretical Computer Science (1986), Springer
35. Larsen K., and Skou A. Bisimulation through probabilistic testing. Information and Computation 94 (1991) 1-28
36. J. Ledoux, Weak lumpability of finite Markov chains and positive invariance of cones, Technical Report RR-2801, INRIA, 1996
37. Milner R. Communication and Concurrency (1989), Prentice Hall
38. Paige R., and Tarjan R.E. Three partition refinement algorithms. SIAM Journal on Computing 16 6 (1987) 973-989
39. Park D. Concurrency and automata on infinite sequences. Proc. 5th GI Conference on Theoretical Computer Science. LNCS vol. 104 (1981), Springer 167-183
40. Plateau B. On the stochastic structure of parallelism and synchronisation models for distributed algorithms. ACM Performance Evaluation Review 13 (1985) 142-154
41. Sproston J., and Donatelli S. Backward stochastic bisimulation in CSL model checking. Proc. 1st Int. Conf. on the Quant. Eval. of Sys. (QEST'04) (2004), IEEE CS Press 220-229
42. Stark E.W. On behavior equivalence for probabilistic I/O automata and its relation to probabilistic bisimulation. Journal of Automata, Languages and Combinatorics 8 2 (2003) 361-396
43. Stewart W.J. Introduction to the Numerical Solution of Markov Chains (1994), Princeton University Press
44. R. van Glabbek, S. Smolka, B. Steffen, C. Tofts, Reactive, generative and stratified models for probabilistic processes, in: Proc. LICS'90, 1990, pp. 130-141