Nonsequential processes
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Elements of interaction: Turing award lecture
Communications of the ACM
Programming by multiset transformation
Communications of the ACM
ACM Transactions on Programming Languages and Systems (TOPLAS)
Evolving algebras 1993: Lipari guide
Specification and validation methods
Information Processing Letters
Debate'90: an electronic discussion on true concurrency
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Interactive foundations of computing
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed Algorithms
1983 Invited address solved problems, unsolved problems and non-problems in concurrency
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
All descriptions of algorithms, be they formal or informal, employ data structures, operations on them, and some policy to cause operations be applied to data. Gurevich calls a formal description technique for algorithms algorithm universal if it allows for each informally described algorithm a formal representation that would essentially make precise the notions used in the informal description, not employing additional data, operations or steps. Gurevich's ASM thesis claims Abstract State Machines be algorithm universal for conventional, sequential algorithms. Here we are behind properties of formal presentations that are algorithm universal for unconventional, distributed algorithms.