Showing papers in "Acta Informatica in 2015"

Compositional verification of asynchronous concurrent systems using CADP

Abstract: During the last decades, concurrency theory successfully developed salient concepts to formally model and soundly reason about distributed and parallel systems. In practice, however, most attempts at analyzing large systems face severe complexity issues, especially state explosion, which prevents to exhaustively enumerate reachable state spaces. Compositionality is the most promising approach to fight state explosion. In this article, we focus on finite-state verification techniques for asynchronous message-passing systems, highlighting the existence of multiple, diverse compositional techniques such as: compositional model generation, semi-composition and projection, automatic generation of projection interfaces, formula-dependent model generation, and partial model checking. These approaches have been implemented in the framework of the CADP (Construction and Analysis of Distributed Processes) software toolbox and applied to large-scale, industrial systems. A key point is the ability to combine several compositional techniques, as no single technique is sufficient to address all kinds of systems.

CCS: It's not fair!

Abstract: In the process algebra community it is sometimes suggested that, on some level of abstraction, any distributed system can be modelled in standard process-algebraic specification formalisms like CCS. This sentiment is strengthened by results testifying that CCS, like many similar formalisms, is Turing powerful and provides a mechanism for interaction. This paper counters that sentiment by presenting a simple fair scheduler--one that in suitable variations occurs in many distributed systems--of which no implementation can be expressed in CCS, unless CCS is enriched with a fairness assumption. Since Dekker's and Peterson's mutual exclusion protocols implement fair schedulers, it follows that these protocols cannot be rendered correctly in CCS without imposing a fairness assumption. Peterson expressed this algorithm correctly in pseudocode without resorting to a fairness assumption, so it furthermore follows that CCS lacks the expressive power to accurately capture such pseudocode.

Synthesis and reengineering of persistent systems

Abstract: In formal verification, a structural object, such as a program or a Petri net, is given, and questions are asked about its behaviour. In system synthesis, conversely, a behavioural object, such as a transition system, is given, and questions are asked about the existence of a structural object realising this behaviour. In system reengineering, one wishes to transform a given system into another one, with similar behaviour and other properties not enjoyed by the original system. This paper addresses synthesis and reengineering problems in the specific framework of finite-state labelled transition systems, place/transition Petri nets, and behaviour isomorphisms. Since algorithms solving these problems are prohibitively time-consuming in general, it is interesting to know whether they can be improved in restricted circumstances, and whether direct correspondences can be found between classes of behavioural and classes of structural objects. This paper is concerned with persistent systems, which occur in hardware design and in various other applications. We shall derive exact conditions for a finite persistent transition system to be isomorphically implementable by a bounded Petri net exhibiting persistence in a structural way, and derive an efficient algorithm to find such a net if one exists. For the class of marked graph Petri nets, this leads to an exact characterisation of their state spaces.

Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes

Abstract: The logic PML is a probabilistic version of Hennessy---Milner logic introduced by Larsen and Skou to characterize bisimilarity over probabilistic processes without internal nondeterminism. In this paper, two alternative interpretations of PML over nondeterministic and probabilistic processes as models are considered, and two new bisimulation-based equivalences that are in full agreement with those interpretations are provided. The new equivalences include as coarsest congruences the two bisimilarities for nondeterministic and probabilistic processes proposed by Segala and Lynch. The latter equivalences are instead known to agree with two versions of Hennessy---Milner logic extended with an additional probabilistic operator interpreted over state distributions in place of individual states. The new interpretations of PML and the corresponding new bisimilarities are thus the first ones to offer a uniform framework for reasoning on processes that are purely nondeterministic or reactive probabilistic or that mix nondeterminism and probability in an alternating/nonalternating way.

State space axioms for T-systems

Abstract: T-systems are generalisations of marked graph Petri nets This paper describes synthesis algorithms that allow bounded or unbounded T-systems to be derived from finite or infinite labelled transition systems satisfying a set of necessary properties These properties can thus be interpreted as axioms characterising T-system state spaces

Contextual hyperedge replacement

Abstract: Contextual hyperedge-replacement grammars (contextual grammars, for short) are an extension of hyperedge replacement grammars. They have recently been proposed as a grammatical method for capturing the structure of object-oriented programs, thus serving as an alternative to the use of meta-models like uml class diagrams in model-driven software design. In this paper, we study the properties of contextual grammars. Even though these grammars are not context-free, one can show that they inherit several of the nice properties of hyperedge replacement grammars. In particular, they possess useful normal forms and their membership problem is in NP.

Richer interface automata with optimistic and pessimistic compatibility

Abstract: Modal transition systems are a popular semantic underpinning of interface theories, such as Nyman et al.'s IOMTS and Bauer et al.'s MIO, which facilitate component-based reasoning for concurrent systems. Our interface theory MIA repaired a compositional flaw of IOMTS-refinement and introduced a conjunction operator. In this paper, we first modify MIA to properly deal with internal computations including internal must-transitions, which were largely ignored already in IOMTS. We then study a MIA variant that adopts MIO's pessimistic--rather than IOMTS' optimistic--view on component compatibility and define, for the first-time in a pessimistic, non-deterministic setting, conjunction and disjunction on interfaces. For both the optimistic and pessimistic MIA variant, we also discuss mechanisms for extending alphabets when refining interfaces, which is a desired feature for perspective-based specification. We illustrate our advancements via a small example.

Deterministic ordered restarting automata for picture languages

Abstract: The ordered restarting automaton (processing strings) is introduced, and it is shown that its nondeterministic variant is very expressive, as it accepts some languages that are not even context-free, while the deterministic ordered restarting automata just accept the regular languages. Then three different extensions of the deterministic ordered restarting automaton to two-dimensional inputs are defined that differ in the way in which they can move their read/write windows. We compare the classes of picture languages that these types of automata accept to each other and to some well studied classes of picture languages from the literature, and we present some closure and non-closure properties for them.

Two-way pebble transducers for partial functions and their composition

Abstract: Two-way finite state transducers are considered that use a finite number of pebbles, of which the life times must be nested. For every nondeterministic transducer that realizes a partial function, an equivalent deterministic transducer can be constructed. The composition of two deterministic transducers can be realized by one such transducer with a minimal number of pebbles.

Gray code orders for $$q$$q-ary words avoiding a given factor

Abstract: Based on order relations inspired by the binary reflected Gray code (BRGC) we define Gray codes and give a generating algorithm for $$q$$q-ary words avoiding a prescribed factor. These generalize an early 2001 result and a very recent one published by some of the present authors, and can be seen as an alternative to those of Squire published in 1996. Among the involved tools, we make use of generalized BRGC order relations, ultimate periodicity of infinite words, and word matching techniques.

Observable liveness of Petri nets

Abstract: Whereas, for Petri nets, the traditional liveness property guarantees that each transition of a Petri net can always occur again, observable liveness requires that, from any reachable marking, each observable transition can be forced to fire by choosing appropriate controllable transitions; hence it is defined for Petri nets with distinguished observable and controllable transitions. We introduce observable liveness and show that this new notion generalizes traditional liveness in various ways. In particular, liveness of a 1-bounded Petri net implies observable liveness, provided the only conflicts that can appear are between controllable transitions. This assumption refers to applications where the uncontrollable part models a deterministic machine (or several deterministic machines), whereas the user of the machine is modeled by the controllable part and can behave arbitrarily.

Moving from interface theories to assembly theories

Abstract: We show how interface theories supporting pairwise component analysis can be extended in a generic way to a multi-component environment. This leads to the abstract framework of an assembly theory which captures notions of assembly refinement and communication-safety in assemblies of interacting components. An assembly theory supports also encapsulation of assemblies into interfaces and hence hierarchical constructions. We propose general rules that should be satisfied by any concrete assembly theory, like compositional construction and refinement of communication-safe assemblies. We discuss general procedures how to construct an assembly theory on top of a given interface theory such that (some of) the laws of an assembly theory are automatically guaranteed by the properties of an underlying interface theory. As a proof of concept we consider two instances of our approach. The first one starts from the (optimistic) interface theory of interface automata proposed by de Alfaro and Henzinger, and the second one from the (pessimistic) interface theory of modal I/O-interfaces. In the latter case, we propose a new notion of modal assembly refinement which has all the required properties, in particular it preserves modal communication-safety of assemblies. A small case-study illustrates how our concepts can be methodologically applied.

Refinement checking on parametric modal transition systems

Abstract: Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refinement process like exclusive, conditional and persistent choices. We introduce a new model called parametric modal transition systems (PMTS) together with a general modal refinement notion that overcomes many of the limitations. We investigate the computational complexity of modal and thorough refinement checking on PMTS and its subclasses and provide a direct encoding of the modal refinement problem into quantified Boolean formulae, allowing us to employ state-of-the-art QBF solvers for modal refinement checking. The experiments we report on show that the feasibility of refinement checking is more influenced by the degree of nondeterminism rather than by the syntactic restrictions on the types of formulae allowed in the description of the PMTS.

Denotational fixed-point semantics for constructive scheduling of synchronous concurrency

Abstract: The synchronous model of concurrent computation (SMoCC) is well established for programming languages in the domain of safety-critical reactive and embedded systems. Translated into mainstream C/Java programming, the SMoCC corresponds to a cyclic execution model in which concurrent threads are synchronised on a logical clock that cuts system computation into a sequence of macro-steps. A causality analysis verifies the existence of a schedule on memory accesses to ensure each macro-step is deadlock-free and determinate. We introduce an abstract semantic domain $$I(\mathbb {D}, \mathbb {P})$$I(D,P) and an associated denotational fixed-point semantics for reasoning about concurrent and sequential variable accesses within a synchronous cycle-based model of computation. We use this domain for a new and extended behavioural definition of Berry's causality analysis in terms of approximation intervals. The domain $$I(\mathbb {D}, \mathbb {P})$$I(D,P) extends the domain $$I(\mathbb {D})$$I(D) from our previous work and fixes a mistake in the treatment of initialisations. Based on this fixed-point semantics we propose the notion of Input Berry-constructiveness (IBC) for synchronous programs. This new IBC class lies properly between strong (SBC) and normal Berry-constructiveness (BC) defined in previous work. SBC and BC are two ways to interpret the standard constructive semantics of synchronous programming, as exemplified by imperative SMoCC languages such as Esterel or Quartz. SBC is often too restrictive as it requires all variables to be initialised by the program. BC can be too permissive because it initialises all variables to a fixed value, by default. Where the initialisation happens through the memory, e.g., when carrying values from one synchronous tick to the next, then IBC is more appropriate. IBC links two levels of execution, the macro-step level and the micro-step level. We prove that the denotational fixed-point analysis for IBC, and hence Berry's causality analysis, is sound with respect to operational micro-level scheduling. The denotational model can thus be viewed as a compositional presentation of a synchronous scheduling strategy that ensures reactiveness and determinacy for imperative concurrent programming.

Parametrized invariance for infinite state processes

Abstract: We study the uniform verification problem for infinite state processes. This problem consists of proving that the parallel composition of an arbitrary number of processes running the same program (or a finite collection of programs) satisfies a temporal property. Our practical motivation is to build a general framework for the temporal verification of concurrent datatypes. In this paper we propose a general method for the verification of safety properties of parametrized programs that manipulate complex local and global data, including mutable state in the heap. Our method is based on a clear division between the following two dimensions of the problem: the interaction between executing threads--handled by novel parametrized invariance proof rules, and the data being manipulated--handled by specialized decision procedures. Our proof rules discharge automatically a finite collection of verification conditions. The size of this collection depends only on the size of the program and the specification, but not on the number of processes in any given instance or on the kind of data manipulated. Moreover, all verification conditions are quantifier free, which eases the development of decision procedures for complex data-types on top of off-the-shelf SMT solvers. We prove soundness of our proof rules and illustrate their application in the formal verification of (1) two infinite-state mutual exclusion protocols; (2) shape and functional correctness properties of several concurrent data-types, including fine-grained and non-blocking concurrent lists and queues. We report empirical results using a prototype implementation of the proof rules and decision procedures.

Revisiting causality, coalgebraically

Abstract: In this paper we recast the classical Darondeau---Degano's causal semantics of concurrency in a coalgebraic setting, where we derive a compact model. Our construction is inspired by the one of Montanari and Pistore yielding causal automata, but we show that it is instance of an existing categorical framework for modeling the semantics of nominal calculi, whose relevance is further demonstrated. The key idea is to represent events as names, and the occurrence of a new event as name generation. We model causal semantics as a coalgebra over a presheaf, along the lines of the Fiore---Turi approach to the semantics of nominal calculi. More specifically, we take a suitable category of finite posets, representing causal relations over events, and we equip it with an endofunctor that allocates new events and relates them to their causes. Presheaves over this category express the relationship between processes and causal relations among the processes' events. We use the allocation operator to define a category of well-behaved coalgebras: it models the occurrence of a new event along each transition. Then we turn the causal transition relation into a coalgebra in this category, where labels only exhibit maximal events with respect to the source states' poset, and we show that its bisimilarity is essentially Darondeau---Degano's strong causal bisimilarity. This coalgebra is still infinite-state, but we exploit the equivalence between coalgebras over a class of presheaves and History Dependent automata to derive a compact representation, where states only retain the poset of the most recent events for each atomic subprocess, and are isomorphic up to order-preserving permutations. Remarkably, this reduction of states is automatically performed along the equivalence.

On constructibility and unconstructibility of LTS operators from other LTS operators

Abstract: An LTS operator can be constructed from a set of LTS operators up to an equivalence if and only if there is an LTS expression that only contains operators from the set and whose result is equivalent to the result of the operator. In this publication this idea is made precise in the context where each LTS has an alphabet of its own and the operators may depend on the alphabets. Then the extent to which LTS operators are constructible is studied. Most, if not all, established LTS operators have the property that each trace of the result arises from the execution of no more than one trace of each of its argument LTSs, and similarly for infinite traces. All LTS operators that have this property and satisfy some other rather weak regularity properties can be constructed from parallel composition and hiding up to the equivalence that compares the alphabets, traces, and infinite traces of the LTSs. Furthermore, a collection of other miscellaneous constructibility and unconstructibility results is presented.

Compositional construction of most general controllers

Abstract: Given a system $${\fancyscript{A}}$$A and an objective $$\varPhi $$?, the task of controller synthesis is to design a decision making policy that ensures $$\varPhi $$? to be satisfied. This article deals with transition system-like system models and controllers that base their decisions on the observables of the actions performed so far. We present a framework for the compositional construction of controllers for conjunctive sequences of linear-time objectives in an online manner. For this approach, it is crucial that the controllers enforce the objectives in a most general manner, being as permissive as possible. We then present game-based algorithms for the construction of such most general controllers for invariance, reachability and $$\omega $$?-regular objectives.

Modal algebra and Petri nets

Abstract: We use the by now well established setting of modal semirings to derive a modal algebra for Petri nets. It is based on a relation-algebraic calculus for separation logic that enables calculations of properties in a pointfree fashion and at an abstract level. Basically, we start from an earlier logical approach to Petri nets that in particular uses modal box and diamond operators for stating properties about the state space of such a net. We provide relational translations of the logical formulas which further allow the characterisation of general behaviour of transitions in an algebraic fashion. From the relational structure an algebra for frequently used properties of Petri nets is derived. In particular, we give connections to typical used assertion classes of separation logic. Moreover, we demonstrate applicability of the algebraic approach by calculations concerning a standard example of a mutex net.

Some properties of involution binary relations

Abstract: This paper aims to investigate properties of involution binary relations, which are some particular binary relations. We study the concepts of involution spanning sets and give some examples related to different involution binary relations. Moreover, some relationships among the involution independent sets, codes, and involution codes are studied when the mapping function is either a morphic or an antimorphic involution of $$X^*$$X?.

Special issue on Combining Compositionality and Concurrency: part 1

Abstract: In March 1988, we organised a workshop on “Combining Compositionality and Concurrency” in Königswinter near Bonn, Germany. We were motivated by the following dichotomy. One the one hand, a theory of concurrency was initiated by Carl Adam Petri, with notions like causality, conflict, and concurrency. One the other hand, a theory of communicating processes was developed by Robin Milner and Tony Hoare, where the emphasis was put on composing processes by algebraic operators like sequential, nondeterministic, and parallel composition. For quite a some time little interaction took place between the followers of these two lines of research. Then it was more and more realized that a full understanding, analysis or construction of parallel processes is impossible without combining the best from concurrency and compositionality. The idea of the workshop was therefore to invite researchers active in the area of combining compositionality and concurrency. In the meantime the relationships between these two directions have been carefully investigated. Today, the elements of the different semantic approaches are freely mixed. Also, the scope of systems that are modelled by concurrent or process algebraic means is much extended, for example, to mobile and probabilistic systems. In 2013, we called for a workshop “25 Years of Combining Compositionality and Concurrency”. We received very enthusiastic responses, and the jubilee workshop took place in

Letter from the Managing Editor

Abstract: In June 2000 a meeting took place in the grand old building of the Technical University of Munich between Manfred Broy, Managing Editor of Acta Informatica since 1982, Hans Wossner from Springer-Verlag, and myself. We agreed that from August 2000 onward, I would take over the task of being the Managing Editor of Acta Informatica from Manfred Broy. It was of course an exciting and partially unknown task for me. A continuous stream of submissions from various topics had to be directed to suitable reviewers or other members of the Editorial Board in order to be evaluated for their quality. Finally, the positive or negative decisions had to be communicated to the authors. From the beginning I have been nicely supported by my secretary Andrea Goken, who held the initial contact to authors upon submission, kept files of all submissions, and contacted the production department of Springer-Verlag once the papers were accepted. I thank her very much! Hans Wossner and later Alfred Hofmann from Springer-Verlag kindly helped to arrange high-level organisational issues. Also, our cooperation with the production department, at first in Heidelberg and later in India, went very smooth throughout all these years inspite of changing contact persons. The quality of the papers was always the guiding principle in all our decisions. The active members of the Editorial Board helped a lot in shaping the profile of Acta Informatica, reflecting their varied research interests. Many thanks for their continuing support! Of course, nothing would have been achieved without the voluntary work of so many reviewers. Their names are acknowledged in the last issue of each Acta volume. I am pleased to say that Acta Informatica stays in demand for authors despite many competing publication venues. It is their high-quality contributions that have made up each of the Acta issues over the years. However, since I have been increasingsly called upon to take up other duties, I have decided that after 14years in office it is time for me to step down from my post as Managing Editor by the end of 2014. I shall stay on as ordinary member of the Editorial Board.

Formação dos professores: possibilidades diante de impossibilidades

Abstract: Resumo: Este artigo visa provocar reflexoes sobre a formacao dos professores na atualidade. Vivemos em tempos de rapidas transformacoes tecnologicas e cientificas. Estas mudancas repercutem no cotidiano das pessoas, no seu modo de pensar, de viver, de aprender e de buscar suas orientacoes profissionais. Levy conclui que muitos dos conhecimentos e habilidades adquiridos por uma pessoa no inicio de seu percurso profissional estarao antiquados no fim de sua carreira profissional. Assim, constituir-se professor torna-se um grande desafio. A pesquisa no cotidiano sobre sua a pratica pedagogica do professor e uma das estrategias apontadas por muitos teoricos para a formacao do professor. E nesse sentido que este artigo articula as reflexoes em busca de possibilidades diante de tantas impossibilidades da pratica pedagogica. Palavras-chaves : Formacao de professores; Pesquisa; Cotidiano escolar; Praticas pedagogicas. Abstract: This article seeks to cause reflections on teacher’s education today. We live in times of rapid technological and scientific transformations. These changes impact in people’s daily lives, in their way of thinking, of living, of learning and of seeking their professional guidance. Levy (2009) concludes that many of the knowledge and skills acquired by a person at the beginning of its career will be outdated by the end of its professional career. To become a teacher becomes a great challenge. The research in teacher’s daily life, about its teachings, is one of the strategies pointed out by many theorists to teacher’s formation. It is in this sense that this article articulates the reflections in search of possibilities before so many impossibilities of pedagogical practice. Keywords: Teacher’s education; Search; School routine; Pedagogical practices.

Ecoeconomia e áreas de preservação da microbacia do Ribeirão Guaiquíca - município de Engenheiro Coelho – SP

Abstract: O desenvolvimento sustentavel tem sido visto como um componente economico e ecologico. A preservacao do meio ambiente depende de uma consciencia ecologica, juntamente com uma formacao da consciencia economica. Recentemente surgiu entao o enfoque na Ecoeconomia. Ela e uma economia para a promocao de um alerta geral para uma futura crise economica por conta de uma falta de planejamento na area ecologica e no crescimento desordenado. Entendendo, no contexto atual da elevada preocupacao com o meio ambiente, surgiu o interesse na realizacao deste estudo, que teve como foco os aspectos relativos as areas de preservacao da Microbacia do Guaiquica, uma das microbacias que compoe o Municipio de Engenheiro Coelho no Estado de Sao Paulo. Este trabalho e parte de outro maior, onde todo o municipio foi estudado, porem com outro foco em relacao a essas areas. Este, porem centralizou a tematica na microbacia Guaiquica e como a presenca das areas legais de APP (Area de Preservacao Permanente) e RL (Reserva Legal) podem contribuir para melhoria da Ecoeconomia na regiao. Palavras-chave : Ecoeconomia; APP e RL; Contribuir; Crescimento.

Special issue on Combining Compositionality and Concurrency: part 2

Abstract: This is the second part of the special issuemotivated by theworkshop “25Years of Combining Compositionality and Concurrency” that we organised in August 2013 in Konigswinter near Bonn, Germany. The first part was published in Acta Informatica (2015) 52(1):3–106. For an introduction to the topic see our editorial there. This second part comprises four papers. The paper Richer Interface Automata with Optimistic and Pessimistic Compatibility by Gerald Luttgen, Walter Vogler, and Sascha Fendrich addresses component-based reasoning for concurrent systems via modal interface automata (MIA). The authors study optimistic and pessimistic MIA variants with internal must-transitions. They define conjunction and disjunction on interfaces as well as mechanisms for extending alphabets. The paper Compositional Verification of Asynchronous Concurrent Systems using CADP by Hubert Garavel, Frederic Lang, and Radu Mateescu investigates how various compositional techniques help to fight the state-space explosion in the verification of asynchronous message-passing systems. The techniques are implemented in the toolbox CADP (Construction and Analysis of Distributed Processes). The authors compare the different approaches using a common case study. The paper Denotational Fixed-Point Semantics for Constructive Scheduling of Synchronous Concurrency by Joaquin Aguado, Michael Mendler, Reinhard von Hanxleden, and Insa Fuhrmann defines an abstract semantic domain and an associated denotational semantics for synchronous programs. The semantics induces three notions of constructiveness, among

Formação continuada de coordenadores e orientadores, uma experiência com narrativas

Abstract: Resumo: Este trabalho resulta de pesquisas referentes a trajetoria formativa de um grupo de coordenadores/orientadores, mediante apreciacao e reflexao, a partir das suas narrativas escritas, as quais foram utilizadas como instrumento de coleta de dados para formacao/investigacao. As analises permearam o estudo da pesquisa qualitativa e possibilitaram ponderacoes sobre a pratica, ponto essencial para a formacao continuada, por ser uma experiencia de extrema importância para uma tomada de consciencia, mediante aprendizagem coletiva e individual que, mutuamente, foi compartilhada. Essa formacao continuada, por meio das narrativas escritas, pode indicar uma direcao para articulacao de propostas que busquem novas estrategias e caminhos nos espacos formativos, os quais se justificam pela relevância social pedagogica dos componentes pronominais (espaco de discussoes, trocas de ideias, formacao autonoma, etc.), pois essas vivencias, via aprendizagem profissional, coletiva e individual, alicercadas no interior do grupo, se expandem para o locus de atuacao desses que tambem compoem a escola. Palavras-chave : Formacao continuada; Coordenador e orientador; Narrativas. Abstract: This work results of researches on the formative history of a group of coordinators/supervisors, following consideration and reflection from their written narratives, the ones which were used as a dada collecting instrument for formation/investigation. The analysis permeated the studies in qualitative research and made possible ponderings about the practice, essential point for continuing education, for it is an experience of extreme importance for decision making, through collective and individual learning, which was mutually shared. This continuing information, throughout the written narratives, may indicate a direction to articulating proposals that seeks for new strategies and pathways in the formative spaces, the ones which justify themselves by the pedagogical social relevance of the pronoun components (discussion spaces, exchange of ideas, autonomous formation, etc.), for these experiences, throughout professional, collective and individual learning, grounded within the group, expands itself to the locus of action of those who also composes the school. Keyword : Continuing education; Coordinator and advisor; Narratives.

Considerações sobre o trabalho de uma editora universitária

Abstract: Resumo : Neste artigo, abordaremos um pouco da experiencia editorial da Universidade Federal de Uberlândia, com o objetivo de iniciar levantamentos e questionamentos que sirvam como ponto de partida para uma posterior pesquisa mais abrangente, envolvendo outras editoras universitarias. Trataremos aqui de uma parte de sua historia, com breves analises sobre seu vinculo com questoes da epoca de sua criacao e de atendimento as demandas por inovacao tecnologica e necessidade de publicacao da producao cientifica interna, alem de outras questoes que pretendemos pesquisar, muitas das quais aparecem ao longo do texto. E importante ressaltar que este trabalho, alem da pesquisa documental, inclui minhas observacoes e questionamentos pessoais e profissionais, visto que sou funcionaria da editora desde outubro de 2004, tendo presenciado a reestruturacao a que foi submetida e os seus problemas cotidianos. Palavras-chave: Editoras universitarias; Educacao; Comunicacao; Tecnologias; Trabalho. Abstract: In this article we will discuss a little about the editorial experience of the Federal University of Uberlândia with the objective of initiating surveys and questions that serve as a starting point for a further research more comprehensive, involving other editorial universities. It will be considered here one of its parts of history, with brief analysis about its bonds with the issues of the time of its creation and meeting the demands for technological innovations and the needs to publicize the internal scientific production, and the release of the questions that we intend to search, many of which appear throughout the text. It is important to emphasize that this work, besides the documentary research, includes my observations, personal and professional questionings, since I am an employee of the publisher since October 2004, having witnessed the restructuring that was submitted and their everyday problems. Keywords: University publishers; Education; Communication; Technologies; Work.

A importância do vínculo mãe-bebê no processo de desenvolvimento de uma criança

Abstract: Resumo: O presente artigo discute a relacao psiquica entre mae-bebe-crianca e sua importância para o desenvolvimento do individuo, utilizando como referencial teorico a psicanalise. Permeando a relacao materna, trataremos da questao do alimento, elemento importante para o entendimento do caso a ser aqui discutido. O alimento passa a ser visto nao apenas como necessidade fisiologica, mas como via preferencial da crianca expressar sua subjetividade e demonstrar seus conflitos internos e tambem familiares. Tal questao perpassa a simples analise a respeito das formas adequadas de criacao de filhos e boas condutas maternas como influencias no desenvolvimento infantil, na qual as mulheres costumam ser culpadas. Pode-se verificar que as primeiras interacoes mae-bebe sao importantes indicadores do tipo de vinculo estabelecido e ajudam a compreender melhor as relacoes construidas entre mae e crianca, alem de como essas relacoes bem ou mal sucedidas, do ponto de vista Winnicottiano, interferem mutualmente. Um dos possiveis reflexos dessas interacoes esta relacionado com o significante que geralmente mantem a crianca em conexao com a mae, que e o processo de alimentacao. Palavras Chave : Relacao mae-bebe; desenvolvimento; alimentacao. Abstract: This article discusses the psychological relationship between mother-infant - child and its significance for the development of the individual, using as a theoretical psychoanalysis. Permeating the maternal relationship, we address the issue of food, an important element for understanding the case to be discussed here. The food is seen not only as a physiological necessity, but preferred route as the child express their subjectivity and demonstrate its internal and also family strife. This question involves the simple analysis about the proper ways of parenting and good maternal behaviors as influences on child development, in which women have been blamed. It was verified that the first mother-infant interactions are important indicators of the type of bond established and help to better understand the relationships built between mother and child and how successful or unsuccessful these relationships from the point of Winnicott's view, mutually interfere. One of the possible consequences of these interactions are related to the signifier that usually keeps the child in connection with the mother, which is the process of feeding. Keywords : Mother and baby relationship; development; feed.

Educação integral e integra- da: experiência na extensão universitária semi presencial

Abstract: Resumo: A pesquisa apresenta o curso de extensao a distância em Educacao Integral e Integrada oferecido pelo Setor de Educacao em parceria com a Coordenacao de Integracao de Politicas de Educacao a Distância da UFPR, e discute possiveis alteracoes em sua estrutura que possibilitem sua adequacao ao universo da escola integral. O curso, com 260 horas/aula distribuidas em dez modulos, foi desenvolvido nos Polos UAB de quatro municipios paranaenses e um gaucho. De um total de 330 alunos inscritos, 212 iniciaram o curso e destes, 106 alunos o concluiram e tiveram direito ao certificado. Analisam-se os aspectos positivos e negativos do curso referidos pelos alunos nos formularios de entrada e de saida fornecidos pela SECAD/MEC. Conclui-se que a oferta de praticas pedagogicas presenciais, intercaladas aos modulos a distância, e a obrigatoriedade do TCC centrado no universo imagetico foram consideradas fundamentais para a formacao de professores atuantes em escolas da rede publica de Educacao Basica, contribuindo para a implantacao e o desenvolvimento de programas de Educacao Integral e Integrada. Palavras chave : Educacao integradora; Educacao integral; Extensao universitaria; Educacao a distância. Abstract: The research presents the extension course in distance education offered by the holist and Integrated Education Sector in partnership with the Coordination of Integration Policy for Distance Education UFPR, and discusses possible changes in its structure enabling its adaptation to the world of full-time school. The course, 260 hours / class divided into ten modules, was developed at the poles UAB four municipalities of Parana and Rio Grande do Sul. From a total of 330 students registered, 212 started the course and of these, 106 completed and the students were entitled to the certificate. It was analyzed the positive and negative aspects of the course referred to by students in the forms of input and output provided by SECAD / MEC. It is concluded that the provision of classroom teaching practices, interspersed with remote modules, and the compulsory TCC imagery centered universe were considered essential for the training of teachers working in public schools of basic education, contributing to the establishment and development of Education programs holist and Integrated. Keywords : Integrating Education; Holistic education; Continuing education; Distance education.