2005 | OriginalPaper | Chapter
Foundations of Web Transactions
Authors : Cosimo Laneve, Gianluigi Zavattaro
Published in: Foundations of Software Science and Computational Structures
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 extensional 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.