Communicating sequential processes
Communicating sequential processes
Communication and concurrency
Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Combinatorics on traces
Handbook of theoretical computer science (vol. B)
Distributed computing: models and methods
Handbook of theoretical computer science (vol. B)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Concurrent timestamping made simple
ISTCS'92 Symposium proceedings on Theory of computing and systems
Some combinatorial aspects of time-stamp systems
European Journal of Combinatorics
Asynchronous mappings and asynchronous cellular automata
Information and Computation
A logical study of distributed transition systems
Information and Computation
Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Asynchronous Cellular Automata for Infinite Traces
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On the Complementation of Büchi Asynchronous Cellular Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Determinizing Asynchronous Automata
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Safe Executions of Recognizable Trace Languages by Asynchronous Automata
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Determinizing Büchi Asnchronous Automata
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Distributed Processes and the Logic of Knowledge
Proceedings of the Conference on Logic of Programs
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Bounded time-stamping in message-passing systems
Theoretical Computer Science
Complete and Tractable Local Linear Time Temporal Logics over Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Keeping Track of the Latest Gossip in Shared Memory Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Local Normal Forms for Logics over Traces
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Time-stamps for Mazurkiewicz traces
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
A regular viewpoint on processes and algebra
Acta Cybernetica
Optimal Zielonka-type construction of deterministic asynchronous automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Kleene theorems for product systems
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Constructing exponential-size deterministic zielonka automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Asynchronous automata-theoretic characterization of aperiodic trace languages
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Learning the news in social networks
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Note: A quadratic construction for Zielonka automata with acyclic communication structure
Theoretical Computer Science
| Hi-index | 0.00 |
We tackle a natural problem from distributed computing, involving time-stamps. Let p={p1,p2, ...,pN} be a set of computing agents or processes which synchronize with each other from time to time and exchange information about themselves and others. The gossip problem is the following: Whenever a set P ⊆ P meets, the processes in P must decide amongst themselves which of them has the latest information, direct or indirect, about each agent p in the system. We propose an algorithm to solve this problem which is finite-state and local. Formally, this means that our algorithm can be implemented as an asynchronous automation.