FSTTCS
2005
Springer
14 years 5 months ago
2005
Springer
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
FOSSACS
2005
Springer
14 years 5 months ago
2005
Springer
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 as...