Deriving syntax and axioms for quantitative regular behaviours

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

Volumn 5710 LNCS, Issue , 2009, Pages 146-162

  Bonchi, Filippo ^b   Bonsangue, Marcello ^a,b   Rutten, Jan ^b,c   Silva, Alexandra ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b CWI   (Netherlands)

^c VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COALGEBRAS; COMPLETE AXIOMATIZATIONS; FUNCTORS; MOORE MACHINES; PROBABILISTIC SYSTEMS; QUANTITATIVE SYSTEMS; RATIONAL LANGUAGES; REGULAR EXPRESSIONS; TRANSITION SYSTEM;

MODEL CHECKING;

LINGUISTICS;

EID: 70349863101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04081-8_11     Document Type: Conference Paper

References (39)

1. Aceto, L., Esik, Z., Ingolfsdottir, A.: Equational axioms for probabilistic bisimilarity. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol.2422, pp. 239-253. Springer, Heidelberg (2002)
2. Baeten, J., Bergstra, J., Smolka, S.: Axiomization probabilistic processes: Acp with generative probabililties (extended abstract). In: Cleaveland [11], pp. 472-485
3. Baeten, J., Klop, J. (eds.): CONCUR 1990. LNCS, vol.458. Springer, Heidelberg (1990)
4. Bandini, E., Segala, R.: Axiomatizations for probabilistic bisimulation. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.2076, pp. 370-381. Springer, Heidelberg (2001)
5. Bartels, F., Sokolova, A., de Vink, E.: A hierarchy of probabilistic system types. TCS 327(1-2), 3-22 (2004)
6. Bonchi, F., Bonsangue, M., Rutten, J., Silva, A.: Deriving syntax and axioms for quantitative regular behaviours. CWI technical report (2009)
7. Bonsangue, M., Rutten, J., Silva, A.: An algebra for Kripke polynomial coalgebras. In: LICS (to appear, 2009)
8. Brzozowski, J.:Derivatives of regular expressions. Journal of the ACM 11(4), 481-494 (1964)
9. Buchholz, P.: Bisimulation relations for weighted automata. TCS 393(1-3), 109-123 (2008)
10. Buchholz, P., Kemper, P.: Quantifying the dynamic behavior of process algebras. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol.2165, pp. 184-199. Springer, Heidelberg (2001)
11. Cleaveland, R. (ed.): CONCUR 1992. LNCS, vol.630. Springer, Heidelberg (1992)
12. D'Argenio, P., Hermanns, H., Katoen, J.-P.: On generative parallel composition. ENTCS 22 (1999)
13. Deng, Y., Palamidessi, C.: Axiomatizations for Probabilistic Finite-State Behaviors. In: Sassone,V. (ed.) FOSSACS 2005.LNCS, vol.3441, pp. 110-124. Springer,Heidelberg (2005)
14. Deng, Y., Palamidessi, C., Pang, J.: Compositional reasoning for probabilistic finite-state behaviors. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.3838, pp. 309-337. Springer, Heidelberg (2005) (Pubitemid 350259093)
15. Droste, M., Gastin, P.: Weighted Automata and Weighted Logics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.3580, pp. 513-525. Springer, Heidelberg (2005)
16. Giacalone, A., Jou, C., Smolka, S.: Algebraic reasoning for probabilistic concurrent systems. In: Broy, Jones (eds.) Proc. of IFIP TC 2 (1990)
17. Gumm, H., Schroder, T.: Monoid-labeled transition systems. ENTCS 44(1) (2001)
18. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Form. Asp. Comp. 6(5), 512-535 (1994)
19. Jacobs, B.: Many-sorted coalgebraic modal logic: A model-theoretic study. ITA 35(1), 31-59 (2001)
20. Jacobs, B.: A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol.4060, pp. 375-404. Springer, Heidelberg (2006)
21. Jou, C., Smolka, S.: Equivalences, congruences, and complete axiomatizations for probabilistic processes. In: Baeten, Klop [3], pp. 367-383
22. Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies, 3-42 (1956)
23. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. In: Logic in Computer Science, pp. 214-225 (1991)
24. Larsen, K., Skou, A.:Bisimulation through probabilistic testing. Inf. Comp. 94(1), 1-28 (1991)
25. Larsen, K., Skou, A.: Compositional verification of probabilistic processes. In: Cleaveland [11], pp. 456-471
26. Milner, R.: A complete inference system for a class of regular behaviours. J. Comp. Syst. Sci. 28(3), 439-466 (1984)
27. Mislove, M., Ouaknine, J., Worrell, J.: Axioms for probability and nondeterminism. ENTCS 96, 7-28 (2004)
28. Pnueli, A., Zuck, L.: Probabilistic verification by tableaux. In: LICS, pp. 322-331. IEEE, Los Alamitos (1986)
29. Rabin, M.: Probabilistic automata. Information and Control 6(3), 230-245 (1963)
30. Roßiger, M.: Coalgebras and modal logic. ENTCS 33 (2000)
31. Rutten, J.: Universal coalgebra: A theory of systems. TCS 249(1), 3-80 (2000)
32. Salomaa, A.: Two complete axiom systems for the algebra of regular events. J. ACM 13(1), 158-169 (1966)
33. Schutzenberger, M.: On the definition of a family of automata. Information and Control 4(2-3), 245-270 (1961)
34. Segala, R.: Modeling and verification of randomized distributed real-time systems. PhD thesis, MIT (1995)
35. Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.836, pp. 481-496. Springer, Heidelberg (1994)
36. Smolka, S., Steffen, B.: Priority as extremal probability. In: Baeten, Klop [3], pp. 456-466
37. Stark, E., Smolka, S.: A complete axiom system for finite-state probabilistic processes. In: Plotkin, et al. (eds.) Proof, Language, and Interaction, pp. 571-596. MIT Press, Cambridge (2000)
38. van Glabbeek, R., Smolka, S., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Inf. Comput. 121(1), 59-80 (1995)
39. Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In: FOCS, pp. 327-338. IEEE, Los Alamitos (1985)