scientific article; zbMATH DE number 3784244
From MaRDI portal
Publication:3962450
Cited in
(59)- Quasi-self-stabilization of a distributed system assuming read/write atomicity
- An implementation of mutual inclusion
- Inversion of a recursive tree traversal
- Binary self-stabilization in distributed systems
- The ring of k-regular sequences
- Self-stabilizing ring orientation using constant space
- Generalizing Morley's and other theorems with automated realization
- A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity
- Algorithms for dense graphs and networks on the random access computer
- Simplified infrastructure for the transformation of XML models
- Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
- Exact quantitative probabilistic model checking through rational search
- Binary signed-digit integers and the Stern diatomic sequence
- Fifty years of Hoare's logic
- Synchronization of finite-state pulse-coupled oscillators
- Fast rendezvous on a cycle by agents with different speeds
- A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
- A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
- Rewriting strategies and strategic rewrite programs
- Distributed patrolling with two-speed robots (and an application to transportation)
- Friends with benefits. Implementing corecursion in foundational proof assistants
- The science of desire: a systematic approach to mathematical modeling
- Global synchronization of pulse-coupled oscillators on trees
- Synthesis of large dynamic concurrent programs from dynamic specifications
- Joyce—A programming language for distributed systems
- Stern-Brocot Tree
- “Curiouser and curiouser” said alice. further reflections on an interesting recursive function
- Strategic port graph rewriting: an interactive modelling framework
- A digit reversal property for an analogue of Stern's sequence
- Definite descriptions and Dijkstra's odd powers of odd integers problem
- Position discovery for a system of bouncing robots
- scientific article; zbMATH DE number 7453187 (Why is no real title available?)
- A trigonometrical approach to Morley's observation
- Self-stabilizing multi-token rings
- Integrating security policies with computer systems by means of AOP with application to Apache FTP server
- Modularity in mathematics
- A digit reversal property for Stern polynomials
- Computing by mobile robotic sensors
- Complete sets of cooperations
- Finding strong components using depth-first search
- Robotic system specification language use case
- \(v\)-palindromes: an analogy to the palindromes
- Formal derivation of an algorithm for distributed phase synchronization
- Hyperbinary partitions and q-deformed rationals
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- Three ways of proving termination of loops
- Composition: a way to make proofs harder
- The need for compositional proof systems: a survey
- Reversify any sequential algorithm
- Should computations halt?
- Self-stabilizing graph exploration by a single agent
- An expressive model for the specification and analysis of obligations
- Correctness of a Set-based Algorithm for Computing Strongly Connected Components of a Graph
- Program inversion in the refinement calculus
- A self-stabilizing algorithm for the shortest path problem assuming the distributed demon
- Problem solving with well posedness analysis. I.
- Command algebras, recursion and program transformation
- Local spreading algorithms for autonomous robot systems
- Self-deployment of mobile sensors on a ring
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962450)
