Group-oriented computation model for distributed shared memory systems
This paper describes a new group-oriented distributed shared memory (GDSM) computation model and its hardware support for improving performance in large-scale shared memory multiprocessors. The GDSM model is based on a concept of groups as basic computational units representing sets of parallel threads that cooperate and communicate by sharing an...
doroshevich.pdf8.11 MB
Associative algorithms for graphs represented as an adjacency matrix
In this paper by means of an abstract model (the STAR-machine) we study a group of associative algorithms for unweighted graphs given as an adjacency matrix. These algorithms are written as the corresponding STAR procedures whose correctness is proved and time complexity is evaluated.
nepomnyashchaya.pdf4.82 MB
Formal semantics and verification of distributed systems presented by Basic-REAL specifications
The specification language Basic-REAL consists of executional and logical specification sublanguages. The first one is based on SDL and differs from it by multiple clock concept, time intervals associated with actions, non-determinism, and rich collection of channel structures. The second one is based on temporal and dynamic logics extended by...
nepomnyashchiy.pdf9.15 MB
Equivalences for behavioural analysis of multilevel systems
The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth and place bisimulation equivalences known from the literature are supplemented with new ones, and their relationships with basic behavioural equivalence relations are examined for the whole class of Petri nets as well...
tarasyuk.pdf8.72 MB
Model checking of time Petri nets
The intention of the paper is to develop a model checking algorithm for real time systems represented by time Petri nets and a real time extension of the branching time temporal logic CTL, called TCTL. Since time Petri nets model real time systems over dense time domain, the number of...
virbickayte.pdf3.31 MB
Typed Gurevich machines revisited
An approach to combining type-structured algebraic specifications with Gurevich Machines (evolving algebras) is proposed. A type-structured algebraic specification, in its simplest form, consists of data type specifications and independent function (detached operation) specifications. Concrete and generic specification components (data types and functions) are distinguished in a more developed case. A...
zamulin.pdf10.41 MB