| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6875190 | Science of Computer Programming | 2018 | 22 Pages |
Abstract
In this paper we first present two types of behaviour-aware matching of applications (exact and plug-in) both based on a notion of simulation. We then extend the notion of plug-in matching by relaxing the notion of simulation to permit matching an operation with a sequence of operations. We also present a coinductive procedure to compute such relaxed simulation, and we formally prove the termination, soundness, and completeness of such procedure.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Filippo Bonchi, Antonio Brogi, Andrea Canciani, Jacopo Soldani,