A recent theorem 3, 7, 19] shows that strong bisimilarity is decidable for the class of normed BPA processes, which correspond to a class of context-free grammars generating the-free context-free languages. In 21] Huynh and Tian have shown that readiness and failure equivalence are undecidable for BPA processes. In this paper we examine all other equivalences in the linear/branching time hierar...

We consider three forms of non-regular iteration in process algebra: the push-down operation $, de5ned by xy = x((xy)(xy)) + y, the nesting operation ], de5ned by xy = x((xy)x) + y, and the back and forth operation , de5ned by x y= x((x y)y) + y. In the process algebraic framework ACP with abstraction and one of $, ] or we provide de5nitions of the following standard processes: stack, context-f...

We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a calculus for the analysis of probabilistic systems and a notion of probabilistic bisimulation in order to define classical security properties, such as nondeterministic noninterference (NNI) and nondeducibility on comp...

Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We discuss reversibility in major process algebras from the point of view of operational semantics. The main difficulty seems to be with the definitions of forward and reverse computation for...

In this report we propose a novel approach to the speciication of real-time behaviour based on process algebras. In contrast to the usual pattern, involving a xed, measurable, and global notion of time, we suggest to represent real-time constraints indirectly through uninterpreted clocks enforcing broadcast synchronization between processes. The concept of time underlying the use of clocks is a...

Thi spaperdi scussesstochasti cextensi onsofasi mpl eprocessal gebrai nacausal i ty-based setti ng. Atomi c acti ons are supposed to happen after a del ay that i s deter-mi ned bya stochasti c vari abl e wi th acertai n di stri buti on. Asi mpl e stochasti c type of event structures i s di scussed, restri cti ng the di stri buti on functi ons to be expo-nenti al. Acorrespondi ngoperati onalsema...

The execution logs that are used for process mining in practice are often obtained by querying an operational database and storing the result in a flat file. Consequently, the data processing power of the database system cannot be used anymore for this information, leading to constrained flexibility in the definition of mining patterns and limited execution performance in mining large logs. Ena...

The real-time process algebra (RTPA) is a set of new mathematical notations for formally describing system architectures, and static and dynamic behaviors. It is recognized that the specification of software behaviors is a three-dimensional problem known as: (i) mathematical operations, (ii) event/process timing, and (iii) memory manipulations. Conventional formal methods in software engineerin...

The very existence of the concur conference bears witness to the fact that “concurrency theory” has developed into a subject unto itself, with substantially different emphases and techniques to those prominent elsewhere in the semantics of computation. Whatever the past merits of this separate development, it seems timely to look for some convergence and unification. In addressing these issues,...