Department of Mathematics

 
home
structure
computer science
mathematics
data networking
teaching
researchers
contact us
 
 
 
Barzdins.jpg (11534 bytes)

Janis BARZDINS
Professor, Dr. habil. sc. comp.
The University of Latvia
Institute of Mathematics and Computer Science
Rainis boul. 29
Riga, LV-1459
Latvia

Phone: +371 7224363
Fax: +371 7820153
E-mail: Janis.Barzdins@mii.lu.lv

Date and place of birth: 1937, Latvia

Education:

1954-1959 Undergraduate studies, Latvia State University, Faculty of Physics and Mathematics, Mathematics

1962-1965 Graduate studies, Latvia State University and the Institute of Mathematics (Novosibirsk), the Academy of Sciences of the USSR

Scientific degrees:

Candidate of Science (Mathematics) - in 1965 from the Institute of Mathematics (Novosibirsk), the Academy of Sciences of the USSR. Supervisor: Prof. B.Trakhtenbrot.

Doctor of Science (Mathematics) - in 1976 from the Institute of Mathematics (Novosibirsk), the Academy of Sciences of the USSR.

Professor in Mathematical Cybernetics - in 1985 from Highest Qualification Commission of the USSR

Dr. habil. Sc. Comp. - in 1992 by nostrification procedure from the Latvian Council of Science.

Employment:

1959-1962 Assistant, Faculty of Physics and Mathematics, Latvia State University

1965-1971 Senior Scientific Associate, Computer Center, Latvia State University

1971-1997 Head of Software Research and Development Department, Institute of Mathematics and Computer Science, University of Latvia

Since 1997 Director, Institute of Mathematics and Computer Science, University of Latvia

Since 1985 Professor, University of Latvia

Since 1992 Head of Division of Computer Science, Faculty of Physics and Mathematics, University of Latvia

Honours:

Full Member of the Academy of Sciences of Latvia (since 1992),

Professional Activities and Memberships:

Member of Senate, University of Latvia

Member of the Latvian Council of Science,

Head of Informatics Expert Commission, Latvian Council of Science,

Director of Computer Science Master Program, University of Latvia,

Member of Editorial Board "Fundamenta Informaticae", IOS Press

Research and Development:

In the past, Principal investigator in a series of R&D projects, concerning inductive synthesis, test case generation, specification languages and CASE tools for telecommunications and information systems.

Currently, Principal investigator in the Latvian Council of Science research grant "Models of inductive synthesis" and Supervisor of the Latvian Council of Science research program "Development of Latvian information technology for competitive production in specific sectors of the market".

Current scientific interests:

- Inductive synthesis and learning theory
- System modeling, languages and tools

Courses Taught:

1966 - 1992 Theory of computation

1985 Mathematical logic

1992 Fundamentals of specification languages

Since 1992 Formal specifications

Since 1992 Metamodels and formal specifications

Since 1992 Object-oriented analysis and modeling

Doctoral Students supervised:

1971

Audris Kalnins

Statistical characteristics of graph colouring problem

1973

Evalds Ikaunieks

Information characteristics of cellular automata

1974

Janis Kalnins

Modelling and universality of automata with variable structure

1979

Janis Bicevskis

Automatic construction of complete sample system for program testing

1979

Karlis Podnieks

Comparison of inductive synthesis strategies

1983

Mihails Augustons

Semantics and verification of data processing programs

1988

Andrejs Auzins

Complete sample system construction for program testing

1988

Maris Treimanis

Languages and tools for program system maintenance

1988

Juris Strods

Solvable cases of ambiguity problem of context-free grammars

1989

Alvis Brazma

Inductive synthesis of dots expressions

1989

Juris Borzovs

Symbolic execution and automatic test case generation

1990

Ilona Etmane

Inductive synthesis of graphical expressions

1992

Karlis Cerans

Real-time system specification and analysis problems

1998

Ugis Sarkans

Using hypothetical knowledge for driving inductive synthesis

 

List of Main Publications:

Books:

1. Trakhtenbrot B.A. and Barzdin J.M. Finite automata: behaviour and synthesis. - North-Holland, 1973, 321 p.

2. Auguston M.I., Balodis R.P., Barzdin J.M. et al. Programming in PL/1 OS/360, 1st ed. M., Finances and Statistics publishers, 1978; 2nd ed. M., Finances and Statistics publishers, 1984, 327p. (in Russian).

3.Barzdin J.M., Kalnins A.A., Strods J.F. and Sitko V.A. Specification language SDL/PLUS and its applications. - Computing Center of Latvia State University, 1988, 312p. (in Russian).

4.Barzdins J., Tenteris J. and Vilims E. Business modeling language GRAPES/BM and its applications.- a/s DATI, 1998, 152 p.; GRADE v.4.0. Language User Guide. Infologistik GmbH (http://www.infologistik.com).

Papers:

1. Barzdin J.M. Universal pulsing elements. Soviet Math. Dokl. 9: 523-525, 1964

2. Barzdin J.M. Universality problems in the theory of growing automata. -Soviet Math. Dokl. 9: 535-537, 1964

3. Barzdin J.M. The complexity of symmetry recognition by Turing machines. Problemi Kibernetiki, v.15, 1965 (in Russian)

4. Barzdin J.M. Capacity of the medium and behaviour of automata, - Soviet Math. Dokl. 10: 8-11, 1966

5. Barzdin J.M. Simulation of Boolean circuits by cellular automata. Problemi Kibernetiki, v.16, 1966 (in Russian)

6. Kolmogorov A.N. and Barzdin J.M. Implementation of networks in 3-dimensional space. Problemy Kibernetiki, v.19, 1967 (in Russian)

7. Barzdin J.M. Complexity of programs to determine whether natural numbers not greater than n belong to recursively enumerable set. Soviet Math. Dokl., 9: 1251 - 1254, 1968

8. Barzdin J.M. On computability by probabilistic machines. Soviet Math. Dokl., 10: 1464-1467, 1969

9. Barzdin J.M. On reconstruction of automata. - Problemi Kibernetiki, v. 21, 1969 (in Russian)

10. Barzdin J.M. On reconstruction of finite automata without information about the number of states. - DAN SSSR, v. 190, No. 5, 1970 (in Russian)

11. Barzdin J.M. On the relative frequency of solution of algorithmically unsolvable mass problems. - Soviet Math. Dokl., 11: 459-462, 1970

12. Barzdin J.M. Complexity of initial fragments of recursive enumerable sets. - DAN SSSR, v. 199, No. 2, 1971 (in Russian)

13. Barzdin J.M. Prognostication of automata and functions, Proc. IFIP Congress 1971, North-Holland, pp.81-84, 1972

14. Barzdin J.M. and Freivalds R.V. On the prediction of general recursive functions. - Soviet Math. Dokl., 13: 1251-1254, 1972

15. Barzdin J.M. and Kalninsh J.J. On a language for the transformation of graphs intended for the specification of automata. - Automat. i Vychisl. Tekhn. 7(5):22-28, 1973

16. Barzdin J.M. and Kalninsh J.J. A universal automation with variable structure. - Automat. i Vychisl. Tekhn. 8(2): 10-17, 1973

17. Barzdin J.M., On the frequency solution of recursive enumerable sets. - Trudi Matem. Instituta im. Steklova, AN SSSR, CXXXIII, 1973 (in Russian)

18. Barzdin J.M., Agafonov V.N. The sets related to probabilistic machines. - Zeitschr. f. Math. Logig und Grundlagen d. Math., Bd. 20, 1974 (in Russian)

19. Barzdin J.M. Two theorems on limiting synthesis of functions. Theory of algorithms and programs, N1: 82-88, University of Latvia, 1974 (in Russian)

20. Barzdins J., Bicevskis J., Kalnins A. Construction of complete sample system for correctness testing.- Lc. Notes in Comp. Sc., v. 32, 1975 (in Russian)

21. Barzdin J.M. Inductive inference of automata, functions and programs. - Proc. of the 20-th International Congress of Mathematicians. Canada, 1974, v.2, p.455-560 ( Amer. Math. Soc. Transl. (2) 1977, v.109, pp.107- 112)

22. Barzdin J.M., Bicevskis J.J. and Kalnins A.A. Automatic construction of complete sample systems for program testing. - Proc. IFIP Congress 1977, North-Holland, 1977, pp.57-62

23. Barzdin J.M. The problem of reachability and verification of programs. - Lc. Notes in Comp. Sc., v.74, Springer Verlag, 1979

24. Barzdin J.M. On inductive synthesis of programs. - Lc. Notes in Comp. Sc., v.122, Springer Verlag, 1981

25. Barzdin J.M., Zarins A.K., Kalnins A.A. On a specification language.- Kibernetika, No. 6, 1982 (in Russian)

26. Barzdin J.M. Some rules of inductive inference and their use for program synthesis. - Proc. IFIP Congress 1983 (9-th World Computer Congress), North-Holland, 1983, pp.333-338

27. Barzdin J.M., Auguston M.J., Kalnins A.A. Specification language and program testing. - Tehnika sredstv svyazi: Sistemi svyazi, v. 3, 1984 (in Russian)

28. Barzdin J.M., Brazma A.M., Kinber J.B. Inductive inference: state-of-the-art, problems and future. - Kibernetika, No. 6, 1987 (in Russian)

29. Barzdin J.M. Algorithmic information theory. In Encyclopaedia of Mathematics, volume 1, pages 140 -142. D.Reidel (Kluwer Academic Publishers), 1988. Updated and annotated translation of the Soviet Mathematical Encyclopaedia

30. Barzdin J.M., Kalnins A.A. and Auguston M.I. SDL tools for rapid prototyping and testing. - In: SDL'89: The Language at Work, North- Holland, 1989, pp.127-134

31. Barzdin J.M. Specification language SDL: state-of-the-art and problems. - Tehnika sredstv svyazi, No. 3, 1989 (in Russian)

32. Barzdin J., Brazma A. and Kinber J. Models of inductive syntactical synthesis. - Machine intelligence, 12, 1991, pp.139-148

33. Barzdins J. Editor Foreword. - Baltic Computer Science (Eds. J.Barzdins and D.Bjorner), Lc. Notes in Comp. Sc., v.502, Springer Verlag, 1991

34. Auzins A., Barzdins J., Bicevskis J. et al. Automatic construction of test sets. - Lc. Notes in Comp. Sc., v. 502, Springer Verlag, 1991, pp.287-360

35. Freivalds R., Barzdins J. and Podnieks K. Inductive inference of recursive functions. - Lc. Notes in Comp. Sc., v.502, Springer Verlag, 1991, pp.111-155

36. Barzdins J.M. and Barzdins G.J. Rapid construction of algebraic axioms from samples. - Theoretical Computer Science, 90, 1991, pp.199-208

36a Barzdins J.M. and Barzdins G.J. Rapid construction of algebraic axioms from samples. - In: Images of programming, North-Holland, 1991, pp.199- 208

37. Barzdins J.M. and Barzdins G.J. Towards efficient inductive synthesis: Rapid construction of local regularities. - Lc. Notes in Comp. Sc., v.659, Springer Verlag, 1993, pp.132-140

38. Barzdins J., Barzdins G., Apsitis K. and Sarkans U. Towards efficient inductive synthesis of expressions from Input/Output examples. - Lc. Notes in Comp.Sc., v. 744, Springer Verlag, 1993, pp.59-72

39. Barzdins J., Kalnins A, Podnieks K. et. al. GRADE Windows: an integrated CASE tool for information system development. - Proc. 6-th International Conference on Software Engineering and Knowledge Engineering, 1994, pp. 54-61

40. Barzdins J. Towards efficient inductive synthesis from Input/Output examples.-. Lc. Notes in Comp. Sc., v. 872, Springer Verlag, 1994

41. Barzdins J., Barzdins G. and Kalnins A. Rule - based approach to business modeling. Proc. 7-th International Conference on Software Engineering and Knowledge Engineering, 1995, pp. 161-165

42. Barzdinš J., Etmane I., Kalninš A. and Podnieks K. - Towards Integrated Computer Aided Systems and Software Engineering Tool. - Proc. Second International Workshop on Advances in Databases and Information Systems, Moscow, 1995, Phasis, pp. 10-14

43. Kalnins A., Barzdins J. et al. - Business Modeling Language GRAPES-BM and Related CASE Tools. - Proc. Second International Baltic Workshop on Databases and Information Systems, Tallinn, 1996, v.2, pp.3-16

44. Barzdinš J., Etmane I., Kalninš A. and Podnieks K. - Towards Integrated Computer Aided Systems and Software Engineering Tools for Information Systems Design. - Advances in Databases and Information Systems, Springer Verlag, 1996, pp.3-11

45. Barzdinš J. Freivalds R. and Smith C., Learning with Confidence.- Lc. Notes in Comp. Sc., v.1046, Springer Verlag, 1996, pp.207-218

46. Barzdins J. and Sarkans U., Incorporating Hypothetical Knowledge into the Process of Inductive Inference. - Lc. Notes in Comp. Sc., v. 1160, Springer Verlag, 1996, pp. 156-168

47. Kalnins A., Barzdins J. and Kalis A., GRADE-BM: Modeling and Simulation Facilities.- Proc. of NWPER'96, Aalborg University, 1996, pp.71-86

48. Barzdinš J., Freivalds R. and Smith C., Learning Formulae from Elementary Facts. - Lc. Notes in Comp. Sc., v. 1208, Springer Verlag, 1997, pp. 272-285

49. Barzdinš J. and Kalninš A. Business Systems Reengineering: Tool Support.- In: Intern. Conf.& "Exhib.Informatics Technologies and Telecommunications in the Baltic States", Riga, 1997, pp.69-73

50. Sarkans U. and Barzdins J. Using attribute grammars for description of inductive inference search space.- Lc. Notes in Comp. Sc., 1998, v. 1501, pp. 400-408.

51. Sarkans U., Barzdins J., Kalnins A. and Podnieks K. Towards a metamodel-based universal graphical editor.- Proc. Third International Baltic Workshop on Databases and Information Systems, Riga, 1998, v.1, pp. 187-197.

52. Kalnins A., Barzdins J. and Podnieks K. MiniGRADE – a tool for conceptual modeling by class diagrams.- Proc. 18-th International Conference on Conceptual Modeling (ER’99), 1999. p.11-12.

53.Janis Barzdins, Rusins Freivalds and Carl H. Smith. Towards a logic of discovery. - Proceedings of the International Workshop "Quantum Computation and Learning", Sundbyholm Slott, Sweden, May 27-29, 2000, p.110-120 (2000).

54.A.Kalnins, J.Barzdins and K.Podnieks.
Modeling Languages and Tools: State of the Art.- Proceedings of Second International Conference on Simulation, Gaming, Training and Business Process Reingineering, Riga, 2000, pp.211-214.

55. Janis Barzdins and Albertas Caplinskas. Editors foreword. - Databases and Information Systems, Kluwer Academic Publishers, 2001, 348 p.

56.A.Kalnins, K.Podnieks, A.Zarins, E.Celms, and J.Barzdins. Editor definition language and its implementation. - Lecture Notes in Computer Science, 2001, v.2244, p.74-81.

57.JJanis Barzdins, Rusins Freivalds and Carl H. Smith. Towards axiomatic basis of Inductive Inference. - Lecture Notes in Computer Science, 2001, v.2138, p.1-13.

58.A.Kalnins, J.Barzdins, E.Celms et al. The first step towards generic modeling tool.- Proceedings of the Fifth International Baltic Conference on Databases and Information Systems, Tallin, 2002, v.2, p.167-180.

59.J.Barzdins and Kalnins. How to Comprehend Large and Complicated Systems. Information Systems Development: Advances in Methodologies, Kluwer Academic, 2002, p.215-226.

 


| home | structure | computer science | mathematics | data networking |
teaching | our researchers | contact us |