This paper proposes a formal framework for minimizing, analyzing and verifying stochastic process algebraic models using tools and techniques developed for the state-labeled domain, and vice versa. First, we modify the model embeddings proposed in the ...

A robot affects and is affected by its environment, so that typically its behaviour depends on properties of that environment. For verification, we need to formalise those properties. Modelling the environment is very challenging, if not impossible, but ...

The busy-forbidden protocol is a new readers-writer lock with no resource contention between readers, which allows it to outperform other locks. For its verification, specifications of its implementation and its less complex external behavior are ...

The existing testing theories for CSP cater for verification of interaction patterns (traces) and deadlocks, but not time. We address here refinement and testing based on a dialect of CSP, called tock-CSP, which can capture discrete time properties. This ...

Sequential emulation is a semantics-based technique to automatically reduce property checking of distributed systems to the analysis of sequential programs. An automated procedure takes as input a formal specification of a distributed system, a property ...

The paper shows that some usual specifications cannot be conveniently expressed in traditional process calculi. To solve the problem in formal specification, a new process calculus based on value-passing CCS, Calculus of Communicating Systems with ...

This paper concerns the relation between process algebra and Hoare logic. We investigate the question whether and how a Hoare logic can be used for reasoning about how data change in the course of a process when reasoning equationally about that process. ...

Robin Milner (1984) gave a sound proof system for bisimilarity of regular expressions interpreted as processes: Basic Process Algebra with unary Kleene star iteration, deadlock 0, successful termination 1, and a fixed-point rule. He asked whether this ...

This article addresses refinement and testing based on CSP models, when we distinguish input and output events. In a testing experiment, the tester (or the environment) controls the inputs, and the system under test controls the outputs. The standard ...

In this article, we assess the suitability of the Carma (Collective Adaptive Resource-sharing Markovian Agents) modelling language for mesoscopic modelling of spatially distributed systems where the desired model lies between an individual-based (...

“Mesoscopic modeling of pedestrian movement using Carma and its tools” uses Carma (Collective Adaptive Resource-sharing Markovian Agents), a specification language recently introduced for modeling CAS, to model spatially distributed systems in which the ...

“ProPPA: Probabilistic Programming for Stochastic Dynamical Systems,” by Georgoulas, Hillston, and Sanguinetti, introduces the ProPPA formalism, which brings together ideas from stochastic process algebras with those from the paradigm of probabilistic ...

Probabilistic reversible distributed systems are widely used now days. The best instance of such a system is communication protocol, which is based on the probes to carry out the communication in distributed environment. One of examples of such a ...

In a previous paper, an ACP-style process algebra was proposed in which propositions are used as the visible part of the state of processes and as state conditions under which processes may proceed. This process algebra, called ACPps, is built on ...

Roles in cryptographic protocols do not always have a linear execution, but may include choice points causing the protocol to continue along different paths. In this paper we address the problem of representing choice in the strand space model of ...

Even though many IoT Internet of Things applications have been implemented based on distributed events, how to construct scalable IoT services is still unclear. In this paper, we first discuss representing physical entities as IoT resources in the cyber ...

Trust is a basic soft-security condition influencing interactive and cooperative behaviors in online communities. Several systems and models have been proposed to enforce and investigate the role of trust in the process of favoring successful ...

We show how the FMC model checker can successfully be used to model and analyze behavioural variability in Software Product Lines. FMC accepts parameterized specifications in a process-algebraic input language and allows the verification of properties ...

Verification and validation is a crucial step of system design. However the verification of evacuation plan during emergency situation in highly crowded areas is often ignored. Analysis of building, urban and mega event plans, performed at the early ...

Reconfigurable network protocol is a network protocol which consists of components, can exhibit different function and can adapt to different network environments with high performance by conducting component replacement and changing topological ...