List of publications (G. Stefanescu)
Monographs
[B94a].. G. Stefanescu. Algebra of flownomials, Institute for Informatics, Technical University Munich, 1994, 158pp.
[B00a].. G. Stefanescu. Network Algebra, Springer-Verlag, London Berlin Heidelberg New-York Paris Tokyo Hong-Kong Barcelona Budapest, 2000, XVI+400pp. ISBN: 1-85233-195-X
Full Papers in Refereed Journals
[J82a].. V.E. Cazanescu and G. Stefanescu. On the category of ordered algebras. Studii si Cercetari Matematice (Mathematical Reports), 34(1982), 235-252. (in Romanian).
[J82b].. G. Stefanescu. Characterisation of effective universal monomorphisms in the categories of universal algebras and algebraic systems. Studii si Cercetari Matematice (Mathematical Reports), 34(1982), 490-497. (in Romanian)
[J87a].. V.E. Cazanescu and G. Stefanescu. Some properties of pointed algebraic theories. Studii si Cercetari Matematice (Mathematical Reports), 39(1987), 107-115. (in Romanian)
[J87b].. G. Stefanescu. On flowchart theories. Part I. The deterministic case. Journal of Computer and Systems Sciences, 35(1987), 163-191.
[J87c].. G. Stefanescu. On flowchart theories. Part II. The nondeterministic case. Theoretical Computer Science, 52(1987), 307-340.
[J88a].. V.E. Cazanescu and G. Stefanescu. A formal representation of flowchart schemes. Analele Universitatii Bucuresti, Matematica-Informatica, 37(2)(1988), 33-51.
[J89a].. V.E. Cazanescu and G. Stefanescu. A formal representation of flowchart schemes - II. Studii si Cercetari Matematice (Mathematical Reports), 41(1989), 151-167.
[J90a].. V.E. Cazanescu and G. Stefanescu. Towards a new algebraic foundation of flowchart scheme theory. Fundamenta Informaticae, 13(1990), 171-210.
[J90b].. V.E. Cazanescu and G. Stefanescu. A note on axiomatizing flowchart schemes. Acta Cybernetica, 9(1990), 349-359.
[J90c].. G. Stefanescu. Feedback theories (a calculus for isomorphism classes of flowchart schemes). Revues Roumaine de Mathematiques Pures et Applique, 35(1990), 73-79.
[J91a].. V.E. Cazanescu and G. Stefanescu. Classes of finite relations as initial abstract data types - I. Discrete Mathematics, 90(1991), 233-265.
[J92a].. A. Baranga, V.E. Cazanescu and G. Stefanescu. Flow algebras. Analele Universitatii Bucuresti, Matematica-Informatica, 41(2)(1992), 21-34.
[J92b].. V.E. Cazanescu and G. Stefanescu. A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization. Theoretical Computer Science, 99(1992), 1-63. (Fundamental Study)
[J94a].. J.A. Bergstra and G. Stefanescu. Bisimulation is two-way simulation. Information Processing Letters, 52(1994), 285-287.
[J94b].. V.E. Cazanescu and G. Stefanescu. Classes of finite relations as initial abstract data types - II. Discrete Mathematics, 126(1994), 47-65.
[J95a].. S.L. Bloom, Z. Esik, and G. Stefanescu. Notes on equational theories of relations. Algebra Universalis, 33(1995), 98-126.
[J96a].. J.A. Bergstra and G. Stefanescu. Processes with multiple entries and exits modulo isomorphism and modulo bisimulation. Fundamenta Informaticae, 27(1996), 37-56.
[J97a].. J.A. Bergstra, C.A. Middelburg, and G. Stefanescu. Network algebra for synchronous and asynchronous dataflow. International Journal of Computer Mathematics, 65(1-2)(1997), 57-88.
[J98a].. J.A. Bergstra and G. Stefanescu. Network algebra with demonic relation operators. Revues Roumaine de Mathematiques Pures et Applique, 43(5-6)(1998), 503-520.
[J98b].. G. Stefanescu. Reaction and control I. Mixing additive and multiplicative network algebras. Journal of Interest Group in Pure and Applied Logic, 6(2)(1998), 349-368. (Logic Journal of the IGPL, Oxford University Press).
[J98c].. G. Stefanescu. Some examples of semiringal categories. Annals of the Bucharest University, Mathematics-Informatics Series, 47(1998), 103-108.
[J00a].. C.S. Calude and G. Stefanescu. Automata, Logic, and Computability] JUCS Special issue dedicated to Professor Sergiu Rudeanu Festschrift, Journal of Universal Computer Science, Volume 6(1)(2000), 1-2.
[J00b].. R. Grosu, D. Lucanu, and G. Stefanescu. Mixed relations as enriched semiringal categories, Journal of Universal Computer Science, 6(1)(2000), 112-129.
[J01a].. M. Broy and G. Stefanescu. The algebra of stream processing functions. Theoretical Computer Science, 258(2001), 99-129.
Full Papers in Refereed Proceedings or Collections
[C81a].. G. Stefanescu. Hierarchical recognition. In] Proceedings of the 3th Colloquium on Computer Science held at Iassy, Romania, 1981. Al.I. Cuza University Press, Iassy, 1981, 240-250. (in Romanian)
[C85a].. G. Stefanescu. On the theory of rational $\Sigma$-trees. In: Proceedings of the 5th Colloquium on Computer Science held at Iassy, Romania, 1985. Al.I. Cuza University Press, Iassy, 1985. (in Romanian)
[C86a].. G. Stefanescu. An algebraic theory of flowchart schemes. In: Proceedings 11th Colloquium on Trees in Algebra and Programming held at Nice, France, 1986. Ed. P. Franchi-Zannettacci, Lecture Notes in Computer Science 214. Springer-Verlag, Berlin, 1986, 60-73.
[C87a].. V.E. Cazanescu and G. Stefanescu. A calculus for flowchart schemes. In: Abstracts of the 8th International Cogress of Logic, Methodology and Philosophy of Science held at Moskow, USSR, 1987, Volume 1. Nauka, Moskow, 1987, 124-127.
[C87b].. V.E. Cazanescu and G. Stefanescu. Finite relations as initial abtract data types. In: Proceedings of the 6th Colloquium on Computer Science held at Iassy, Romania, 1987. Al.I. Cuza University Press, Iassy, 1987, 153-163. (in Romanian)
[C87c].. V.E. Cazanescu and G. Stefanescu. Towards a new algebraic foundation of flowchart scheme theory. In: Proceedings of the 6th Colloquium on Computer Science held at Iassy, Romania, 1987. Al.I. Cuza University Press, Iassy, 1987, 164-174. (in Romanian)
[C87d].. V.E. Cazanescu and G. Stefanescu. A calculus for program schemes. In: Proceedings of the Scientific Symposium on the Celebration of 25 Anniversary of Computer Center held at Bucharest, Romania, 1987. Bucharest Univ. Press, Bucharest, 1987, 36-41. (in Romanian)
[C88a].. V.E. Cazanescu and G. Stefanescu (1988). On some symmetric strict monoidal categories. In: Summaries of the 3th East European Category Seminar held at Predela, Bulgaria, 1988. Heigher Institute for Electrical Engineering Press, Sofia, 1988, pp. 11-12.
[C89a].. V.E. Cazanescu and G. Stefanescu. Feedback, iteration and repetition. In: Proceedings of the 7th Colloquium on Computer Science held at Iassy, Romania, 1989. Al.I. Cuza University Press, Iassy, 1989, pp. 60-69.
[C89b].. V.E. Cazanescu and G. Stefanescu. An axiom system for biflow using summation, (extended) feedbackation and identities. In: Proceedings of the 7th Colloquium on Computer Science held at Iassy, Romania, 1989. Al.I. Cuza University Press, Iassy, 1989, pp. 70-79.
[C90a].. V.E. Cazanescu and G. Stefanescu. Towards a new algebraic foundation of program scheme theory. In: Actual problems of mathematical research I. Bucharest Univ. Press, Bucharest, 1990, pp. 203-224. (in Romanian)
[C93a].. J.A. Bergstra and G. Stefanescu. Translations between flowchart schemes and process graphs. In: Proceedings of the 9th International Conference on Fundamentals of Computation Theory held at Szeged, Hungary, 1993, Ed. Z. Esik. Lecture Notes in Computer Science, 710. Springer-Verlag, Berlin, 1993, pp. 152-161.
[C93b].. V.E. Cazanescu and G. Stefanescu. Coping with the complexity of program schemes by algebraic tools. In: How to cope with complexity, Ed. C. Calude. Publishing House of the Romanian Academy, Bucharest, 1993, 52-132. (in Romanian).
[C93c].. G. Stefanescu. Flowgraphs, flownomials, behaviours. In: Proceedings of the 9th Romanian Symposium on Computer Science held at Iassy, Romania, November 12-13, 1993, Eds. V. Felea and G. Ciobanu. Al.I. Cuza University Press, Iassy, 1993, pp. 477-489.
[C94a].. L. Barnatsky, S.L. Bloom, Z. Esik, and G. Stefanescu. Equational theories of relations and regular sets. In: Proceedings of the 2nd Conference on ``Words, Languages and Combinatorics'' held at Kyoto, Japan, 1992, Eds. M. Ito and H. Jurgensen. World Scientific, 1994, 40-48.
[C95a].. J.C.M. Baeten, J.A. Bergstra and G. Stefanescu. Process algebra with feedback. In: Modal Logic and Process Algebra, Proceedings of the Workshop ``Three Days of Bisimulation'' held at Amsterdam, The Netherlands, 1994. Eds., A. Ponse, M. de Rijke, and Y. Venema. CSLI Lecture Notes No. 53, Stanford, 1995, 13-37.
[C95b].. J.A. Bergstra and G. Stefanescu. Processes with multiple entries and exits. In: Proceedings of the 10th International Conference on Fundamentals of Computation Theory FCT'95 held at Dresden, Germany, 1995. Ed. Reichel, H., Lecture Notes in Computer Science, 965. Springer-Verlag, Berlin, 1995, 136-145.
[C95c].. V.E. Cazanescu and G. Stefanescu. Feedback, iteration and repetition. In: Mathematical aspects of natural and formal languages, Ed. G. Paun. World Scientific, 1995, 43-62.
[C97a].. G. Stefanescu. Axiomatizing mixed relations. In: Proc. 3rd Relational Methods in Computer Science Seminar, Hamammet, 1997. University of Science, Technology, and Medicine of Tunis, 1997, pp. 177-187.
[C97b].. G. Stefanescu. A short tour on FEST. In: Proc. Current Trends in Cybernetics and Philosophy of Science, Oradea, 1996. Europa Nova, Bucharest, 1997, pp. 327-332.
[C97c].. G. Stefanescu and Y. Kawahara. Distributive categories and mixed network algebras. In: Proc. Joint Conference on Discrete Mathematics and Applied Mathematics, Seta, Japan, 18-20 December, 1997, pp. 29-34.
[C98a].. R. Grosu, G. Stefanescu, and M. Broy. Visual formalism revised. In: Proceedings, International Conference on Application of Concurrency to System Design (CSD' 98), March 23-26, 1998, Aizu-Wakamatsu, Japan. IEEE Computer Society Press, 1998, pp. 41-51.
[C98b].. G. Stefanescu. On space-time duality in computing; imperative programming versus wave computation, In: Abstracts, 4th Relational Methods in Computer Science Seminar, Stefan Banach Mathematical Centre, Warsaw, 1998, pp. 197-202.
[C98c].. R. Grosu, M. Broy, B. Selic, and G. Stefanescu. Towards a calculus for UML-RT specifications. In: In Proc. of the 7th OOPSLA Workshop on Behavioral Semantics of OO Business and System Specifications, Vancouver, October, 19th, 1998.
[C99a].. R. Grosu, M. Broy, B. Selic, G. Stefanescu. What is Behind UML-RT? In: Behavioral specifications of businesses and systems, H. Kilov, B. Rumpe, and I. Simmonds (Eds.), Kluwer Academic Publishers, 1999, pp. 73-88.
[C99b].. G. Stefanescu. Remarks on mixalgebras. In: Proc. 4th International Symposium on Economic Informatics, Bucharest, May 1999, 1045-1053. INFOREC Printing House, Bucharest, 1999.
[C01a].. G. Stefanescu. ``Interactive systems'': - from a natural language expression, to a mathematical concept. In: Proc. 6th International Workshop on Relational Methods in Computer Science, Oisterwijk (near Tilburg), The Netherlands, 2001, pp ??.
Research Reports
[R82a].. G. Stefanescu. The entropy as the minimal cost of a tree. Preprint Series in Mathematics 11/1982, The National Institute for Scientific and Technical Creations, Bucharest, 1982.
[R84a].. G. Stefanescu. On flowchart theories I. Preprint Series in Mathematics 39/1984, The National Institute for Scientific and Technical Creations, Bucharest, 1984.
[R85a].. G. Stefanescu. A completion of ``On flowchart theories (I)''. Preprint Series in Mathematics 7/1985, The National Institute for Scientific and Technical Creations, Bucharest, 1985.
[R85b].. G. Stefanescu. On flowchart theories II. Preprint Series in Mathematics 32/1985, The National Institute for Scientific and Technical Creations, Bucharest, 1985.
[R86a].. G. Stefanescu. On flowchart theories I (revised version). Preprint Series in Mathematics 52/1986, The National Institute for Scientific and Technical Creations, Bucharest, 1986.
[R86b].. G. Stefanescu. Feedback theories (a calculus for isomorphism classes of flowchart schemes). Preprint Series in Mathematics 24/1986, The National Institute for Scientific and Technical Creations, Bucharest, 1986.
[R87a].. V.E. Cazanescu and G. Stefanescu. A formal representation of flowchart schemes. Preprint Series in Mathematics 22/1987, The National Institute for Scientific and Technical Creations, Bucharest, 1987.
[R87b].. V.E. Cazanescu and G. Stefanescu. Towards a new algebraic foundation of flowchart scheme theory. Preprint Series in Mathematics 43/1987, The National Institute for Scientific and Technical Creations, Bucharest, 1987.
[R88a].. V.E. Cazanescu and G. Stefanescu. Feedback, iteration and repetition. Preprint Series in Mathematics 42/1988. The National Institute for Scientific and Technical Creations, Bucharest, 1988.
[R88b].. V.E. Cazanescu and G. Stefanescu. A formal representation of flowchart schemes II. Preprint Series in Mathematics 60/1988, The National Institute for Scientific and Technical Creations, Bucharest, 1988.
[R89a].. V.E. Cazanescu and G. Stefanescu. Classes of finite relations as initial abstract data types. Preprint Series in Mathematics 3/1989, The National Institute for Scientific and Technical Creations, Bucharest, 1989.
[R89b].. V.E. Cazanescu and G. Stefanescu. An axiom system for biflow using summation, (extended) feedbackation and identities. Preprint Series in Mathematics 19/89, The National Institute for Scientific and Technical Creations, Bucharest, 1989.
[R89c].. V.E. Cazanescu and G. Stefanescu. Classes of finite relations as initial abstract data types I. Preprint Series in Mathematics 34/1989, The National Institute for Scientific and Technical Creations, Bucharest, 1989.
[R89d].. V.E. Cazanescu and G. Stefanescu. Classes of finite relations as initial abstract data types II. Preprint Series in Mathematics 47/1989, The National Institute for Scientific and Technical Creations, Bucharest, 1989.
[R90a].. V.E. Cazanescu and G. Stefanescu. A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization. Preprint Series in Mathematics 7/1990, The National Institute for Scientific and Technical Creations, Bucharest, 1990.
[R90b].. V.E. Cazanescu and G. Stefanescu. Tree models for reduced and minimal schemes. Preprint Series in Mathematics 8/1990, The National Institute for Scientific and Technical Creations, Bucharest, 1990.
[R91a].. Bloom, S.L., Esik, Z. and G. Stefanescu. Notes on equational theories of relations. Technical Report \#9113, Stevens Institute of Technology, Hoboken NJ, 1991. Also: Preprint No. 1/1992, Institute of Mathematics of the Romanian Academy, Bucharest, 1992.
[R93a].. J.A. Bergstra and G. Stefanescu. Translations between flowchart schemes and process graphs. Preprint No. 9/1993, Institute of Mathematics of the Romanian Academy, Bucharest, 1993.
[R94a].. J.A. Bergstra and G. Stefanescu. Bisimulation is two-way simulation. Technical Report PRG-9402, Programming Research Group, University of Amsterdam, 1994.
[R94b].. J.A. Bergstra and G. Stefanescu. Processes with multiple entries and exits modulo isomorphism and modulo bisimulation. Technical Report PRG-9403, Programming Research Group, University of Amsterdam, 1994.
[R94c].. J.C.M. Baeten, J.A. Bergstra and G. Stefanescu. Process algebra with feedback. Technical Report PRG-9419, Programming Research Group, University of Amsterdam, 1994. Also: Report 94/30, Computing Science Section, Eindhoven University of Technology, 1994.
[R94d].. J.A. Bergstra and G. Stefanescu. Network algebra for synchronous and asynchronous dataflow. Logic Group Preprint Series 122, Department of Philosophy, Utrecht University, 1994. Also: Preprint 38/1994, Institute of Mathematics of the Romanian Academy, Bucharest.
[R95a].. J.A. Bergstra, C.A. Middelburg, and G. Stefanescu. Network algebra for synchronous and asynchronous dataflow. Technical Report PRG-9508, Programming Research Group, University of Amsterdam, 1995. Revised version of: Logic Group Preprint Series 122, Department of Philosophy, Utrecht University.
[R95b].. J.A. Bergstra and G. Stefanescu. Network algebra with demonic relation operators. Technical Report PRG-9509, Programming Research Group, University of Amsterdam, 1995.
[R95c].. J.A. Bergstra and G. Stefanescu. Processes with multiple entries and exits. Preprint 16/1995, Institute of Mathematics of the Romanian Academy, Bucharest, 1995.
[R96a].. M. Broy and G. Stefanescu. The algebra of stream processing functions. Technical Report TUM-I9620, Institute for Informatics, Technical University Munich, May 1996.
[R96b].. G. Stefanescu. Reaction and control I. Mixing additive and multiplicative network algebras. Preprint No. 33/1996, Institute of Mathematics of the Romanian Academy, Bucharest, 1996.
[R96c].. G. Stefanescu. Axiomatising mixed relations (preliminary results). Preprint No. 37/1996, Institute of Mathematics of the Romanian Academy, Bucharest, 1996.
[R96d].. G. Stefanescu. A short tour on FEST. Preprint No. 38/1996, Institute of Mathematics of the Romanian Academy, Bucharest, 1996.
Refereed Abstracts
[A92a].. G. Stefanescu. Determinism and nondeterminism in program scheme theory: algebraic aspects. Bulletin of the EATCS, 46(1992), 376-379.
[A94a].. G. Stefanescu. Flownomials: regular expressions for distributed computation. In: Relational Methods in Computer Science, Eds. C. Brink and G. Schmidt. Dagstuhl-Seminar-Report 80, Saarbrucken, 1994.
Proceedings Editor
[E00a].. C.S Calude and G. Stefanescu (Eds.). Automata, Logic, and Computability. Special issue dedicated to Professor Sergiu Rudeanu Festschrift, Journal of Universal Computer Science, Volume 6(1), January, 2000. (Springer Verlag)
[E00b].. G. Stefanescu (Ed.). Proceedings of FCT'99 Workshop on Distributed Systems. Electronic Notes in Theoretical Computer Science, Volume 28, 2000. (Elsevier, ISBN: 0444507957)
Miscellaneous
[M00a].. C.S. Calude and G. Stefanescu. Automata, Logic, and Computability: JUCS Special issue dedicated to Professor Sergiu Rudeanu Festschrift, Journal of Universal Computer Science, Volume 6(1)(2000), 1-2.