Search results for "Programming language"
showing 10 items of 624 documents
Modeling and Simulation of Network-on-Chip Systems with DEVS and DEUS
2013
Networks on-chip (NoCs) provide enhanced performance, scalability, modularity, and design productivity as compared with previous communication architectures for VLSI systems on-chip (SoCs), such as buses and dedicated signal wires. Since the NoC design space is very large and high dimensional, evaluation methodologies rely heavily on analytical modeling and simulation. Unfortunately, there is no standard modeling framework. In this paper we illustrate how to design and evaluate NoCs by integrating the Discrete Event System Specification (DEVS) modeling framework and the simulation environment called DEUS. The advantage of such an approach is that both DEVS and DEUS support modularity—the fo…
Models Versus Model Descriptions
2021
In the development of computer-based systems, modelling is often advocated in addition to programming, in that it helps in reflecting the application domain and that it makes the design and experiment activities of development more efficient. However, there is disagreement about what models are and how they can be used in software systems development. In this paper, we present the Scandinavian approach to modelling, which makes a clear distinction between models and model descriptions. This paper explains the connections between models, descriptions, systems, and executions. Combining the Scandinavian approach with the Kiel notion of model, we establish that both descriptions and executions…
Systems, models and languages
2010
This paper presents a comparison of language aspects in a model and a meta-model. The motivation is to get a better understanding of how we should define a modeling language.
Categorical Modeling Method of Intelligent WorkFlow
2018
A category as well as a model is a mixture of graphical information and algebraic operations. Therefore, category language seems to be the most general to describe the models. It can provide us with the features that must characterize both the DSL language and the Modeling Method concept.
ON THE STAR HEIGHT OF RATIONAL LANGUAGES
1994
Two problems concerning the star height of a rational language are investigated: the star height one problem and the relationships between the unambiguity of an expression and its star height. For this purpose we consider the class of factorial, transitive and rational (FTR) languages. From the algebraic point of view a FTR language is the set of factors of a rational submonoid M. Two subclasses of FTR languages are introduced: renewal languages, corresponding to the case of M finitely generated, and unambiguous renewal languages, corresponding to the case of M finitely generated and free. We prove that a FTR language has star height one if and only if it is renewal. This gives a simple de…
Quantum Finite Automata and Logics
2006
The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
2007
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
DIN-Norm für PASCAL
1983
Die DIN-Norm Pascal ist aus einer Ubersetzung der ISO 7185 Pascal-Norm entstanden, die zum 1. Dezember 1983 von ISO nach einer mehrjahrigen Entwurfsphase verabschiedet wurde.
A note on Sturmian words
2012
International audience; We describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the same length in the lexicographic order in linear time. It is based on a combinatorial property of Sturmian words which is related with the Burrows-Wheeler transformation.
Probabilities to Accept Languages by Quantum Finite Automata
1999
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.