R. Alur and D. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

E. Asarin, P. Caspi, and O. Maler, Timed regular expressions, Journal of the ACM, vol.49, issue.2, pp.172-206, 2002.
DOI : 10.1145/506147.506151
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.272

I. Banu-demergian and G. Stefanescu, On the contour representation of twodimensional patterns, 2013.

I. Banu-demergian and G. Stefanescu, Representation of scenarios in finite interactive systems, 2013.

J. Bergstra, I. Bethke, and A. Ponse, Process algebra with iteration, The Computer Journal, vol.60, pp.109-137, 1994.
DOI : 10.1093/comjnl/37.4.243
URL : http://dspace.library.uu.nl:8080/handle/1874/13564

S. Bloom and Z. Esik, Equational axioms for regular sets, Mathematical Structures in Computer Science, vol.117, issue.01, pp.1-24, 1993.
DOI : 10.1016/0304-3975(89)90012-1

S. Bloom and Z. Esik, Iteration Theories: The Equational Logic of Iterative Processes, 1993.

M. Bonsangue, J. Rutten, and A. Silva, A Kleene Theorem for Polynomial Coalgebras, Proc. FSSCS'09, pp.122-136, 2009.
DOI : 10.1007/BFb0055624
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.5331

V. Cazanescu and G. Stefanescu, Towards a new algebraic foundation of flowchart scheme theory, Fundamenta Informaticae, vol.13, pp.171-210, 1990.

V. Cazanescu and G. Stefanescu, Feedback, iteration and repetition, Mathematical aspects of natural and formal languages, pp.43-62, 1995.

J. Conway, Regular Algebra and Finite Machines, 1971.

C. Dragoi and G. Stefanescu, AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System, Electronic Notes in Theoretical Computer Science, vol.203, issue.3, pp.69-94, 2008.
DOI : 10.1016/j.entcs.2008.04.087

V. Garg and M. Ragunath, Concurrent regular expressions and their relationship to Petri nets, Theoretical Computer Science, vol.96, issue.2, pp.285-304, 1992.
DOI : 10.1016/0304-3975(92)90339-H
URL : http://doi.org/10.1016/0304-3975(92)90339-h

D. Giammarresi and A. Restivo, Two-Dimensional Languages, pp.215-267, 1997.
DOI : 10.1007/978-3-642-59126-6_4
URL : https://hal.archives-ouvertes.fr/hal-00541890

D. Goldin, S. Smolka, and P. Wegner, Interactive computation: The new paradigm, 2006.
DOI : 10.1007/3-540-34874-3

A. Joyal, R. Street, and D. Verity, Traced monoidal categories, Proceedings of the Cambridge Philosophical Society, 1996.
DOI : 10.1007/BF02096491

S. Kleene, Representation of Events in Nerve Nets and Finite Automata, Automata Studies, issue.34, p.3, 1956.
DOI : 10.1515/9781400882618-002

D. Kozen, A completeness theorem for Kleene algebras and the algebra of regular events, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.214-225, 1991.
DOI : 10.1109/LICS.1991.151646

D. Krob, A complete system of B-rational identities, Theoretical Computer Science, vol.89, pp.207-343, 1991.
DOI : 10.1007/BFb0032022
URL : https://hal.archives-ouvertes.fr/hal-00017725

M. Latteux and D. Simplot, Context-Sensitive String Languages and Recognizable Picture Languages, Information and Computation, vol.138, issue.2, pp.160-169, 1997.
DOI : 10.1006/inco.1997.2659
URL : http://doi.org/10.1006/inco.1997.2659

K. Lindgren, C. Moore, and M. Nordahl, Complexity of two-dimensional patterns, Journal of statistical physics, vol.91, pp.5-6, 1998.

R. Maddux, Relation-algebraic semantics, Theoretical Computer Science, vol.160, issue.1-2, pp.1-85, 1996.
DOI : 10.1016/0304-3975(95)00082-8
URL : http://doi.org/10.1016/0304-3975(95)00082-8

E. Manes and M. Arbib, Algebraic approaches to program semantics, 1986.
DOI : 10.1007/978-1-4612-4962-7

R. Milner, Flowgraphs and Flow Algebras, Journal of the ACM, vol.26, issue.4, pp.794-818, 1979.
DOI : 10.1145/322154.322167

R. Milner, Action calculi V : Reflexive molecular forms, 1994.

C. Petri, Kommunikation mit automaten

A. Salomaa, Two Complete Axiom Systems for the Algebra of Regular Events, Journal of the ACM, vol.13, issue.1, pp.158-169, 1966.
DOI : 10.1145/321312.321326

A. Sofronia, A. Popa, and G. Stefanescu, Undecidability Results for Finite Interactive Systems, 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp.265-279, 2009.
DOI : 10.1109/SYNASC.2008.42
URL : http://arxiv.org/abs/1001.0143

G. Stefanescu, Feedback Theories (A Calculus for Isomorphism Classes of Flowchart Schemes). No. 24 in Preprint Series in, also in: Revue Roumaine de Mathematiques Pures et Applique, pp.73-79, 1986.

G. Stefanescu, On flowchart theories Part I. The deterministic case, Journal of Computer and System Sciences, vol.35, issue.2, pp.163-191, 1987.
DOI : 10.1016/0022-0000(87)90011-0

G. Stefanescu, On flowchart theories: Part II. The nondeterministic case, Theoretical Computer Science, vol.52, issue.3, pp.307-340, 1987.
DOI : 10.1016/0304-3975(87)90114-9

G. Stefanescu, Algebra of Networks, 2000.
DOI : 10.1007/978-94-010-0413-8_3

G. Stefanescu, Algebra of Networks, Proof and System-Reliability, pp.49-78, 2002.
DOI : 10.1007/978-94-010-0413-8_3

G. Stefanescu, Interactive systems with registers and voices, Fundamenta Informaticae, vol.73, issue.1, pp.285-305, 2006.