[PDF][PDF] Decidability of two truly concurrent equivalences for finite bounded Petri nets
A Cesco, R Gorrieri - Logical Methods in Computer Science, 2023 - lmcs.episciences.org
We prove that the well-known (strong) fully-concurrent bisimilarity and the novel i-causal-net
bisimilarity, which is a sligtlhy coarser variant of causal-net bisimilarity, are decidable for …
bisimilarity, which is a sligtlhy coarser variant of causal-net bisimilarity, are decidable for …
[HTML][HTML] Exploring nominal cellular automata
T Bolognesi, V Ciancia - Journal of logical and algebraic methods in …, 2017 - Elsevier
The emerging field of Nominal Computation Theory is concerned with the theory of Nominal
Sets and its applications to Computer Science. We investigate here the impact of nominal …
Sets and its applications to Computer Science. We investigate here the impact of nominal …
Causal trees, finally
R Bruni, U Montanari, M Sammartino - … Degano on the Occasion of His …, 2015 - Springer
Causal trees are one of the earliest pioneering contributions of Pierpaolo Degano, in joint
work with Philippe Darondeau. The idea is to record causality dependencies in processes …
work with Philippe Darondeau. The idea is to record causality dependencies in processes …
Causal Trees, Finally
M Sammartino - … Languages with Applications to Biology and …, 2015 - books.google.com
Causal trees are one of the earliest pioneering contributions of Pierpaolo Degano, in joint
work with Philippe Darondeau. The idea is to record causality dependencies in processes …
work with Philippe Darondeau. The idea is to record causality dependencies in processes …
[PDF][PDF] Autonomic Service-Component Ensembles
This deliverable reports on the WP2 activities that have been conducted during months 13–
24. In Task 2.1 we further pursued the investigation on the theoretical foundations of …
24. In Task 2.1 we further pursued the investigation on the theoretical foundations of …