1521 search results - page 37 / 305 » On Sampled Semantics of Timed Systems |
205
click to vote
POPL
2006
ACM
16 years 1 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
121
click to vote
RTAS
2008
IEEE
15 years 7 months ago
2008
IEEE
Instruction scratchpads have been previously suggested as a way to reduce the worst case execution time (WCET) of hard real-time programs without introducing the analysis issues p...
114
Voted
FM
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. We propose an approach to automatic verification of realtime systems against scenario-based requirements. A real-time system is modeled as a network of Timed Automata (TA...
104
click to vote
RTSS
1999
IEEE
15 years 5 months ago
1999
IEEE
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...
76
Voted
ENTCS
2008
15 years 25 days ago
2008
One of the challenges in designing distributed, embedded systems is the paucity of formal, executable specification notations that provide support for both real-time and asynchron...