Related papers: Failure Trace Semantics for a Process Algebra with…

It is shown that the *-algebra of all (closed densely defined linear) operators affiliated with a finite type I von Neumann algebra admits a unique center-valued trace, which turns out to be, in a sense, normal. It is also demonstrated that…

There exists a rich literature of rule formats guaranteeing different algebraic properties for formalisms with a Structural Operational Semantics. Moreover, there exist a few approaches for automatically deriving axiomatizations…

We study two different ways to enhance PAFAS, a process algebra for modelling asynchronous timed concurrent systems, with non-blocking reading actions. We first add reading in the form of a read-action prefix operator. This operator is very…

Time-reversal symmetry is a prevalent feature of microscopic physics, including operational quantum theory and classical general relativity. Previous works have studied indefinite causal structure using the language of operational quantum…

In the original paper, we showed how to enhance the expressiveness of a typical process algebraic architectural description language by including the capability of representing nonsynchronous communications. In particular, we extended the…

An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…

We consider process algebras with branching parametrized by an equational theory T, and show that it is possible to axiomatize bisimilarity under certain conditions on T. Our proof abstracts an earlier argument due to Grabmayer and Fokkink…

This paper introduces an imperative process algebra based on ACP (Algebra of Communicating Processes). Like other imperative process algebras, this process algebra deals with processes of the kind that arises from the execution of…

We present an expressive logic over trace formulas, based on binary state predicates, chop, and least fixed-points, for precise specification of programs with recursive procedures. Both, programs and trace formulas, are equipped with a…

Transition Algebra (TA) is a type of infinite logic introduced to discuss rewriting systems. The natural deductive proof systems already introduced in TA satisfy completeness for countable signatures. However, it lacks compactness, making…

Analysis of execution traces plays a fundamental role in many program analysis approaches, such as runtime verification, testing, monitoring, and specification mining. Execution traces are frequently parametric, i.e., they contain events…

Time change is one of the most basic and very useful transformations for Markov processes. The time changed process can also be regarded as the trace of the original process on the support of the Revuz measure used in the time change. In…

It is shown in this paper that two positive elements of a C*-algebra agree on all lower semicontinuous traces if and only if they are equivalent in the sense of Cuntz and Pedersen. A similar result is also obtained in the more general case…

A standard contextual equivalence for process algebras is strong barbed congruence. Configuration structures are a denotational semantics for processes in which one can define equivalences that are more discriminating, i.e. that distinguish…

Using process algebra, this paper describes the formalisation of the process/semantics behind the purely event-driven programming language.

Certain operator algebras A on a Hilbert space have the property that every densely defined linear transformation commuting with A is closable. Such algebras are said to have the closability property. They are important in the study of the…

General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible…

Acceleration in symbolic verification consists in computing the exact effect of some control-flow loops in order to speed up the iterative fix-point computation of reachable states. Even if no termination guarantee is provided in theory,…

Let S be a symbol algebra. The trace form of S is computed and it is shown how this form can be used to determine whether S is a division algebra or not. In addition, the exterior powers of the trace form of S are computed.

We extend the definition of algebraic entropy to a class of differential-delay equations. The vanishing of the entropy, as a structural property of an equation, signals its integrability. We suggest a simple way to produce…