Evolving algebras 1993: Lipari guide
Specification and validation methods
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
Abstract state machines capture parallel algorithms
ACM Transactions on Computational Logic (TOCL)
Ordinary interactive small-step algorithms, II
ACM Transactions on Computational Logic (TOCL)
Ordinary interactive small-step algorithms, III
ACM Transactions on Computational Logic (TOCL)
Abstract state machines capture parallel algorithms: Correction and extension
ACM Transactions on Computational Logic (TOCL)
Protocol Modeling with Model Program Composition
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A semantic characterization of unbounded-nondeterministic abstract state machines
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Persistent queries in the behavioral theory of algorithms
ACM Transactions on Computational Logic (TOCL)
Yuri, logic, and computer science
Fields of logic and computation
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
An ASM-Characterization of a class of distributed algorithms
Rigorous Methods for Software Construction and Analysis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Foundational analyses of computation
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Relativity and abstract state machines
SAM'12 Proceedings of the 7th international conference on System Analysis and Modeling: theory and practice
| Hi-index | 0.00 |
This is the first in a series of articles extending the abstract state machine thesis---that arbitrary algorithms are behaviorally equivalent to abstract state machines---to algorithms that can interact with their environments during a step rather than only between steps. In the present work, we describe, by means of suitable postulates, those interactive algorithms that (1) proceed in discrete, global steps; (2) perform only a bounded amount of work in each step; (3) use only such information from the environment as can be regarded as answers to queries; and (4) never complete a step until all queries from that step have been answered.We indicate how a great many sorts of interaction meet these requirements. We also discuss in detail the structure of queries and replies and the appropriate definition of equivalence of algorithms.Finally, motivated by our considerations concerning queries, we discuss a generalization of first-order logic in which the arguments of function and relation symbols are not merely tuples of elements but orbits of such tuples under groups of permutations of the argument places.