Sciweavers

4604 search results - page 663 / 921
» Concurrency in Synchronous Systems
Sort
View
CODES
2001
IEEE
15 years 4 months ago
Development cost and size estimation starting from high-level specifications
This paper addresses the problem of estimating cost and development effort of a system, starting from its complete or partial high-level description. In addition, some modificatio...
William Fornaciari, Fabio Salice, Umberto Bondi, E...
CODES
2001
IEEE
15 years 4 months ago
A trace transformation technique for communication refinement
Models of computation like Kahn and dataflow process networks provide convenient means for modeling signal processing applicahis is partly due to the abstract primitives that thes...
Paul Lieverse, Pieter van der Wolf, Ed F. Deprette...
CONCUR
2000
Springer
15 years 4 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
FSTTCS
2000
Springer
15 years 4 months ago
Formal Verification of the Ricart-Agrawala Algorithm
Abstract. This paper presents the first formal verification of the RicartAgrawala algorithm [RA81] for distributed mutual exclusion of an arbitrary number of nodes. It uses the Tem...
Ekaterina Sedletsky, Amir Pnueli, Mordechai Ben-Ar...
115
Voted
GI
2000
Springer
15 years 4 months ago
Taming the Tiger: How to Cope with Real Database Products in Transactional Federations for Internet Applications
Data consistency in transactional federations is a key requirement of advanced E-service applications on the Internet, such as electronic auctions or real-estate purchase. Federat...
Ralf Schenkel, Gerhard Weikum