Sciweavers

329 search results - page 33 / 66
» Asynchronous Communication in Process Algebra
Sort
View
IPPS
2003
IEEE
14 years 29 days ago
A UNITY-Based Formalism for Dynamic Distributed Systems
We describe Dynamic UNITY, a new formalism for the specification of dynamic distributed systems based on the UNITY formalism. This formalism allows for the specification and pro...
Daniel M. Zimmerman
ENTCS
2002
143views more  ENTCS 2002»
13 years 7 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...
ENTCS
2008
89views more  ENTCS 2008»
13 years 7 months ago
Dataflow Architectures for GALS
In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on t...
Syed Suhaib, Deepak Mathaikutty, Sandeep K. Shukla
TABLEAUX
1997
Springer
13 years 12 months ago
Tableau Methods for PA-Processes
Abstract. PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-proc...
Richard Mayr
DCOSS
2006
Springer
13 years 11 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama