Sciweavers

315 search results - page 49 / 63
» Reactive Turing Machines
Sort
View
EMSOFT
2007
Springer
14 years 11 days ago
Necessary and sufficient conditions for deterministic desynchronization
Synchronous reactive formalisms associate concurrent behaviors to precise schedules on global clock(s). This allows a non-ambiguous notion of "absent" signal, which can ...
Dumitru Potop-Butucaru, Robert de Simone, Yves Sor...
NFM
2011
306views Formal Methods» more  NFM 2011»
13 years 3 months ago
Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly ge...
Rüdiger Ehlers
JLP
2007
89views more  JLP 2007»
13 years 8 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
ESEC
1999
Springer
14 years 22 days ago
The CIP Method: Component- and Model-Based Construction of Embedded Systems
CIP is a model-based software development method for embedded systems. The problem of constructing an embedded system is decomposed into a functional and a connection problem. The ...
Hugo Fierz
ICAC
2006
IEEE
14 years 2 months ago
Autonomic Provisioning of Backend Databases in Dynamic Content Web Servers
— In autonomic provisioning, a resource manager allocates resources to an application, on-demand, e.g., during load spikes. Modelling-based approaches have proved very successful...
Jin Chen, Gokul Soundararajan, Cristiana Amza