Sciweavers

656 search results - page 115 / 132
» A Formalization of Transition P Systems
Sort
View
72
Voted
SLOGICA
2002
74views more  SLOGICA 2002»
14 years 9 months ago
Transfers between Logics and their Applications
In this paper, logics are conceived as two-sorted first-order structures, and we argue that this broad definition encompasses a wide class of logics with theoretical interest as w...
Marcelo E. Coniglio, Walter Alexandre Carnielli
WWW
2003
ACM
15 years 10 months ago
The chatty web: emergent semantics through gossiping
This paper describes a novel approach for obtaining semantic interoperability among data sources in a bottom-up, semiautomatic manner without relying on pre-existing, global seman...
Karl Aberer, Manfred Hauswirth, Philippe Cudr&eacu...
ASYNC
2000
IEEE
122views Hardware» more  ASYNC 2000»
15 years 1 months ago
DUDES: A Fault Abstraction and Collapsing Framework for Asynchronous Circuits
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
Philip P. Shirvani, Subhasish Mitra, Jo C. Ebergen...
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
15 years 3 months ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
CHARME
2005
Springer
122views Hardware» more  CHARME 2005»
15 years 3 months ago
Regular Vacuity
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...
Doron Bustan, Alon Flaisher, Orna Grumberg, Orna K...