@article{ITA_1999__33_4-5_447_0,
author = {Corradini, Flavio and De Nicola, Rocco and Labella, Anna},
title = {A finite axiomatization of nondeterministic regular expressions},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {447--465},
publisher = {EDP-Sciences},
volume = {33},
number = {4-5},
year = {1999},
mrnumber = {1748666},
zbl = {0945.68122},
language = {en},
url = {http://archive.numdam.org/item/ITA_1999__33_4-5_447_0/}
}
TY - JOUR AU - Corradini, Flavio AU - De Nicola, Rocco AU - Labella, Anna TI - A finite axiomatization of nondeterministic regular expressions JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1999 SP - 447 EP - 465 VL - 33 IS - 4-5 PB - EDP-Sciences UR - http://archive.numdam.org/item/ITA_1999__33_4-5_447_0/ LA - en ID - ITA_1999__33_4-5_447_0 ER -
%0 Journal Article %A Corradini, Flavio %A De Nicola, Rocco %A Labella, Anna %T A finite axiomatization of nondeterministic regular expressions %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1999 %P 447-465 %V 33 %N 4-5 %I EDP-Sciences %U http://archive.numdam.org/item/ITA_1999__33_4-5_447_0/ %G en %F ITA_1999__33_4-5_447_0
Corradini, Flavio; De Nicola, Rocco; Labella, Anna. A finite axiomatization of nondeterministic regular expressions. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 4-5, pp. 447-465. http://archive.numdam.org/item/ITA_1999__33_4-5_447_0/
[1] and , An Equational Axiomatization for multi-exit iteration. Inform. and Comput. 134 (1997) 121-158. | MR | Zbl
[2] , , and , Axiomatizing prefix iteration with silent steps. Inform. and Comput 127 (1996) 26-40. | MR | Zbl
[3] , and , A managerie of non-finitely based process semantics over BPA*: From ready simulation to completed traces. Research Report, BRICS, RS-96-23 (1996).
[4] and , Process Algebra with a Zero Object, in Proc. of Concu'90. Springer, Lecture Notes in Comput Sci. 458 (1990) 83-98. | MR
[5] , , and , Equational theories of relations and regular sets, in Proc. of Words, Languages and Combinatorics, Kyoto, 1992. Word Scientific, (1994) 40-48. | MR | Zbl
[6] and , Iteration Algebras of Finite State Process Behaviours. Manuscript.
[7] , and , Iteration theories of synchronization trees. Inform. and Comput. 102 (1993) 1-55. | MR | Zbl
[8] , Une remarque sur les systèmes complets d'identités rationelles. Theoret. Informatics Appl. 24 (1990) 419-423. | Numdam | MR | Zbl
[9] , Regular Algebra and Finite Machines. Chapman and Hall, London (1971). | Zbl
[10] , and , Fully Abstract Models for Nondeterministic Regular Expressions, in Proc. of Concur'95. Springer Verlag, Lecture Notes in Comput. Sci. 962 (1995) 130-144.
[11] , and , Models of Nondeterministic Regular Expressions. J. Comput. System Sci., to appear. | MR | Zbl
[12] and , Tree Morphisms and Bisimulations, in Proc. of MFCS'98 Workshop on Concurrency. Elsevier, Amsterdam, Electron. Notes Theoret. Comput. Sci. 18 (1998). | MR
[13] and , A Completeness Theorem for Nondeterministic Kleene Algebras, in Proc. of MFCS'94. Springer, Lecture Notes in Comput. Sci. 841 (1994) 536-545.
[14] , A complete equational axiomatization for prefix iteration. Inform. Process. Lett. 52 (1994) 333-337. | MR | Zbl
[15] , On the completeness of the Equations for the Kleene Star in Bisimulation, in Proc. of AMAST'96. Springer, Lecture Notes in Comput. Sci. 1101 (1996) 180-194. | MR | Zbl
[16] , Axiomatizations for the perpetual loop in Process Algebras, in Proc. of ICALP'97. Springer, Lecture Notes in Comput. Sci. 1256 (1997) 571-581. | MR
[17] and , Basic process algebra with iteration: Completeness of its equational axioms. Comput. J. 37 (1994) 259-267.
[18] , Communicating Sequential Processes. Prentice Hall (1989). | Zbl
[19] , Representation of Events in Nerve Nets and Finite Automata, in Automata Studies, Shannon and McCarthy, Ed. Princeton Univ. Pr. (1956) 3-41. | MR
[20] and , Enriched Categorical Semantics for Distributed Calculi. J. Pure Appl. Algebra 83 (1992) 295-321. | MR | Zbl
[21] , A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. Inform. and Comput 110 (1994) 366-390. | MR | Zbl
[22] , Complete Systems of B-rational identities. Theoret. Comput. Sci. 89 (1991) 207-343. | MR | Zbl
[23] and , Semirings, Automata, Languages. Springer, Berlin, Monogr. Theoret. Comput. Sci. EATCS Ser. 5 (1986). | MR | Zbl
[24] , A Calculus of Communicating Systems. Springer-Verlag, Berlin, Lecture Notes in Comput. Sci. 94 (1980). | MR | Zbl
[25] , A complete inference System for a class of regular behaviors. J. Comput. System Sci. 28 (1984) 439-466. | MR | Zbl
[26] , Communication and Concurrency. Prentice Hall (1989). | Zbl
[27] , and , An Introduction to Formal Language Theory. Springer-Verlag, Berlin (1987). | MR | Zbl
[28] , Concurrency and Automata on Infinite sequences, in Proc. GI. Springer, Lecture Notes in Comput. Sci. 104 (1981) 167-183. | Zbl
[29] , Basic Category Theory for Computer Scientists. The MIT Press (1991). | MR | Zbl
[30] , On defining relations for the algebra of regular events (Russian). Ukrain. Mat. Z. 16 (1964) 120-126. | MR
[31] , Kleene's theorem revisited, in Proc. of Trends, techniques, and problems in theoretical computer science. Springer, Lecture Notes in Comput. Sci. 281 (1986) 39-50. | MR | Zbl
[32] , Two Complete Axiom Systems for the Algebra of Regular Events. J. ACM 13 (1966) 158-169. | MR | Zbl
[33] , Bisimulation is not finitely (first order) equationally axiomatisable, in Proc. of LICS'94 (1994).
[34] and , The category-Theoretic Solution of Recursive Domain Equation. SIAM J. Comput. 11 (1982) 762-783. | MR | Zbl
[35] , Step bisimulation is pomset equivalence on a parallel language without explicit internal choice. Math. Structures Comput. Sci. 3 (1993) 25-62. | MR | Zbl
