Sciweavers

427 search results - page 17 / 86
» On the Power of Labels in Transition Systems
Sort
View
ENTCS
2002
103views more  ENTCS 2002»
14 years 11 months ago
Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency)
Petri nets where, to my knowledge, the first theoretical model augmented with time constraints [Mer74], and the support of the first reachability algorithm of timed system [BM83, ...
Marc Boyer
INFOCOM
2010
IEEE
14 years 10 months ago
Transition from Heavy to Light Tails in Retransmission Durations
— Retransmissions serve as the basic building block that communication protocols use to achieve reliable data transfer. Until recently, the number of retransmissions were thought...
Jian Tan, Ness B. Shroff
IANDC
2006
121views more  IANDC 2006»
14 years 11 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
93
Voted
LICS
2005
IEEE
15 years 5 months ago
Reactive Systems over Cospans
The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of well-behaved labelled transition systems (LTS) for...
Vladimiro Sassone, Pawel Sobocinski
ISLPED
1997
ACM
108views Hardware» more  ISLPED 1997»
15 years 3 months ago
Techniques for low energy software
The energy consumption of a system depends upon the hardware and software component of a system. Since it is the software which drives the hardware in most systems, decisions take...
Huzefa Mehta, Robert Michael Owens, Mary Jane Irwi...