A unifying logic for non-deterministic, parallel and concurrent abstract state machines
DOI10.1007/s10472-017-9569-3zbMath1459.03033arXiv1705.11097OpenAlexW2779522180MaRDI QIDQ1783738
Flavio Ferrarotti, Klaus-Dieter Schewe, Qing Wang, Loredana Tec
Publication date: 21 September 2018
Published in: Lecture Notes in Computer Science, Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.11097
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Classical models of computation (Turing machines, etc.) (68Q04)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Concurrent abstract state machines
- A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
- A unifying logic for non-deterministic, parallel and concurrent abstract state machines
- RGITL: a temporal logic framework for compositional reasoning about interleaved programs
- Temporal logic and state systems
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- Abstract State Machines
- Evolving Algebras 1993: Lipari Guide
- Abstract state machines capture parallel algorithms
- Abstract state machines capture parallel algorithms
- Nondeterministic Algorithms
- Sequential abstract-state machines capture sequential algorithms
- Completeness in the theory of types
This page was built for publication: A unifying logic for non-deterministic, parallel and concurrent abstract state machines