Foundations of Web Transactions

摘要

A timed extension of π-calculus with a transaction construct - the calculus Web π - is studied. The underlying model of Webπ relies on networks of processes; time proceeds asynchronously at the network level, while it is constrained by the local urgency at the process level. Namely process reductions cannot be delayed to favour idle steps. The exten-sional model - the timed bisimilarity - copes with time and asynchrony in a different way with respect to previous proposals. In particular, the discriminating power of timed bisimilarity is weaker when local urgency is dropped. A labelled characterization of timed bisimilarity is also discussed.