We propose a five-valued logic that can be motivated from an algorithmic point of view and from a logical perspective. This logic is combined with process algebra. For process algebra with five-valued logic we present an operational semantics in SOS-style and a completeness result. Finally, we discuss some generalizations.

Emerging interaction paradigms, such as service-oriented computing, and new technological challenges, such as exogenous component coordination, suggest new roles and application areas for process algebras. This, however, entails the need for more generic and adaptable approaches to their design. For example, some applications may require similar programming constructs coexisting with different ...

We introduce a generalised notion of a real-time specification language (“GPLC-Automata”) that can be translated directly into real-time programs. In order to describe the behaviour of several GPLCAutomata implemented on one machine we introduce composition operators which form a process algebra. We give several algebraic laws and prove that each system is equivalent to a system in a certain no...

Industry standards for Web Service composition, such as WSBPEL, provide the notation and additional control mechanisms for the execution of business processes in Web Service collaborations. However, these standards do not provide support for checking interesting properties related to Web Service and process behaviour. In an attempt to fill this gap, we describe a formalization of WSBPEL busines...

We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and (dis)prove crucial properties such as loop freedom and packet delivery.

The delayed choice is an operator which serves to combine linear time and branching time within one process algebra. We study this operator in a theory with abstraction, more precisely, in a setting considering branching bisimulation. We show its use in scenario specii-cations and in veriication to reduce irrelevant branching structure of a process.

We introduce a stochastic process algebra, PEPA, as a high-level modelling paradigm for continuous time Markov chains (CTMC). Process algebras are mathematical theories which model concurrent systems by their algebra and provide apparatus for reasoning about the structure and behaviour of the model. Recent extensions of these algebras, associating random variables with actions, make the models ...

This paper studies Hennessy Milner classes classes of Kripke models where modal logical equivalence coincides with bisimulation Concepts associated with these classes in the literature Goldblatt Visser are studied and compared and the structure of the collection of maximal Hennessy Milner classes is investigated how many are there what is their intersection The insights into these classes are a...

Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend these processes with a deadlocking state into BPAδ systems. Bosscher has proved that bisimilarity and regularity remain decidable [Bos97]. We generalise his approach introducing strict and nonstrict version of bisimila...