Wyniki wyszukiwania - BazTech

1

The Syntax of a Multi-Level Production Process Modeling Language

Vještica Marko, Dimitrieski Vladimir, Kordić Slavica, Ristić Sonja, Luković Ivan, Pisarić Milan

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

751--760

EN

The fourth industrial revolution introduces changes in traditional manufacturing systems and creates basis for a lot-size-one production. The complexity of production processes is significantly increased, alongside the need to enable efficient process simulation, execution, monitoring, real-time decision making and control. The main goal of our research is to define a methodological approach and a software solution in which the Model-Driven Software Development (MDSD) principles and Domain-Specific Modeling Languages (DSMLs) are used to create a framework for the formal description and automatic execution of production processes. In that way production process models are used as central artefacts to manage the production. In this paper, we propose a DSML which can be used to create production process models that are suitable for automatic generation of executable code. The generated code is used for automatic execution of production processes within a simulation or a shop floor.

2

Composition of languages embedded in scala

Haeri Seyed Hossein, Keir Paul

Annals of Computer Science and Information Systems

|

2019

|

Vol. 18

399–-410

EN

Composition is amongst the major challenges faced in language engineering. Erdweg et al. offered a taxonomy for language composition. Mernik catalogued the use of the Language Definitional Framework LISA for composition sorts in that taxonomy. We produce a similar catalogue for embedded language engineering in Scala.

3

CoreASM: An Extensible ASM Execution Engine

Farahbod R., Gervasi V., Glässer U.

Fundamenta Informaticae

|

2007

|

Vol. 77, nr 1,2

71-103

EN

In this paper we introduce a new research effort in making abstract state machines (ASMs) executable. The aim is to specify and implement an execution engine for a language that is as close as possible to the mathematical definition of pure ASMs. The paper presents the general architecture of the engine, together with a high-level description of the extensibility mechanisms that are used by the engine to accommodate arbitrary backgrounds, scheduling policies, and new rule forms.

4

Generalized Interpolation in First Order Logic

Borzyszkowski T.

Fundamenta Informaticae

|

2005

|

Vol. 66, nr 3

199--219

EN

We consider the Craig Interpolation Property for many sorted first-order logic. The Craig Interpolation Property explored in this paper is inspired by the institution independent generalization of this property presented in [21]. In [3] the author presents the interpolation result for the institution of many sorted first-order logic, with both morphisms in the pushout square being injective on sort names. The author also shows that the Craig Interpolation Property does not hold when both morphisms are certain morphisms which are noninjective on sort names. An open question in that paper was whether the interpolation property holds with only one morphism being injective on sort names. In this paper we give answer to this question. Following the overall structure of the classical proof presented in [7] for single sorted first-order logic, but with new technicalities concerning the many sorted case, we show that many sorted first-order logic has the interpolation property when just one (left or right) morphism is injective on sort names.