The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
There is a growing interest in models of reversible computation driven by exciting application areas such as bio-systems and quantum computing. Reversible process algebras RCCS [2...
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchange law: when applied in a trace model of program semantics, one of them stands...
Certain problems in connection with, for example, cooperating agents and distributed systems require reasoning about time which is measured on incomparable or unsynchronized time ...