3820 search results - page 233 / 764 » Bounded Model Debugging |
121
Voted
FSTTCS
2005
Springer
15 years 9 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...
102
Voted
CONCUR
2004
Springer
15 years 9 months ago
2004
Springer
We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a synchronous model of ...
124
click to vote
TCC
2004
Springer
15 years 8 months ago
2004
Springer
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
126
click to vote
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
114
Voted
INFOCOM
1994
IEEE
15 years 7 months ago
1994
IEEE
We consider the ring network with spatial reuse. Tra c streams may enter and exit the network at any node. We adopt an arrival tra c model with deterministic constraints on its sa...