Статті в журналах: "Syntax diagrams"

1

Howse, John, Gem Stapleton, and John Taylor. "Spider Diagrams." LMS Journal of Computation and Mathematics 8 (2005): 145–94. http://dx.doi.org/10.1112/s1461157000000942.

Повний текст джерела

Анотація:

AbstractThe use of diagrams in mathematics has traditionally been restricted to guiding intuition and communication. With rare exceptions such as Peirce's alpha and beta systems, purely diagrammatic formal reasoning has not been in the mathematician's or logician's toolkit. This paper develops a purely diagrammatic reasoning system of “spider diagrams” that builds on Euler, Venn and Peirce diagrams. The system is known to be expressively equivalent to first-order monadic logic with equality. Two levels of diagrammatic syntax have been developed: an ‘abstract’ syntax that captures the structure of diagrams, and a ‘concrete’ syntax that captures topological properties of drawn diagrams. A number of simple diagrammatic transformation rules are given, and the resulting reasoning system is shown to be sound and complete.

Стилі APA, Harvard, Vancouver, ISO та ін.

2

THIEMANN, PETER J. "Drawing Syntax Diagrams in Haskell." Software: Practice and Experience 27, no. 8 (August 1997): 967–82. http://dx.doi.org/10.1002/(sici)1097-024x(199708)27:8<967::aid-spe114>3.0.co;2-z.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Ryazanov, Yu D. "MINIMIZATION OF SYNTAX DIAGRAMS WITH MULTIPORT COMPONENTS." Prikladnaya diskretnaya matematika, no. 41 (September 1, 2018): 85–97. http://dx.doi.org/10.17223/20710410/41/9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Ghica, Dan R., and Aliaume Lopez. "A Structural and Nominal Syntax for Diagrams." Electronic Proceedings in Theoretical Computer Science 266 (February 27, 2018): 71–83. http://dx.doi.org/10.4204/eptcs.266.4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Braz, Lisa M. "Visual syntax diagrams for programming language statements." ACM SIGDOC Asterisk Journal of Computer Documentation 14, no. 4 (September 1990): 23–27. http://dx.doi.org/10.1145/97435.97987.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Sejans, Janis, and Oksana Nikiforova. "Problems and Perspectives of Code Generation from UML Class Diagram." Scientific Journal of Riga Technical University. Computer Sciences 44, no. 1 (January 1, 2011): 75–84. http://dx.doi.org/10.2478/v10143-011-0024-3.

Повний текст джерела

Анотація:

Problems and Perspectives of Code Generation from UML Class Diagram As a result of increasing technological diversity, more attention is being focused on model driven architecture (MDA), and its standard - Unified Modeling Language (UML). UML class diagrams require correct diagram notation mapping to target programming language syntax under the framework of MDA. Currently there are plenty of CASE tools which claim that they are able to generate the source code from UML models. Therefore by combining the knowledge of a programming language, syntax rules and UML class diagram notation semantic, an experimental model for stressing the code generator can be produced, thus allowing comparison of quality of the transformation result. This paper describes a creation of such experimental models.

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Selamat, Norhanim. "Similarity Syntax Rules between DFD and UML Diagrams." International Journal of Advanced Trends in Computer Science and Engineering 8, no. 3 (June 25, 2019): 786–94. http://dx.doi.org/10.30534/ijatcse/2019/70832019.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Flower, Jean, John Howse, and John Taylor. "Nesting in Euler Diagrams: syntax, semantics and construction." Software & Systems Modeling 3, no. 1 (March 2004): 55–67. http://dx.doi.org/10.1007/s10270-003-0036-8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

NIELSEN, THOMAS D., and FINN V. JENSEN. "REPRESENTING AND SOLVING ASYMMETRIC DECISION PROBLEMS." International Journal of Information Technology & Decision Making 02, no. 02 (June 2003): 217–63. http://dx.doi.org/10.1142/s0219622003000604.

Повний текст джерела

Анотація:

This paper deals with the representation and solution of asymmetric Bayesian decision problems. We present a formal framework, termed asymmetric influence diagrams. The framework is based on the syntax and semantics of the traditional influence diagram, and allows an efficient representation of asymmetric decision problems. As opposed to existing frameworks, the asymmetric influence diagram primarily encodes asymmetry at the qualitative level and it can therefore be read directly from the model. We give an algorithm for solving asymmetric influence diagrams. The algorithm initially decomposes the asymmetric decision problem into a structure of symmetric subproblems organized as a tree. A solution to the decision problem can then be found by propagating from the leaves towards the root using existing evaluation methods to solve the subproblems.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Šopauskas, Laisvūnas. "Constituency, Explication of the Notion of Syntax, and Diagrams." Žmogus ir žodis 16, no. 4 (December 20, 2014): 44–56. http://dx.doi.org/10.15823/zz.2014.024.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Irani, P., M. Tingley, and C. Ware. "Using perceptual syntax to enhance semantic content in diagrams." IEEE Computer Graphics and Applications 21, no. 4 (2001): 76–84. http://dx.doi.org/10.1109/38.946634.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Acclavio, Matteo. "Proof Diagrams for Multiplicative Linear Logic: Syntax and Semantics." Journal of Automated Reasoning 63, no. 4 (May 22, 2018): 911–39. http://dx.doi.org/10.1007/s10817-018-9466-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Ryazanov, Yu D., and S. V. Nazina. "Building parsers based on syntax diagrams with multiport components." Prikladnaya Diskretnaya Matematika, no. 55 (2022): 102–19. http://dx.doi.org/10.17223/20710410/55/8.

Повний текст джерела

Анотація:

The problem of constructing parsers from syntax diagrams with multiport components (SD) is solved. An algorithm for constructing a parser based on the GLL algorithm is proposed, which results in the compact representation of the input chain parse forest. The proposed algorithm makes it possible to build parsers based on the SD of an arbitrary structure and does not require preliminary SD transformations. We introduce the concepts of “inference tree” and “parsing forest” for SD and describe the data structures used by the parser, such as a graph-structured stack, a parser descriptor, and a compact representation of the parsing forest. The algorithm for constructing parsers based on SD is described and an example of parser constructing is given.

Стилі APA, Harvard, Vancouver, ISO та ін.

14

LAM, VITUS S. W. "ON π-CALCULUS SEMANTICS AS A FORMAL BASIS FOR UML ACTIVITY DIAGRAMS". International Journal of Software Engineering and Knowledge Engineering 18, № 04 (червень 2008): 541–67. http://dx.doi.org/10.1142/s0218194008003787.

Повний текст джерела

Анотація:

UML activity diagrams encompass a set of notational elements for capturing the dynamic behavior of a system. Although the graphical syntax of UML activity diagrams is well-defined in the UML documentation, there is still not a commonly accepted approach for reasoning about UML activity diagrams. In this paper, we present a formalization of the execution semantics of UML activity diagrams using the π-calculus. The formalization provides a theoretical foundation and formal analysis for UML activity diagrams, as well as a starting point for building automated software tool.

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Osborne,, Timothy, and Thomas Gross,. "Constructions are catenae: Construction Grammar meets Dependency Grammar." Cognitive Linguistics 23, no. 1 (February 2012): 165–216. http://dx.doi.org/10.1515/cog-2012-0006.

Повний текст джерела

Анотація:

AbstractThe paper demonstrates that dependency-based syntax is in a strong position to produce principled and economical accounts of the syntax of constructs. The difficulty that constituency-based syntax has in this regard is that very many constructs fail to qualify as constituents. The point is evident with the box diagrams and attribute value matrices (AVMs) that some construction grammars (CxGs) use to formalize constructions; these schemata often represent fragments rather than constituents. In dependency-based syntax in contrast, constructions are catenae, whereby a catena is a chain of words linked together by dependencies. The catena is a novel but well-defined unit of syntax associated with dependency grammar (DG). The constructs of CxGs are more amenable to analyses in terms of the catenae of dependency-based syntax than to analyses in terms of the constituents of constituency-based syntax.

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Muhamad, Zainab Hassan, Dhafer AbdulAmeer Abdulmonim, and Bashar Alathari. "An integration of uml use case diagram and activity diagram with Z language for formalization of library management system." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 4 (August 1, 2019): 3069. http://dx.doi.org/10.11591/ijece.v9i4.pp3069-3076.

Повний текст джерела

Анотація:

Unified Modeling Language (UML) is the effective standard for modeling object-oriented software systems. However, the ambiguity of semantics and the absence of consistency among UML diagrams lead to lack of precisely defining the requirements of a system. On the other hand, formal methods are techniques and tools use the mathematical notations, and they involve the precise syntax and semantics of the unambiguous software requirements specification. It applied in early stages of Software Development Life Cycle (SDLC). Therefore, an integrated between UML specification and formal specification is required to reduce the requirements' ambiguity and error, and to improve the quality and security of software systems. This paper proposes an approach involves the combining UML use-case diagram and activity diagrams with Z language for formalization of Library Management System (LMS). The focus of this paper is on consistency between the UML diagrams to Z Schema, and then verified by using the Z / EVEs tool.

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Saleh, Faisal, and Mohamed El-Attar. "A scientific evaluation of the misuse case diagrams visual syntax." Information and Software Technology 66 (October 2015): 73–96. http://dx.doi.org/10.1016/j.infsof.2015.05.002.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Deufemia, Vincenzo, and Michele Risi. "Multi-Domain Recognition of Hand-Drawn Diagrams Using Hierarchical Parsing." Multimodal Technologies and Interaction 4, no. 3 (August 14, 2020): 52. http://dx.doi.org/10.3390/mti4030052.

Повний текст джерела

Анотація:

This paper presents an approach for the recognition of multi-domain hand-drawn diagrams, which exploits Sketch Grammars (SkGs) to model the symbols’ shape and the abstract syntax of diagrammatic notations. The recognition systems automatically generated from SkGs process the input sketches according to the following phases: the user’ strokes are first segmented and interpreted as primitive shapes, then by exploiting the domain context they are clustered into symbols of the domain and, finally, an interpretation of whole diagram is given. The main contribution of this paper is an efficient model of parsing suitable for both interactive and non-interactive sketch-based interfaces, configurable to different domains, and able to exploit contextual information for improving recognition accuracy and solving interpretation ambiguities. The proposed approach was evaluated in the domain of UML class diagrams obtaining good results in terms of recognition accuracy and usability.

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Kalyanov, G. N., B. V. Kupriyanov, and O. V. Lukinova. "Adaptation of the DFD technology in the modeling of business systems in the environment of RDS." Open Education 23, no. 2 (May 14, 2019): 61–68. http://dx.doi.org/10.21686/1818-4243-2019-2-61-68.

Повний текст джерела

Анотація:

The article is devoted to the description of structural methods of processes modeling, represented by visual languages of business processes modeling of socio-economic systems, designed not only for static functional/information modeling of processes, but also allowing to simulate their behavior.The description of grammar of structural languages of designing business processes of the enterprise which subsets it is offered to adapt for expansion of input language of the tool complex of RDS (Calculation of Dynamic Systems) that will allow to use opportunities of a complex for the solution of problems of the analysis not only dynamic, but also business models of organizational and economic systems are given. Provides the syntax and semantics of DFD, STD, ERD-notations. For the formal description of the syntax it is proposed to use the apparatus of mixed grammars, which are a combination of graph and ordinary grammars. The article describes the grammar that generates the simplest dialect of DFD-technology, informally describes the semantic aspects of the language, in particular the semantics of relations between the objects of the language.The basic constructions of the proposed language, its syntax and semantics are presented. Classification of potential errors is given. Non-terminal symbols of the language are presented in detail: diagram, DFD-diagram, STD-diagram, ERD-diagram, mini-specification, service structures are defined (including data dictionary).The types and sorts of evaluation criteria in the problems of business models quality analysis, syntax errors detection, as well as static semantics errors during their implementation in RDS are described. Static analysis of the business model is carried out in three directions which are syntax, semantics and pragmatics. Analysis methods can be divided into the following classes: syntactical, i.e. those that reveal violations of the syntax of the diagram representation language; semantic, revealing violations of the semantic representation of diagrams and their elements; methods of analyzing the quality of the business model, evaluated by the parameters of connectivity and cohesion.The implementation of the described methods and mechanisms is assumed as an additional module of simulation modeling of business processes as part of the RDS software complex, which is a tool for building research stands that provide the process of modeling, analysis and synthesis of control systems. The complex was implemented in the framework of projects implemented in the IPU RAS. The article defines the purpose, composition and structure of the business process simulation module.

Стилі APA, Harvard, Vancouver, ISO та ін.

20

El-Attar, Mohamed. "Evaluating and empirically improving the visual syntax of use case diagrams." Journal of Systems and Software 156 (October 2019): 136–63. http://dx.doi.org/10.1016/j.jss.2019.06.096.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

STEIN, DOMINIK, STEFAN HANENBERG, and RAINER UNLAND. "JOIN POINT DESIGNATION DIAGRAMS: A GRAPHICAL REPRESENTATION OF JOIN POINT SELECTIONS." International Journal of Software Engineering and Knowledge Engineering 16, no. 03 (June 2006): 317–46. http://dx.doi.org/10.1142/s0218194006002811.

Повний текст джерела

Анотація:

The specification of join point selections (also known as "pointcuts") is a major design issue in Aspect-Oriented Software Development. Aspect-oriented systems generally provide specific language constructs (subsumed by the term "pointcut language") for specifying such a join point selection. Pointcut languages differ widely with respect to their syntax and semantics. Consequently, developers familiar with one specific language can hardly benefit from this knowledge when designing and implementing pointcuts in another language. This implies that developers working with different aspect-oriented languages can hardly communicate their design to each other, and knowledge about aspect-oriented design can hardly be transferred among developers developing in different languages. In order to overcome this problem, we present novel specification means based on the UML to represent diverse ways of join point selections — without relying on language-specific syntax and semantics. Instead, the proposed language constructs are able to express join point selections in a variety of different aspect-oriented programming languages.

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Li, Chang Hua, Zhi Jie Li, Long Fei Yuan, Xin Liu, and Fan Zhang. "A Retrieval Model of Spatial Configuration Based on Space Syntax Histogram." Advanced Materials Research 1044-1045 (October 2014): 1011–15. http://dx.doi.org/10.4028/www.scientific.net/amr.1044-1045.1011.

Повний текст джерела

Анотація:

With the application of space syntax theory in urban planning and architecture designing is growing continuously, the number of the urban spatial configuration models based on space syntax will be more and more. However, the use of these models still lacks of some intelligent retrieval models currently. This paper splits the urban spatial configuration into regular grid structure, and uses visibility segmentation to construct the relationship diagrams and then extracts space syntax variables from each node to form the four-dimensional histogram. Furthermore, this method calculates the similarity among models through the measurement of the histogram distance, thus realizes the retrieval of the urban spatial configuration. Experimental results show that this model has a satisfactory retrieval results.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Wiedemann, Milan, Graham Thew, Urška Košir, and Anke Ehlers. "lcsm: An R package and tutorial on latent change score modelling." Wellcome Open Research 7 (May 11, 2022): 149. http://dx.doi.org/10.12688/wellcomeopenres.17536.1.

Повний текст джерела

Анотація:

Latent change score models (LCSMs) are used across disciplines in behavioural sciences to study how constructs change over time. LCSMs can be used to estimate the trajectory of one construct (univariate) and allow the investigation of how changes between two constructs (bivariate) are associated with each other over time. This paper introduces the R package lcsm, a tool that aims to help users understand, analyse, and visualise different latent change score models. The lcsm package provides functions to generate model syntax for basic univariate and bivariate latent change score models with different model specifications. It is also possible to visualise different model specifications in simplified path diagrams. An interactive application illustrates the main functions of the package and demonstrates how the model syntax and path diagrams change based on different model specifications. This R package aims to increase the transparency of reporting analyses and to provide an additional resource to learn latent change score modelling.

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Saeed, Mazin, Faisal Saleh, Sadiq Al-Insaif, and Mohamed El-Attar. "Empirical validating the cognitive effectiveness of a new feature diagrams visual syntax." Information and Software Technology 71 (March 2016): 1–26. http://dx.doi.org/10.1016/j.infsof.2015.10.012.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Bonchi, Filippo, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, and Fabio Zanasi. "String Diagram Rewrite Theory I: Rewriting with Frobenius Structure." Journal of the ACM 69, no. 2 (April 30, 2022): 1–58. http://dx.doi.org/10.1145/3502719.

Повний текст джерела

Анотація:

String diagrams are a powerful and intuitive graphical syntax, originating in theoretical physics and later formalised in the context of symmetric monoidal categories. In recent years, they have found application in the modelling of various computational structures, in fields as diverse as Computer Science, Physics, Control Theory, Linguistics, and Biology. In several of these proposals, transformations of systems are modelled as rewrite rules of diagrams. These developments require a mathematical foundation for string diagram rewriting: whereas rewrite theory for terms is well-understood, the two-dimensional nature of string diagrams poses quite a few additional challenges. This work systematises and expands a series of recent conference papers, laying down such a foundation. As a first step, we focus on the case of rewrite systems for string diagrammatic theories that feature a Frobenius algebra. This common structure provides a more permissive notion of composition than the usual one available in monoidal categories, and has found many applications in areas such as concurrency, quantum theory, and electrical circuits. Notably, this structure provides an exact correspondence between the syntactic notion of string diagrams modulo Frobenius structure and the combinatorial structure of hypergraphs. Our work introduces a combinatorial interpretation of string diagram rewriting modulo Frobenius structures in terms of double-pushout hypergraph rewriting. We prove this interpretation to be sound and complete and we also show that the approach can be generalised to rewriting modulo multiple Frobenius structures. As a proof of concept, we show how to derive from these results a termination strategy for Interacting Bialgebras, an important rewrite theory in the study of quantum circuits and signal flow graphs.

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Sunardi, Sunardi, Raden Arief Nugroho, and Budi Harjo. "Identifikasi Permasalahan Pembelajaran Mahasiswa Tunanetra Pada Mata Kuliah Sintaksis Bahasa Inggris: Studi Kasus di Universitas Dian Nuswantoro." INKLUSI 1, no. 2 (December 1, 2014): 291. http://dx.doi.org/10.14421/ijds.010209.

Повний текст джерела

Анотація:

This study focuses on identifying the problems faced by visually impaired students in teaching-learning process of English syntax course at Faculty of Humanities, Dian Nuswantoro University in 2014. English syntax, as one of the subjects studied in the English study program, is considered as a challenging subject for visually impaired students as it involves visual perception, such as graphics and images. This research was a descriptive qualitative one. The researchers collected the data by using an in-depth interview. This involved 2 visually impaired students who experienced the learning process of English syntax and 3 lecturers of Dian Nuswantoro University. The discussion was limited on the issues around the needs for creating an accessible learning media and kinds of difficulties faced by the visually impaired students. From the in-depth interview, there are three major findings that are highlighted: a) the needs to overcome all inaccessible English syntax learning materials; b) general difficulties faced by visually impaired students in English syntax subject; c) technical difficulties in drawing tree structure diagrams. Then, these highlighted problems and findings are used as to formulate the recommendations of this study.

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Liu, Shaoying. "A Formal Definition of FRSM and Applications." International Journal of Software Engineering and Knowledge Engineering 08, no. 02 (June 1998): 253–81. http://dx.doi.org/10.1142/s0218194098000145.

Повний текст джерела

Анотація:

FRSM (Formal Requirements Specification Method) is a structured formal language and method for requirements analysis and specification construction based on data flow analysis. It uses a formalized DeMarco data flow diagram to describe the overall structure of systems and a VDM-SL like formal notation to describe precisely the functionality of components in the diagrams. This paper first describes the formal syntax and semantics of FRSM and then presents an example of using the axiom and inference rules given in the definition of the formal semantics for checking consistency of specifications. A case study of applying FRSM to a practical example is described to demonstrate the principle of constructing requirements specifications and to uncover the benefits and deficiencies of FRSM.

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Łabiak, Grzegorz, and Grzegorz Borowik. "Statechart-based Controllers Synthesis in FPGA Structures with Embedded Array Blocks." International Journal of Electronics and Telecommunications 56, no. 1 (March 1, 2010): 13–24. http://dx.doi.org/10.2478/v10177-010-0002-7.

Повний текст джерела

Анотація:

Statechart-based Controllers Synthesis in FPGA Structures with Embedded Array BlocksStatechart diagrams, in general, are visual formalism for description of complex systems behaiour. Digital controllers, which act as reactive systems, can be very conveniently modeled with statecharts and efficiently synthesized in modern programmable devices. The paper presents in details syntax and semantics of statecharts and new implementation scheme. The issue of statecharts synthesis is not still ultimately solved. Main feature of the presented approach is the transformation of statechart diagrams into Finite State Machine, and through KISS format, functional decomposition and mapping into Embedded Memory Blocks. Embedded Memory are part of the modern programmable devices.

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Yin, Liran, Tao Wang, and Kemi Adeyeye. "A Comparative Study of Urban Spatial Characteristics of the Capitals of Tang and Song Dynasties Based on Space Syntax." Urban Science 5, no. 2 (April 2, 2021): 34. http://dx.doi.org/10.3390/urbansci5020034.

Повний текст джерела

Анотація:

Space syntax has been widely used in studies with historical components to developing a common analytical language for the comparative study of urban morphology across time and space by visual diagrams. This paper uses space syntax to analyse the inner and outer city parts of the daily life of residents in the capital cities of two dynasties, Tang and Song, to reveal the impact of changes in urban planning on the overall spatial structure of the city, the structure of commercial space, and the role of urban squares in the two dynasties under centralised rule. Based on the quantitative analysis, the results show significant differences between the Tang and Song dynasties in all three aspects of comparison. The changes in the Tang and Song dynasties’ capital cities result from the interaction between the materiality of the ancient Chinese capital city form and the spatial function of the city, and the analysis of space syntax is useful for interpreting their relevance.

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Laguna, Miguel, José Marqués, and Guillermo Rodríguez-Cano. "Feature diagram formalization based on directed hypergraphs." Computer Science and Information Systems 8, no. 3 (2011): 611–33. http://dx.doi.org/10.2298/csis100804016l.

Повний текст джерела

Анотація:

Feature models are used to represent the variability and commonality of software product lines (SPL), and to decide on the configuration of specific applications. Several variants based on tree or graph hierarchical structures have been proposed. These structures are completed with additional constraints, generally expressed in parallel with the feature diagram. This paper proposes the use of hypergraphs to integrate both concepts in a unique characterization. Therefore, the definition, validation and selection of feature configurations can be internally based on the hypergraph properties and well-known algorithms, while the concrete visual syntax remains unchanged for domain engineers. The implemented hypergraph algorithms have been tested using a complete set of feature diagrams. Finally a feature meta-model can be derived directly from the formal definitions, providing the foundations for building feature modeling tools.

Стилі APA, Harvard, Vancouver, ISO та ін.

31

BUSONIU, PAULA-ANDRA, JOHANNES OETSCH, JÖRG PÜHRER, PETER SKOČOVSKÝ, and HANS TOMPITS. "SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support." Theory and Practice of Logic Programming 13, no. 4-5 (July 2013): 657–73. http://dx.doi.org/10.1017/s1471068413000410.

Повний текст джерела

Анотація:

AbstractIn this paper, we present SeaLion, an integrated development environment (IDE) for answer-set programming (ASP).SeaLionprovides source-code editors for the languages ofGringoandDLVand offers popular amenities like syntax highlighting, syntax checking, code completion, visual program outline, and refactoring functionality. The tool has been realised in the context of a research project whose goal is the development of techniques to support the practical coding process of answer-set programs. In this respect,SeaLionis the first IDE for ASP that provides debugging features that work for real-world answer-set programs and supports the rich languages of modern answer-set solvers. Indeed,SeaLionimplements a stepping-based debugging approach that allows the developer to quickly track down programming errors by simply following his or her intuitions on the intended semantics. Besides that,SeaLionsupports ASP development using model-driven engineering techniques including domain modelling with extended UML class diagrams and visualisation of answer sets in corresponding instance diagrams. Moreover, customised visualisation as well as visual editing of answer sets is realised by the Kara plugin ofSeaLion. Further implemented features are a documentation generator based on the Lana annotation language, support for external solvers, and interoperability with external tools.SeaLioncomes as a plugin of the popular Eclipse platform and provides interfaces for future extensions of the IDE.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Боброва, Ангелина Сергеевна, and Татьяна Викторовна Сальникова. "LOGIC AND DIAGRAMS. TEACHING EXPERIENCE." Логико-философские штудии, no. 1 (March 15, 2022): 23–41. http://dx.doi.org/10.52119/lphs.2022.50.23.004.

Повний текст джерела

Анотація:

В последние десятилетия университетские курсы логики довольно быстро сдают свои позиции. Исключением не являются и академические философские программы, для которых логика всегда являлась важной профильной дисциплиной. Логика оказывается слишком сложной, слишком абстрактной, а потому слишком оторванной от философии. В поисках выхода из сложившейся ситуации мы решили модифицировать курс, состоящий из привычных теорий, и включить в него диаграмматические подходы Венна, Лейбница, Пирса. Круговые схемы Эйлера при этом, разумеется, сохраняли свои позиции. Мы исходили из того, что студентам важно продемонстрировать задачи логики (те, которые предполагают вводные курсы): логика интересуется логическими отношениями, выводами и доказательствами, а не только тем, как они представлены через конкретные знаки конкретных теорий. В этой работе мы описываем результаты нашей коррекции. Безусловно, диаграммы не способны стать универсальным решением (они подходят далеко не всем), но для кого-то они могут показывать иконичность логических формул и процедуру вывода, приоткрывая тем самым природу логики. Такой вариант изложения материала обращает логику к философии и повышает ее привлекательность для ребят, которым не просто дается алгебра. In recent years, logic courses are quickly losing ground. The introductory course of logic for philosophers, which has always been an integral part of their major, is not an exception. Logic turns out to be too complicated, too abstract, and too separated from philosophy. Trying to find a way out, we decided to modify the course by including diagrammatical approaches of Venn, Leibniz and Peirce. The set of known theories and the traditional functions of Euler’s diagrams were preserved. We reasoned that diagrams could highlight that it is more important to understand key goals of logic (logical relations, consequence, inferences, etc. studies) rather than the syntax (certain signs) of certain theories. This paper reports the results of our investigations. We agree that diagrams cannot be seen as a universal solution (they cannot be great for everyone), but they clarify both the inferential processes and essence of logic for some students. This approach can turn logic back to philosophy, and this step can increase the attraction of logic even for those who are not much of algebra fans.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Vinther, Jane. "Visual Interactive Syntax Learning: A Case of Blended Learning." Dansk Universitetspædagogisk Tidsskrift 3, no. 6 (November 1, 2008): 33–38. http://dx.doi.org/10.7146/dut.v3i6.5607.

Повний текст джерела

Анотація:

The integration of the computer as a tool in language learningat the tertiary level brings several opportunities for adaptingto individual student needs, but lack of appropriate material suited for the level of student proficiency in Scandinavia has meant that university teachers have found it difficult to blendthe traditional approach with computer tools. This article will present one programme (VISL) which has been developed with the purpose of supporting and enhancing traditional instruction. Visual Interactive Syntax Learning (VISL) is a programme which is basically a parser put to pedagogical use. The pedagogical purpose is to teach English syntax to university students at an advanced level. The programme allows the students to build sophisticated tree diagrams of Englishsentences with provisions for both functions and forms (simple or complex, incl. subclauses). VISL was initiated as an attempt to facilitate the metalinguistic learning process. Thisarticle will present VISL as a pedagogical tool and tries to argue the case for the benefits of blending traditional lecturing with modern technology while pointing out some of the issues involved.

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Jacobs, Bart, Aleks Kissinger, and Fabio Zanasi. "Causal inference via string diagram surgery." Mathematical Structures in Computer Science 31, no. 5 (May 2021): 553–74. http://dx.doi.org/10.1017/s096012952100027x.

Повний текст джерела

Анотація:

Abstract Extracting causal relationships from observed correlations is a growing area in probabilistic reasoning, originating with the seminal work of Pearl and others from the early 1990s. This paper develops a new, categorically oriented view based on a clear distinction between syntax (string diagrams) and semantics (stochastic matrices), connected via interpretations as structure-preserving functors. A key notion in the identification of causal effects is that of an intervention, whereby a variable is forcefully set to a particular value independent of any prior propensities. We represent the effect of such an intervention as an endo-functor which performs ‘string diagram surgery’ within the syntactic category of string diagrams. This diagram surgery in turn yields a new, interventional distribution via the interpretation functor. While in general there is no way to compute interventional distributions purely from observed data, we show that this is possible in certain special cases using a calculational tool called comb disintegration. We demonstrate the use of this technique on two well-known toy examples: one where we predict the causal effect of smoking on cancer in the presence of a confounding common cause and where we show that this technique provides simple sufficient conditions for computing interventions which apply to a wide variety of situations considered in the causal inference literature; the other one is an illustration of counterfactual reasoning where the same interventional techniques are used, but now in a ‘twinned’ set-up, with two version of the world – one factual and one counterfactual – joined together via exogenous variables that capture the uncertainties at hand.

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Putri, Alfini Iasya. "A SYNTACTIC ANALYSIS ON THE ENGLISH TRANSLATION OF SURAH AL QIYAMAH USING TREE DIAGRAMS." LET: Linguistics, Literature and English Teaching Journal 7, no. 1 (July 17, 2017): 17. http://dx.doi.org/10.18592/let.v7i1.1510.

Повний текст джерела

Анотація:

In this research, the researcher analyzed syntactical patterns of the whole verses (ayah) in the English translation of surah Al Qiyamah, which has 40 ayah, using tree diagrams theory to be able drawing and seeing hierarchical syntax structure of the verses in the surah. After analyzing the data, the researcher finally found twenty four syntactic patterns of the surah: there are sixteen patterns of sentence and eight patterns of phrases. The phrases patterns are : a) the pattern of noun phrase appears in one position, b) the patterns of verb phrase appear in three position, c) the patterns of adjective phrase appear in two position, d) the pattern of prepositional phrase appears in one position, and e) the pattern of complement phrase appears in one position

Стилі APA, Harvard, Vancouver, ISO та ін.

36

Hermann, Frank, Hartmut Ehrig, and Gabriele Taentzer. "A Typed Attributed Graph Grammar with Inheritance for the Abstract Syntax of UML Class and Sequence Diagrams." Electronic Notes in Theoretical Computer Science 211 (April 2008): 261–69. http://dx.doi.org/10.1016/j.entcs.2008.04.048.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Michele, Nuovo. "MyETL: A Java Software Tool to Extract, Transform, and Load Your Business." CRIS - Bulletin of the Centre for Research and Interdisciplinary Study 2015, no. 2 (December 1, 2015): 41–51. http://dx.doi.org/10.1515/cris-2015-0011.

Повний текст джерела

Анотація:

Abstract The project follows the development of a Java Software Tool that extracts data from Flat File (Fixed Length Record Type), CSV (Comma Separated Values), and XLS (Microsoft Excel 97-2003 Worksheet file), apply transformation to those sources, and finally load the data into the end target RDBMS. The software refers to a process known as ETL (Extract Transform and Load). Those kinds of systems are called ETL systems. The analysis involved research on the theory behind the ETL process as well as the theory behind the various phases of the applied methodology. Also an in-depth look at the design and architecture of the software has been made. To create a complete design needed to be used for the implementation, different techniques and diagrams where used to visualise and refine ideas: UML class diagrams, System Architecture Diagrams, Physical Data Model, and Project Timeline. The implementation of the project involved the translation of the system architecture into working software using the Extreme Programming Methodology and the Java programming language. A mapping algorithm module and design patterns have been used in the implementation phase. A transformation syntax has been defined to achieve data transformation. The testing of the software was done in the form of a unit test. A formal test plan was prepared to ensure that the main features of the system worked as defined. An error handling code implementation has been developed to avoid an unexpected crash of the system and to communicate to the user problems or errors.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Pugh, Zachary H., and Douglas J. Gillan. "Nodes Afford Connection: A Pilot Study Examining the Design and Use of a Graphical Modeling Language." Proceedings of the Human Factors and Ergonomics Society Annual Meeting 65, no. 1 (September 2021): 1024–28. http://dx.doi.org/10.1177/1071181321651150.

Повний текст джерела

Анотація:

External representations such as diagrams facilitate reasoning. Many diagramming systems and notations are amenable to manipulation by actual or imagined intervention (e.g., transposing terms in an equation). Such manipulation is constrained by user-enforced constraints, including rules of syntax and semantics which help preserve the representation’s validity. We argue that the concepts of affordances and signifiers can be applied to understand such representations, and we suggest the term graphical affordance to refer to rule-constrained syntactic manipulation of an external representation. Following this argument, we examine a graphical modeling language in terms of these graphical affordances, and we present a pilot study examining how participants interact with the modeling language. Preliminary results suggest that using the modeling language, as opposed to prose representation, influences user behavior in a manner aligned with the graphical affordances and signifiers of the modeling language.

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Shan, Laixiang, Jun Qin, Mingshi Chen, and Zheng Qin. "Degeneralization Algorithm for Generation of Büchi Automata Based on Contented Situation." Journal of Applied Mathematics 2015 (2015): 1–10. http://dx.doi.org/10.1155/2015/516104.

Повний текст джерела

Анотація:

We present on-the-fly degeneralization algorithm used to transform generalized Büchi automata (GBA) into Büchi Automata (BA) different from the standard degeneralization algorithm. Contented situation, which is used to record what acceptance conditions are satisfiable during expanding LTL formulae, is attached to the states and transitions in the BA. In order to get the deterministic BA, the Shannon expansion is used recursively when we expand LTL formulae by applying the tableau rules. On-the-fly degeneralization algorithm is carried out in each step of the expansion of LTL formulae. Ordered binary decision diagrams are used to represent the BA and simplify LTL formulae. The temporary automata are stored as syntax directed acyclic graph in order to save storage space. These ideas are implemented in a conversion algorithm used to build a property automaton corresponding to the given LTL formulae. We compare our method to previous work and show that it is more efficient for four sets of random formulae generated by LBTT.

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Lemenkova, Polina. "R Libraries {dendextend} and {magrittr} and Clustering Package scipy.cluster of Python For Modelling Diagrams of Dendrogram Trees." Carpathian Journal of Electronic and Computer Engineering 13, no. 3 (September 1, 2020): 5–12. http://dx.doi.org/10.2478/cjece-2020-0002.

Повний текст джерела

Анотація:

AbstractThe paper presents a comparison of the two languages Python and R related to the classification tools and demonstrates the differences in their syntax and graphical output. It indicates the functionality of R and Python packages {dendextend} and scipy.cluster as effective tools for the dendrogram modelling by the algorithms of sorting and ranking datasets. R and Python programming languages have been tested on a sample dataset including marine geological measurements. The work aims to detect how bathymetric data change along the 25 bathymetric profiles digitized across the Mariana Trench. The methodology includes performed hierarchical cluster analysis with dendrograms and plotted clustermap with marginal dendrograms. The statistical libraries include Matplotlib, SciPy, NumPy, Pandas by Python and {dendextend}, {pvclust}, {magrittr} by R. The dendrograms were compared by the model-simulated clusters of the bathymetric ranges. The results show three distinct groups of the profiles sorted by the elevation ranges with maximal depths detected in a group of profiles 19-21. The dendrogram visualization in a cluster analysis demonstrates the effective representation of the data sorting, grouping and classifying by the machine learning algorithms. The programming codes presented in this study enable to sort a dataset in a similar research aimed to group data based on the similarity of attributes. Effective visualization by dendrograms is a useful modelling tool for the geospatial management where data ranking is required. Plotting dendrograms by R, comparing to Python, presented functional and sophisticated algorithms, refined design control and fine graphical data output. The interdisciplinary nature of this work consists in application of the coding algorithms for spatial data analysis.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Gorlée, Dinda L. "From words and sentences to interjections: The anatomy of exclamations in Peirce and Wittgenstein." Semiotica 2015, no. 205 (June 1, 2015): 37–86. http://dx.doi.org/10.1515/sem-2015-0011.

Повний текст джерела

Анотація:

AbstractInterjections are exclamatory signs fostering a realistic conception of the perils and uncertainties of human experience. Natural interjections are reactionary signs in degenerate pre-signs (preverbs or prenouns), unconnected to other syntactic forms of grammar. The simplicity of natural interjections are distinguished from the more complex occasional interjections, expressed in full pseudo-sentences with grammatical constructions. The prehistory of the natural interjections are first the simple cries of babies, and second the artificial construction of pidgin (creolization) of mixed languages. In interjections, literal language becomes transformed into figurative and metaphorical “language,” that is intermedial speech with vocalization and gestures. Peirce’s “syntax” (Charles Sanders Peirce 1839–1914) argues for the pragmatic interjections in the exclamations of spontaneous cries and shouts. In the framework of Peirce’s logical categories, interjections represent first of secondness. The degenerate form analyzes the vague or indeterminate meaning through pictures of diagrams. Wittgenstein’s social “grammar” (Ludwig Wittgenstein 1889–1951) of language-games is subject to cultural forms of life. Wittgenstein disagrees on accepting the “nonsensical” or meaningless interjections, but in his later writings he will agree to giving the interjections fuzzy meanings.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Sedlacek, Peter, Marek Kvet, and Monika Václavková. "Development of FRIMAN – Supporting Tool for Object Oriented Programming Teaching." Open Computer Science 11, no. 1 (December 17, 2020): 90–98. http://dx.doi.org/10.1515/comp-2020-0117.

Повний текст джерела

Анотація:

AbstractThe main goal of this contribution is to present the current developmental state of FRIMAN – the graphical development environment designed to support the teaching process of the object-oriented paradigm. FRIMAN project has two main purposes: 1. simplifying the understanding of the basics of the object-oriented programming for JAVA language beginners, 2. teaching students of applied informatics to collaborate in bigger project development. Therefore, an application called FRIMAN has been developed at the Faculty of Management Science and Informatics at the University of Žilina. This project is developed by students of Master degrees under the leaderships of experienced software developers. The suggested system consists of several modules. In this paper, we focus on the description of selected modules and their current functionality as well as description of future plans for this project and brief description of FRIMAN development process. Attention is paid to a module for class management and a graphical code editor, which enables the creation of method bodies using flow diagrams without the necessity of programming language syntax knowledge. Based on good evaluation by the development team preparing changes in the high school education process, the current application is planned to be applied in practice.

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Katre, Mandeep, Jaya Gaur, Manas Srivastava, Ritik Gupta, and Sourodeep Ghosh Roy. "Digital Content Editor with Markdown Support." International Journal for Research in Applied Science and Engineering Technology 10, no. 3 (March 31, 2022): 1352–58. http://dx.doi.org/10.22214/ijraset.2022.40883.

Повний текст джерела

Анотація:

Abstract: During Covid-19, up to 94% of students got affected. Not just students, but largely teachers faced even more difficulties to adjust with online teaching. It became crucial to have a well-formed study material, in order to teach online effectively. Any well written material isn’t enough for students to study. It needs to be interactive. Present tools available to create interactive content are either not sufficient or expensive to use. Most of them are tedious to operate, when used to create a scale. This editor tool aims to provide a platform that overcomes all the problems mentioned regarding the study content to students. Making online content creation easy, effective and joyful for educators in the pandemic times as well as for the future. This research paper focuses on creating a comprehensive digital content creation tool that supports parameters that are required for creation or modern digital content, using markdown, katex. It aims to satisfy the needs of multiple user groups, especially educators, institutes and teachers. Keywords: Digital Content Management, Markdown, Katex, Code snippet, Syntax Highlighter, Mathematical Expressions, UML diagrams, flowchart, Educators, Institutes

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Blair, Sarah. "Pursuing the prepositions of drawing." Drawing: Research, Theory, Practice 5, no. 1 (April 1, 2020): 11–28. http://dx.doi.org/10.1386/drtp_00017_1.

Повний текст джерела

Анотація:

This article is part of a wider research project exploring connections between ideas of grammar and drawing. Here, prepositions are the focus ‐ tiny, overlooked, undeniably ubiquitous words that articulate crucial relations between their dominant cousins, verbs and nouns. They are dwelt on here for carrying deep metaphorical overtones and having considerable potential for visual engagement. The discussion is situated ‐ in section 1 ‐ via the playfully poetical philosophy of Michel Serres, and ‐ in section 2 ‐ through Barbara Tversky’s thought-provoking analyses of highly integrated verbal-visual patterning within the mechanics of thinking. Section 3 introduces the author’s visual glossary of grammar, currently in development. This aims to present the underpinning energy of grammatical forms which are key to language production, using simple visualizations to communicate the aesthetic drive of syntax in its organization of words. The digital drawings presented hark back to the formalized modernist abstractions considered in the first section, but also to the glyphs and basic visual vocabulary of common diagrams that have been analysed by Tversky. The article ends by suggesting that the crucial qualities of prepositions ‐ being on the edge and in between, rather than obviously central to meaning like nouns and verbs ‐ resonate particularly well with current tendencies in drawing practice and wider cultural debates.

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Jian, Pengpeng, Chao Sun, Xinguo Yu, Bin He, and Meng Xia. "An End-to-End Algorithm for Solving Circuit Problems." International Journal of Pattern Recognition and Artificial Intelligence 33, no. 07 (June 7, 2019): 1940004. http://dx.doi.org/10.1142/s0218001419400044.

Повний текст джерела

Анотація:

This paper presents an end-to-end algorithm for solving circuit problems in secondary physics. A key challenge in solving circuit problems is to automatically understand circuit problems over the modals of both text and schematic. Existing methods have a limited capacity in problem understanding due to the they cannot deal with the numerous expressions of problems in natural language and the various circuit diagrams. In fact that this paper, a batch of methods is proposed to work against the challenge of solving circuit problems. The problem understanding is modeled as a problem of relation extraction and a scheme is proposed to extract relations from both text and schematic. A syntax–semantics model is adopted to extract explicit relations from text, whereas a unit-theorem-based method is proposed to extract implicit relations. And a mesh search method is proposed to extract relations from schematic. Based on the result of problem understanding, an algorithm is proposed to produce the solutions of circuit problems, in which the solutions are presented in a readable way. The experimental results demonstrate the effectiveness of the proposed algorithm in solving circuit problems. To the best of our knowledge, this paper is the first literature which reports the quantitative results in understanding and solving circuit problems.

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Popa, Lucreţia, Ştefan-Iulian Moise, Victor Moise, Vasilica Ştefan, and Iulian Tabără. "Structural and kinematic analysis of a shutter from monocoque trailer." E3S Web of Conferences 112 (2019): 03021. http://dx.doi.org/10.1051/e3sconf/201911203021.

Повний текст джерела

Анотація:

The bodies of trucks or trailers are provided with automatic folding shutters to ease the discharge of the transported materials. Typically, these shutters are powered by mechanisms that have active motor groups such as RRTaR or RR-RR-RTaR (i.e. motor dice or triads) and passive motor groups such as RRR, RR-RR-RR etc. If the technological forces are high and the relative speeds between the elements forming the steering coupler are small, the motor groups are formed by rigid bars and hydraulic cylinders. If relatively high gear ratios are required, then pneumatic cylinders may be used. If required relatively high speeds in the driving couplings, then you can use pneumatic cylinders. This paper presents structural and kinematic analysis of a shutter from a trailer used to transport bulk agricultural products, discharge towards the back. For the kinematic analysis of the folding shutter mechanism, computational procedures written in the Matlab syntax are used. The results of the calculations are presented in tabular and diagrams. After the cinematic analysis of the mechanism, it is possible to perform its cinetostatic analysis, i.e. the determination of the reactions from the kinematic couplers, as well as the hydraulic force in the hydraulic cylinder. Results can be used for the dimensional verification of the chosen elements.

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Wang, Tiexin, Jingwen Cao, Chuanqi Tao, Zhibin Yang, Yi Wu, and Bohan Li. "A Configurable Semantic-Based Transformation Method towards Conceptual Models." Discrete Dynamics in Nature and Society 2020 (September 27, 2020): 1–14. http://dx.doi.org/10.1155/2020/6718087.

Повний текст джерела

Анотація:

Conceptual models are built to depict and analyze complex systems. They are made of concepts and relationships among these concepts. In a particular domain, conceptual models are helpful for different stakeholders to reach a clear and unified view of domain problems. However, the process of building conceptual models is time-consuming, tedious, and expertise required. To improve the efficiency of the building process, this paper proposes a configurable semantic-based (semi-) automatic conceptual model transformation methodology (SbACMT) that tries to reuse existing conceptual models to generate new models. SbACMT contains three parts: (i) a configurable semantic relatedness computing method building on the structured linguistic knowledge base “ConceptNet” (SRCM-CNet), (ii) a specific meta-model, which follows the Ecore standard, defines the rules of applying SRCM-CNet to different conceptual models to automatically detect transformation mappings, and (iii) a multistep matching and transformation process that employs SRCM-CNet. A case study is carried out to detail the working mechanism of SbACMT. Furthermore, through a systematically analysis of this case study, we validate the performance of SbACMT. We prove that SbACMT can support the automatic transformation process of conceptual models (e.g., class diagrams). The scalability of SbACMT can be improved by adapting the meta-model and predefined syntax transformation rules.

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Sazonova, Svetlana, A. Lemeshkin, and Valeriy Popov. "Features of software development using arrays in an object-oriented environment." Modeling of systems and processes 14, no. 4 (January 8, 2022): 90–100. http://dx.doi.org/10.12737/2219-0767-2021-14-4-90-100.

Повний текст джерела

Анотація:

The features of software development using static and dynamic arrays in the C ++ Builder object-oriented environment are considered. The syntax of various options for creating static and dynamic arrays in the C ++ Builder language is considered in detail. Examples of working with static and dynamic arrays in C ++ Builder developed by the authors and the corresponding algorithms are presented in the form of block diagrams, program codes and program interfaces. Examples of program development are given using one-dimensional and multidimensional arrays. Examples of memory allocation are given for dynamic arrays. The choice of the required method for solving the problem is substantiated, taking into account the available input data and taking into account the expected results, as well as the peculiarities of their obtaining and processing. The external specification and the main features of the solution of the assigned tasks are considered. The development of algorithms and programs for solving problems using arrays in the C ++ Builder environment is the basis for solving engineering and technical problems using software on a computer. The proposed approaches can be used in practice, since the algorithms outlined in the work will serve as a complex example in solving the set engineering and technical problems.

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Afanasieva, Irina, Fedor Novikov, and Ludmila Fedorchenko. "Methodology for Development of Event-driven Software Systems using CIAO Specification Language." SPIIRAS Proceedings 19, no. 3 (June 1, 2020): 481–514. http://dx.doi.org/10.15622/sp.2020.19.3.1.

Повний текст джерела

Анотація:

Event-driven software systems, belonging to the class of systems with complex behavior in the scientific literature, are reactive systems, which react to the same input effect in different ways depending on their state and background. It is convenient to describe such systems using state-transition models utilizing special language tools, both graphical and textual. Methodology for automated development of systems with complex behavior using the designed CIAO language (Cooperative Interaction of Automata Objects), which allows formally specifying the required behavior based on an informal description of the reacting system, is presented. An informal description of a reacting system can be provided verbally in a natural language or in another way adopted in a specific domain. Further, according to this specification in the CIAO language, a software system for interacting automata in the C++ programming language is generated with a special system. The generated program implements a behavior guaranteed to correspond to a given specification and original informal description. CIAO provides both graphical and textual notation. Graphic notation is based on an extended notation of state machine diagrams and component diagrams of the unified modeling language UML, which are well established in describing the behavior of event-driven systems. The text syntax of the CIAO language is described by context-free grammar in regular form. Automatically generated C++ code allows using of both library and any external functions written manually. At the same time, the evident correspondence of the formal specification and the generated code is preserved on conditions that the external functions conform to their specifications. As an example, an original solution to D. Knut's problem of a responsive elevator control system is proposed. The effectiveness of the proposed methodology is demonstrated, since the automaton-converter generating the C++ code is presented as a responsive system, is specified in the CIAO language and implemented by the bootstrapping. The proposed methodology is compared with other well-known formal methods for describing systems with complex behavior.

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Jensen, R. M., and M. M. Veloso. "OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains." Journal of Artificial Intelligence Research 13 (October 1, 2000): 189–226. http://dx.doi.org/10.1613/jair.649.

Повний текст джерела

Анотація:

Recently model checking representation and search techniques were shown to be efficiently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (OBDDs) to encode a planning domain as a non-deterministic finite automaton and then apply fast algorithms from model checking to search for a solution. OBDDs can effectively scale and can provide universal plans for complex planning domains. We are particularly interested in addressing the complexities arising in non-deterministic, multi-agent domains. In this article, we present UMOP, a new universal OBDD-based planning framework for non-deterministic, multi-agent domains. We introduce a new planning domain description language, NADL, to specify non-deterministic, multi-agent domains. The language contributes the explicit definition of controllable agents and uncontrollable environment agents. We describe the syntax and semantics of NADL and show how to build an efficient OBDD-based representation of an NADL description. The UMOP planning system uses NADL and different OBDD-based universal planning algorithms. It includes the previously developed strong and strong cyclic planning algorithms. In addition, we introduce our new optimistic planning algorithm that relaxes optimality guarantees and generates plausible universal plans in some domains where no strong nor strong cyclic solution exists. We present empirical results applying UMOP to domains ranging from deterministic and single-agent with no environment actions to non-deterministic and multi-agent with complex environment actions. UMOP is shown to be a rich and efficient planning system.

Стилі APA, Harvard, Vancouver, ISO та ін.

Статті в журналах з теми "Syntax diagrams"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями