A REACHABILITY TREE FOR STATECHARTS AND ANALYSIS OF SOME PROPERTIES

Statecharts are an extension to finite state machines with capability for expressing hierarchical decomposition and parallelism. They also have a mechanism called history, to remember the last visit to a superstate. An algorithm to create a reachability tree for statecharts is presented. Also shown is how to use this tree to analyse dynamic properties of statecharts; reachability from any state configuration, usage of transitions, reinitiability, deadlocks, and valid sequence of events. Owing to its powerful notation, building a reachability tree for statecharts presents some difficulties, and we show how these problems were solved in the tree we propose.

Entre a matriz portuguesa e a literatura nacional: a concepção de texto literário para João Ribeiro

This paper aims at rescuing some critical appraisals found in the high school anthology Autores Contemporâneos (1931), by the critic, philologist and writer João Ribeiro, one of the main Brazilian intellectual representatives of the first decades of the twentieth century. João Ribeiro, along with Coelho Neto and, Laudelino Freire, among others, took part in of the panel which compiled, in 1921, the Dicionário da Academia Brasileira de Letras. Therefore, we find the analytical process João Ribeiro, their theoretical observations, concepts and dilemmas which are appointed by him in literary history and criticism of the early twentieth century.