Algebraic high-level net transformation systems

1995 ◽  
Vol 5 (2) ◽  
pp. 217-256 ◽  
Author(s):  
Julia Padberg ◽  
Hartmut Ehrig ◽  
Leila Ribeiro
Keyword(s):  
Petri Nets ◽  
The Other ◽  
Graph Grammars ◽  
Data Types ◽  
Algebraic Specifications ◽  
Categorical Framework ◽  
The One ◽  
High Level ◽  
Transformation Systems ◽  
Dining Philosophers

The concept of algebraic high-level net transformation systems combines two important lines of research recently introduced in the literature:algebraic high-level nets(AHL-nets for short) andhigh-level replacement systems(HLR-systems for short). In both cases a categorical formulation of the corresponding theory has turned out to be highly important and is also a good basis for the integration of these concepts in this paper.AHL-nets combine Petri nets with algebraic specifications and provide a powerful specification technique for distributed systems including data types and processes.HLR-systems are transformation systems for high-level structures such as graphs, hypergraphs, algebraic specifications and different kinds of Petri nets. The theory of HLRsystems - formulated already in a categorical framework - is applied in this paper to AHLnets. Thus we obtain AHL-net transformation systems as an instantiation of HLR-systems to AHL-nets. This allows us to build up AHL-nets from basic components and to transform the net structure using rules or productions in the sense of graph grammars. This concept is illustrated by extending the well-known example of ‘dining philosophers’. We are able to show that AHL-net-transformation systems satisfy several important compatibility properties. On the one hand we obtain a local Church-Rosser and Parallelism Theorem, which is well-known for graph grammars and has recently been generalized to HLR-systems. This allows us to analyse concurrency in AHL-nets not only on the token level but also on the level of transformations of the net structure. On the other hand, we consider the ‘fusion’ and ‘union’ constructions for high-level structures, motivated by corresponding concepts for high-level Petri nets in the literature, and we show compatibility of these constructions with derivations of HLR-systems in general and AHL-nettransformations in particular. This means compatibility of vertical and horizontal structuring in terms of software development.

scholarly journals Adaptive Radial Basis Function Neural Network Controller for Autonomous Multirotors

2021 ◽  
pp. 112-118
Author(s):  
Afshin Banazadeh ◽  
◽  
Ardalan Samadzadeh
Keyword(s):  
Neural Network ◽  
Real Time ◽  
Basis Function ◽  
Rbf Neural Network ◽  
The Other ◽  
Data Types ◽  
Neural Network Controller ◽  
Network Controller ◽  
The One ◽  
High Level

Limits in the real-time computation of micro-processors on the one hand and high-level controllers that need precise computation in addition to implementation and compiling issues, on the other hand, have caused a great gap between control science and experiments. In this work, an adaptive RBF neural network controller is proposed to control the position and attitude of an autonomous multirotor. The controller is combined with an EKF observer and simulated in real-time flight conditions. In order to check the capabilities of the system, the proposed structure has been successfully applied to a quadrotor and a hexarotor using three data types for getting similar real-time flight results. Based on the results, the proposed structure has accomplished two separate missions with different scenarios, though there exists some error, especially in position estimations which are caused by step-wise characteristics of the desired path.

scholarly journals The S66 Non-Covalent Interactions Benchmark Reconsidered Using Explicitly Correlated Methods Near the Basis Set Limit

2018 ◽  
Vol 71 (4) ◽  
pp. 238 ◽  
Author(s):  
Manoj K. Kesharwani ◽  
Amir Karton ◽  
Nitai Sylvetsky ◽  
Jan M. L. Martin
Keyword(s):  
Computational Cost ◽  
The Other ◽  
Basis Set ◽  
Basis Sets ◽  
Explicitly Correlated ◽  
Non Covalent Interactions ◽  
Explicitly Correlated Methods ◽  
The One ◽  
High Level ◽  
Covalent Interactions

The S66 benchmark for non-covalent interactions has been re-evaluated using explicitly correlated methods with basis sets near the one-particle basis set limit. It is found that post-MP2 ‘high-level corrections’ are treated adequately well using a combination of CCSD(F12*) with (aug-)cc-pVTZ-F12 basis sets on the one hand, and (T) extrapolated from conventional CCSD(T)/heavy-aug-cc-pV{D,T}Z on the other hand. Implications for earlier benchmarks on the larger S66×8 problem set in particular, and for accurate calculations on non-covalent interactions in general, are discussed. At a slight cost in accuracy, (T) can be considerably accelerated by using sano-V{D,T}Z+ basis sets, whereas half-counterpoise CCSD(F12*)(T)/cc-pVDZ-F12 offers the best compromise between accuracy and computational cost.

THE APPLICATION OF PETRI NETS TO WORKFLOW MANAGEMENT

1998 ◽  
Vol 08 (01) ◽  
pp. 21-66 ◽  
Author(s):  
W. M. P. VAN DER AALST
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Business Processes ◽  
State Of The Art ◽  
Workflow Management ◽  
Explicit Representation ◽  
The Other ◽  
Application Domain ◽  
Analysis Techniques ◽  
The One

Workflow management promises a new solution to an age-old problem: controlling, monitoring, optimizing and supporting business processes. What is new about workflow management is the explicit representation of the business process logic which allows for computerized support. This paper discusses the use of Petri nets in the context of workflow management. Petri nets are an established tool for modeling and analyzing processes. On the one hand, Petri nets can be used as a design language for the specification of complex workflows. On the other hand, Petri net theory provides for powerful analysis techniques which can be used to verify the correctness of workflow procedures. This paper introduces workflow management as an application domain for Petri nets, presents state-of-the-art results with respect to the verification of workflows, and highlights some Petri-net-based workflow tools.

STUDY OF THE INFLUENCE OF THE LEVEL OF ANXIETY DEVELOPMENT ON THE ACADEMIC PERFORMANCE OF PRIMARY SCHOOL STUDENTS

Vestnik ◽  
2021 ◽  
pp. 155-160
Author(s):  
А.Е. Малибаева ◽  
Б.К. Кайрат ◽  
А.И. Нуфтиева ◽  
Л.Б. Умбетьярова ◽  
М.С. Кулбаева ◽  
...  
Keyword(s):  
Academic Performance ◽  
Learning Outcomes ◽  
Learning Process ◽  
Child Anxiety ◽  
Lower Class ◽  
The Other ◽  
Primary School Students ◽  
School Students ◽  
The One ◽  
High Level

В современных стрессовых и негативных внешних экологических условиях растет число неуверенных в себе, эмоционально неустойчивых тревожных детей. В работах А.И.Захаровой, Н.В.Имеладзе, Л.М. Прихожановой говорится, что когда человек постоянно волнуется - возникает паника. Согласно анализу исследований многих авторов, детская тревога, с одной стороны, имеет психодинкамическую природу, с другой-является результатом социализации. По мнению психологов, у учащихся наблюдается высокий уровень тревожности в процессе обучения. В результате изучения данной проблемы установлено, что уровень тревожности и успеваемость ребенка тесно взаимосвязаны. Процесс приобщения детей, пришедших в школу, к процессу обучения тесно связан с процессом паники . In the current stressful and negative external environmental conditions, the number of insecure, emotionally unstable children with anxiety is growing. In the works of A.I. Zakharova, N.V. Imeladze, L.M. Prikhozhan, it is said that when a person is constantly agitated, panic occurs. According to the analysis of the research of many authors, child anxiety, on the one hand, has a psychodynamic nature, and on the other-is the result of socialization. According to psychologists, there is a high level of anxiety in students ' learning process. As a result of the study of this problem, it was found that the level of anxiety and the child's academic performance are closely related. The process of adaptation of children to the learning process is closely related to the panic process. However, the level of anxiety in lower-class students affects the learning process and learning outcomes.

STUDI KRITIS JUAL BELI DEKORASI UANG MASKAWIN

Al-MAJAALIS ◽  
2018 ◽  
Vol 6 (1) ◽  
pp. 1-36
Author(s):  
Muhammad Arifin Badri
Keyword(s):  
The Other ◽  
Other Hand ◽  
Business Opportunities ◽  
The Law ◽  
The One ◽  
High Level

This study aims to examine the laws of dowry money decoration that are common in the community. The innovation and soul of art that is channeled through décor of dowry money is proven to produce beautiful and unique works, so as to attract the attention and interest of the wider community. However, because to produce beautiful and unique works, a high level of creativity is needed, so not everyone can do it. On the one hand, this phenomenon opens up quite good business opportunities, but on the other hand, it should be watched out, because in some conditions it contains the practice of buying and selling currencies with nominal differences. Through this study, I would like to uncover the law of buying and selling practices decorating dowry money and decorating services. As I also intend to present an applicative solution for the community so that they can still channel their artistic talents without violating Shari’ah law.

scholarly journals Iris Hanika's Treffen Sich Zwei: Reception, Analysis and Interpretation

2021 ◽  
Author(s):  
◽  
Kerry Alistair Nitz
Keyword(s):  
Quantitative Analysis ◽  
Qualitative Approach ◽  
The Other ◽  
The Novel ◽  
Quantitative Evidence ◽  
Literary Context ◽  
Narrative Functions ◽  
The One ◽  
High Level ◽  
The Relationship

<p>Iris Hanika’s commercially and critically successful novel Treffen sich zwei makes use of several techniques in the characterisation of its protagonists. Many of its reviews focus on the author’s deliberate placement of links to a wider literary context. Their interest extends from questions of genre-mixing through to the identification of direct quotes from other authors’ works. The critical preoccupation with intertexts demonstrates their importance for the readers’ response to the novel. More specifically, certain reviews highlight the important role intertexts play in the characterisation of the protagonists. This study catalogues the intertexts, metaphors and parodies in Treffen sich zwei and, by means of quantitative analysis, identifies high-level patterns in the use of these techniques. In particular, patterns are identified between, on the one hand, the different narrative functions of the intertexts and, on the other hand, the different ways in which they are interwoven in the text. The data also shows that distinct patterns are associated with each of the two protagonists and that certain patterns change in the course of the novel in parallel with the changes in the relationship between them. This quantitative evidence is supported by a more detailed, qualitative approach, which examines how specific intertexts or metaphors are used for the purposes of characterisation. In addition, variations in voice are used to distinguish the two main protagonists in a manner consistent with the intertexts and metaphors. It is thanks to the combination of these techniques that the theme of meeting encapsulated in the title, Treffen sich zwei, is woven into the textual fabric of the novel.</p>

scholarly journals Tree-Shaped Formats of Address Programming Language

2021 ◽  
Vol 4 ◽  
pp. 78-87
Author(s):  
Yury Yuschenko
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Theoretical Research ◽  
Direct Access ◽  
Complex Data ◽  
Abstract Data Types ◽  
Data Types ◽  
Abstract Data ◽  
The One ◽  
High Level

In the Address Programming Language (1955), the concept of indirect addressing of higher ranks (Pointers) was introduced, which allows the arbitrary connection of the computer’s RAM cells. This connection is based on standard sequences of the cell addresses in RAM and addressing sequences, which is determined by the programmer with indirect addressing. Two types of sequences allow programmers to determine an arbitrary connection of RAM cells with the arbitrary content: data, addresses, subroutines, program labels, etc. Therefore, the formed connections of cells can relate to each other. The result of connecting cells with the arbitrary content and any structure is called tree-shaped formats. Tree-shaped formats allow programmers to combine data into complex data structures that are like abstract data types. For tree-shaped formats, the concept of “review scheme” is defined, which is like the concept of “bypassing” trees. Programmers can define multiple overview diagrams for the one tree-shaped format. Programmers can create tree-shaped formats over the connected cells to define the desired overview schemes for these connected cells. The work gives a modern interpretation of the concept of tree-shaped formats in Address Programming. Tree-shaped formats are based on “stroke-operation” (pointer dereference), which was hardware implemented in the command system of computer “Kyiv”. Group operations of modernization of computer “Kyiv” addresses accelerate the processing of tree-shaped formats and are designed as organized cycles, like those in high-level imperative programming languages. The commands of computer “Kyiv”, due to operations with indirect addressing, have more capabilities than the first high-level programming language – Plankalkül. Machine commands of the computer “Kyiv” allow direct access to the i-th element of the “list” by its serial number in the same way as such access is obtained to the i-th element of the array by its index. Given examples of singly linked lists show the features of tree-shaped formats and their differences from abstract data types. The article opens a new branch of theoretical research, the purpose of which is to analyze the expe- diency of partial inclusion of Address Programming in modern programming languages.

ANALISIS TERHADAP SOAL PENILAIAN AKHIR SEMESTER TINGKAT SD/MI DALAM PERSPEKTIF HIGH ORDER THINK SKILLS

2020 ◽  
Vol 12 (33) ◽  
Author(s):  
Yudha Andana Prawira ◽  
Titim Kurnia
Keyword(s):  
Critical Thinking ◽  
Critical Reflection ◽  
Descriptive Analysis ◽  
High Order ◽  
Point Of View ◽  
The Other ◽  
National Education ◽  
The One ◽  
High Level ◽  
High Level Thinking

The National Education World is currently trying to improve the ability of its students to think critically and creatively. One of these efforts has been pursued through evaluations that also lead to critical reflection. This research is a descriptive analysis of the final semester evaluation questions that are examined from the point of view of high-level thinking [HOTS]. The reference to the HOTS criteria is that the researcher refers to the opinions of King and his friends. From the manuscript data, the issues examined are samples from the Bandung area. The results of the analysis show that 10 out of 15 HOTS ranges proposed by King are already included in the scripts made by the teachers. On the one hand, it shows the teacher's creativity in compiling questions. On the other hand, all these questions do not refer to the HOTS criteria as planned. Therefore, there is a need to increase teachers' skills in compiling scripts as HOTS. This increase can be done through teacher training.Keywords: Evaluation, HOTS, critical thinking and creativity thingking

scholarly journals Generalized implication equation languages

1985 ◽  
Vol 39 (1) ◽  
pp. 101-106
Author(s):  
Norman Y. Foo ◽  
Roslyn B. Riley
Keyword(s):  
Programming Languages ◽  
Data Types ◽  
Algebraic Specifications ◽  
High Level

AbstractThe calculus for equational implication languages given by Selman is generalized to handle the logical equivalent if the if…then…else… construct of high level programming languages. The relevance of these results to current investigations in the algebraic specifications of data types is discussed.

scholarly journals On the semantics of place/transition Petri nets

1997 ◽  
Vol 7 (4) ◽  
pp. 359-397 ◽  
Author(s):  
JOSÉ MESEGUER ◽  
UGO MONTANARI ◽  
VLADIMIRO SASSONE
Keyword(s):  
Petri Nets ◽  
The Other ◽  
General Category ◽  
Monoidal Categories ◽  
Other Hand ◽  
Models Of Concurrency ◽  
A Chain ◽  
The One ◽  
Algebraic Domains

Place/transition (PT) Petri nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the ‘token game’ is too intensional, even in its more abstract interpretations in terms of nonsequential processes and monoidal categories; on the other hand, Winskel's basic unfolding construction, which provides a coreflection between nets and finitary prime algebraic domains, works only for safe nets. In this paper we extend Winskel's result to PT nets. We start with a rather general category PTNets of PT nets, we introduce a category DecOcc of decorated (nondeterministic) occurrence nets and we define adjunctions between PTNets and DecOcc and between DecOcc and Occ, the category of occurrence nets. The role of DecOcc is to provide natural unfoldings for PT nets, i.e., acyclic safe nets where a notion of family is used to relate multiple instances of the same place. The unfolding functor from PTNets to Occ reduces to Winskel's when restricted to safe nets. Moreover, the standard coreflection between Occ and Dom, the category of finitary prime algebraic domains, when composed with the unfolding functor above, determines a chain of adjunctions between PTNets and Dom.

Sign in / Sign up

Export Citation Format

Share Document