Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Júlio Henrique Araújo Pereira Machado"'
Autor:
Paulo Blauth Menezes, Júlio Henrique Araújo Pereira Machado, Cláudio Naoto Fuzitaki, Fernando Antonio Monteiro Christoph D'Andrea
Publikováno v:
The Journal of Supercomputing. 36:51-81
Nautilus is a high-level specification and programming language having abstraction mechanisms not commonly found in other programming languages inspired by its semantic domain (a categorial model named Nonsequential Automata). It constitutes an elega
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540290025
EUROCAST
EUROCAST
When modeling concurrent or parallel systems, we must be aware that basic activities of each system may be constituted by smaller activities, i.e. transitions may be conceptually refined into transactions. Nevertheless, the Unified Modeling Language
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::12fd88a07595e908159d3ab5417e0bb6
https://doi.org/10.1007/11556985_9
https://doi.org/10.1007/11556985_9
Autor:
Simone André da Costa, Júlio Henrique Araújo Pereira Machado, Paulo Blauth Menezes, Cláudio Naoto Fuzitaki
Publikováno v:
Computer Aided Systems Theory-EUROCAST 2003 ISBN: 9783540202219
EUROCAST
EUROCAST
This paper describes some of the features of Nautilus specification/ programming language that make it interesting to develop complex systems and then explains how to map a Nautilus construction into Java constructions. The Nautilus constructions pre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::267cc6f98bb115d71bc34fe0d196f731
https://doi.org/10.1007/978-3-540-45210-2_23
https://doi.org/10.1007/978-3-540-45210-2_23
Autor:
Márcia Rodrigues Notare, Paulo Blauth Menezes, Tiaraju Asmuz Diverio, Simone André da Costa, Júlio Henrique Araújo Pereira Machado
Publikováno v:
Computer Aided Systems Theory — EUROCAST 2001 ISBN: 9783540429593
EUROCAST
EUROCAST
This paper describes the conception and implementation of a learning system on Euclidean Geometry demonstrations and its knowledge base. We use the formalism of finite automata with output to represent and ordain the statements that constitute a geom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a34ef4eee3c77238a2a1b7b3daecef30
https://doi.org/10.1007/3-540-45654-6_36
https://doi.org/10.1007/3-540-45654-6_36