Sciweavers

3229 search results - page 101 / 646
» The Theory of Timed Automata
Sort
View
CIE
2008
Springer
15 years 8 months ago
An Enhanced Theory of Infinite Time Register Machines
Abstract. Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor step...
Peter Koepke, Russell Miller
ISOLA
2010
Springer
15 years 4 months ago
Enforcing Applicability of Real-Time Scheduling Theory Feasibility Tests with the Use of Design-Patterns
Abstract. This article deals with performance verifications of architecture models of real-time embedded systems. We focus on models verified with the real-time scheduling theory...
Alain Plantec, Frank Singhoff, Pierre Dissaux, J&e...
CHARME
2003
Springer
120views Hardware» more  CHARME 2003»
15 years 10 months ago
A Compositional Theory of Refinement for Branching Time
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...
Panagiotis Manolios
ACRI
2008
Springer
16 years 23 days ago
Examples of Fast and Slow Convergence of 2D Asynchronous Cellular Systems
This article studies the convergence properties of some 2D cellular automata, when a single cell is updated at random at each time step. We tackle this question for a particular s...
Nazim Fatès, Lucas Gerin
DLT
2008
15 years 7 months ago
The Average State Complexity of the Star of a Finite Set of Words Is Linear
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...
Frédérique Bassino, Laura Giambruno,...