![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Efficient tasks scheduling in multicore systems integrated with hardware accelerators
Multicore systems integrated with hardware accelerators provide better performance for executing real-time applications in time-critical fields, such as robots, avionics, and aerospace. The integration of hard...
-
Article
A verification framework for spatio-temporal consistency language with CCSL as a specification language
The Spatio-Temporal Consistency Language (STeC) is a high-level modeling language that deals natively with spatio-temporal behaviour, i.e., behaviour relating to certain locations and time. Such restriction by...
-
Article
Connection models for the Internet-of-Things
The Internet-of-Things (IoT) is expected to swamp the world. In order to study and understand the emergent behaviour of connected things, effective support for their modelling is needed. At the heart of IoT ar...
-
Article
Timed-pNets: a communication behavioural semantic model for distributed systems
This paper presents an approach to build a communication behavioural semantic model for heterogeneous distributed systems that include synchronous and asynchronous communications. Since each node of such syste...
-
Article
Complexity measure based on program slicing and its validation
The popular single-factor complexity measure cannot comprehensively reflect program complexity and the existing hybrid complexity measure cannot express the interactive behaviors of programs. To treat these pr...
-
Article
Two-thirds simulation indexes and modal logic characterization
Two-thirds simulation provides a kind of abstract description of an implementation with respect to a specification. In order to characterize the approximate two-thirds simulation, we propose the definition of ...
-
Article
Semantics of sub-probabilistic programs
The aim of this paper is to extend the probabilistic choice in probabilistic programs to sub-probabilistic choice, i.e., of the form (p)P ⋈(q)Q where p + q ⩽ 1. It means that program P is ...
-
Article
Domains via graphs
This paper provides a concrete and simple introduction to two pillars of domain theory: (1) solving recursive domain equations, and (2) universal and saturated domains. Our exposition combines Larsen and Winsk...