## Operational semantics development for procedural programming languages based on conceptual transition systems

The methodology of the operational semantics development for programming languages based on the operational ontological approach, conceptual transition systems and CTSL, the language for the specification of such systems, is proposed. The development of operational semantics is illustrated by an example of procedural programming languages from the family MPL of...

## A DSL and a SPIN-frontend for river-crossing problems defined with Xtext

Bodin has applied SPIN to solve puzzles like the Japanese river
puzzle, an advanced version of the famous wolf-goat-cabbage puzzle. Defining a
*Promela* model can become cumbersome and debugging can be very time-consuming,
since SPIN does the syntax check (e.g. type checking) only at runtime and developers might have decided...

## On some graphs connected with texts in a natural language, link grammar and the summarization process

The paper describes the generalization of the summarization algorithm of Niraj Kumar. The method proposed in the article uses the Link Grammar Parser. Our investigations are oriented to processing news articles, reviews from social networks, etc. We consider the possibility of applying this algorithm to estimate the relevance of posts...

## A research automation system for macroeconomic modeling

The paper discusses several subsystems of the MIX system aimed to support various experimental researches in the field of economic modeling. The ultimate objection for each of these subsystems is to provide means for what-if analysis, impact estimation of strategic move, and decision making. Based on a comparative analysis of...

## Programming paradigms in higher education

The paper concerns a topical problem of System Informatics, namely, the study and development of the methods of analysis, comparison and formal definition of the programming paradigms. The importance of this topic arises from the increase in the number of new-generation programming languages oriented towards the application and development of...

## Causal trees and timed causal trees categorically

Causal trees represented by Darondeau and Degano are one of the truly concurrent model for distributed systems and processes. The model is more basic than other truly concurrent models because it defines concurrency and causality with respect to a branch, but on the other hand it is more expressive than...

## On the need to specify and verify standard functions

The problem of validation of standard mathematical functions and libraries is well-recognized by industrial and academic professional community but still is poorly understood by freshmen and inexperienced developers. The paper gives and discusses two examples (from the author's pedagogical experience) when formal specification and verification of standard functions do help...

## Bisimulation for fluid stochastic Petri nets

We propose a novel notion of fluid bisimulation equivalence that allows one to compare and reduce the behavior of labeled fluid stochastic Petri nets (LFSPNs) while preserving their discrete and continuous properties. The underlying stochastic model for the discrete part of the LFSPNs is a continuous time Markov chain (CTMC)...