We present an algorithm for the linearization of hybrid processes modeled in hybrid process algebra (HyPA) and prove its correctness. HyPA is a formalism that is suitable for the ...
P. C. W. den Brand van, Michel A. Reniers, Pieter ...
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
We propose a rule-based approach for transforming B abstract machines into UML diagrams. We believe that important insight into the structure underlying a B model can be gained by...
Extending the pi calculus with the session types proposed by Honda et al. allows high-level specifications of structured patterns of communication, such as client-server protocols,...