Abstract. 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.
Laneve and Zavattaro define a calculus named webπ REF which is an extension of asynchronous polyadic π-calculus with a timed transaction construct.
Foundations of Web Transactions
FoSSaCS
Computer Science