44 search results - page 2 / 9 » Kleene Theorems for Product Systems |
CIE
2007
Springer
13 years 11 months ago
2007
Springer
The interest is in characterizing insightfully the power of program self-reference in effective programming systems (epses), the computability-theoretic analogs of programming lan...
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
We are concerned with the availability of systems, defined as the ratio between time of correct functioning and uptime. We propose to model guaranteed availability in terms of regu...
ICTAC
2005
Springer
13 years 10 months ago
2005
Springer
n abstract computer virology G. Bonfante, M. Kaczmarek, and J-Y Marion Loria, Calligramme project, B.P. 239, 54506 VandÅ“uvre-l`es-Nancy C´edex, France, and ´Ecole Nationale SupÂ...
HYBRID
1998
Springer
13 years 9 months ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
ENTCS
2008
13 years 5 months ago
2008
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...