![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Quantitative BAN Logic Based on Belief Degree
Authentication protocols are the basis for secure communication in many distributed systems but are highly prone to errors in their design, preventing them from working properly. It is therefore necessary to a...
-
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...
-
Chapter and Conference Paper
Embedding CCSL into Dynamic Logic: A Logical Approach for the Verification of CCSL Specifications
The Clock Constraint Specification Language (CCSL) is a clock-based specification language for capturing causal and chronometric constraints between events in Real-Time Embedded Systems (RTESs). Due to the lim...
-
Chapter and Conference Paper
Modal Characterisations of Probabilistic and Fuzzy Bisimulations
This paper aims to investigate bisimulation on fuzzy systems. For that purpose we revisit bisimulation in the model of reactive probabilistic processes with countable state spaces and obtain two findings: (1) ...
-
Chapter and Conference Paper
The Semantics of wlp and slp of Fuzzy Imperative Programming Languages
In this paper, we focus on the weakest liberal precondition semantics (wlp, for short) and the strongest liberal postcondition semantics (slp, for short) of fuzzy imperative programming languages and discuss thei...
-
Article
Measurement of refinement and correctness
The purpose of this paper is to introduce a measurement approach of refinement and correctness of probabilistic programs. That is, we define the refinement degree and the correctness degree by the weakest prec...
-
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 ...