11 search results - page 2 / 3 » Towards a Formal Semantics of Verilog Using Duration Calculu... |
CALCO
2005
Springer
13 years 10 months ago
2005
Springer
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
FTRTFT
1998
Springer
13 years 9 months ago
1998
Springer
PLC-Automata are a class of real-time automata suitable to describe the behavior of polling real-time systems. PLC-Automata can be compiled to source code for PLCs, a hardware wide...
ICTAC
2005
Springer
13 years 10 months ago
2005
Springer
Case studies can significantly contribute towards improving the understanding of formalisms and thereby to their applicability in practice. One such case, namely a cascade of the ...
LOGCOM
1998
13 years 4 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
EMSOFT
2004
Springer
13 years 10 months ago
2004
Springer
The paper introduces a higher-order synchronous data-flow language in which communication channels may themselves transport programs. This provides a mean to dynamically reconfi...