Journal of Information and Organizational Sciences (JIOS)
Not a member yet
455 research outputs found
Sort by
Publication Ethics; List of Reviewers; Instructions for Authors
No full textFull text available in PDF
Publication Ethics; List of Reviewers; Instructions for Authors
No full textFull text available in PDF
Enhancing Formal Methods Integration with ACP2Petri
No full textThe paper deals with the ACP2Petri tool, providing a transformation of process algebraic specification to equivalent Petri net-based specification. Long-term practical experiences with the tool revealed some suggestions for its update and extension. Shortcomings and limitations found are described and proposed solutions provided within the paper. Implemented extensions, simplifying the usage of the tool and providing more options for analysis of particular transformation, are also presented. One of the most evident extensions of the tool is its graphical user interface, which allows for convenient management and detailed control over the process of transformation
Publication Ethics; List of Reviewers; Instructions for Authors
No full textFull text available in PDF
Categorical model of structural operational semantics for imperative language
No full textDefinition of programming languages consists of the formal definition of syntax and semantics. One of the most popular semantic methods used in various stages of software engineering is structural operational semantics. It describes program behavior in the form of state changes after execution of elementary steps of program. This feature makes structural operational semantics useful for implementation of programming languages and also for verification purposes. In our paper we present a new approach to structural operational semantics. We model behavior of programs in category of states, where objects are states, an abstraction of computer memory and morphisms model state changes, execution of a program in elementary steps. The advantage of using categorical model is its exact mathematical structure with many useful proved properties and its graphical illustration of program behavior as a path, i.e. a composition of morphisms. Our approach is able to accentuate dynamics of structural operational semantics. For simplicity, we assume that data are intuitively typed. Visualization and facility of our model is not only a new model of structural operational semantics of imperative programming languages but it can also serve for education purposes
Sampling Individually Fundamental Simplexes as Sets of Players’ Mixed Strategies in Finite Noncooperative Game for Applicable Approximate Nash Equilibrium Situations with Possible Concessions
No full textIn finite noncooperative game, a method for finding approximate Nash equilibrium situations is developed. The method is prior-based on sampling fundamental simplexes being the sets of players’ mixed strategies. Whereas the sampling is exercised, the sets of players’ mixed strategies are mapped into finite lattices. Sampling steps are envisaged dissimilar. Thus, each player within every dimension of its simplex selects and controls one’s sampling individually. For preventing approximation low quality, however, sampling steps are restricted. According to the restricted sampling steps, a player acting singly with minimal spacing over its lattice cannot change payoff of any player more than by some predetermined magnitude, being specific for each player. The finite lattice is explicitly built by the represented routine, where the player’s mixed strategies are calculated and arranged. The product of all the players’ finite lattices approximates the product of continuous fundamental simplexes. This re-defines the finite noncooperative game in its finite mixed extension on the finite lattices’ product. In such a finite-mixed-extension-defined game, the set of Nash equilibrium situations may be empty. Therefore, approximate Nash equilibrium situations are defined by the introduced possible payoff concessions. A routine for finding approximate equilibrium situations is represented. Approximate strong Nash equilibria with possible concessions are defined, and a routine for finding them is represented as well. Acceleration of finding approximate equilibria is argued also. Finally, the developed method is discussed to be a basis in stating a universal approach for the finite noncooperative game solution approximation implying unification of the game solvability, applicability, realizability, and adaptability
The Investigation of TLC Model Checker Properties
No full textThis paper presents the investigation and comparison of TLC model checking method (TLA Checker) properties. There are two different approaches to method usage which are considered. The first one consists of a transition system states attendance by breadth-first search (BFS), and the second one by depth-first search (DFS). The Kripke structure has been chosen as a transition system model. A case study has been conducted, where composite web service usage scenario has been considered. Obtained experimental results are aimed at increasing the effectiveness of TLA+ specifications automated verification
Performance Journey Mapping: Insights from a Methodological Triangulation
No full textThis paper presents the results of an evaluation of the Performance Journey Mapping (PJM) framework. PJM is a service performance assessment concept with accompanying tools tailored to the specific performance measurement needs of small and medium-sized service providers. The initial evaluation of PJM was performed from three different perspectives. The underlying evaluation framework applied methodological triangulation in order to (i) ensure valid and reliable results and to (ii) evaluate both the framework’s results and its process. Quantitative results were supplemented with insights gained through participant observation