Abstract. Symbolic bisimulations were introduced as a mean to define value-passing process calculi using smaller, possibly finite labelled transition systems, equipped with symboli...
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...
In a seminal paper Montanari and Meseguer showed that an algebraic interpretation of Petri nets in terms of commutative monoids can be used to provide an elegant characterisation o...
—This paper describes a model of a hierarchical, heterogeneous knowledge-base. The proposed model consists of an associative level that is implemented by a Kanerva-like sparse di...
Abstract. This article introduces probabilistic cluster branching processes, a probabilistic unfolding semantics for untimed Petri nets, with no structural or safety assumptions, g...