Sciweavers

656 search results - page 44 / 132
» A Formalization of Transition P Systems
Sort
View
ICDE
1994
IEEE
103views Database» more  ICDE 1994»
15 years 8 months ago
A Multi-Set Extended Relational Algebra - A Formal Approach to a Practical Issue
The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples in a relation. Many database languages and systems do require multi-set place, the hi...
Paul W. P. J. Grefen, Rolf A. de By
ICW
2005
IEEE
167views Communications» more  ICW 2005»
15 years 10 months ago
Dynamic Software Reconfiguration in Sensor Networks
Reconfiguration and self-adaptation are vital capabilities of sensor networks and networked embedded systems that are required to operate in dynamic environments. This paper prese...
Sachin Kogekar, Sandeep Neema, Xenofon D. Koutsouk...
ICCAD
2003
IEEE
148views Hardware» more  ICCAD 2003»
16 years 1 months ago
The Compositional Far Side of Image Computation
Symbolic image computation is the most fundamental computation in BDD-based sequential system optimization and formal verification. In this paper, we explore the use of over-appr...
Chao Wang, Gary D. Hachtel, Fabio Somenzi
CCS
2005
ACM
15 years 10 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
BIRTHDAY
2005
Springer
15 years 10 months ago
Model Theory for Process Algebra
We present a first-order extension of the algebraic theory about processes known as ACP and its main models. Useful predicates on processes, such as deadlock freedom and determini...
Jan A. Bergstra, C. A. Middelburg