A Behavioural Theory of Recursive Algorithms

DOI10.3233/FI-2020-1978zbMath1497.68552arXiv2001.01862OpenAlexW3114754551MaRDI QIDQ4988914

Egon Börger, Klaus-Dieter Schewe

Publication date: 20 May 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.01862

zbMATH Keywords

recursive algorithmconcurrent algorithmabstract state machinebehavioural theorypartial-order run

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (2)

A Characterization of Distributed ASMs with Partial-Order Runs ⋮ Computation on structures. Behavioural theory, logic, complexity

Uses Software

• Rodin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent abstract state machines
• A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis
• System modelling with high-level Petri nets
• Process rewrite systems.
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• The B-Book
• Abstract State Machines
• On the parallel computation thesis
• Abstract Recursion and Intrinsic Complexity
• Evolving Algebras 1993: Lipari Guide
• A Characterization of Distributed ASMs with Partial-Order Runs
• Abstract state machines capture parallel algorithms
• Abstract state machines capture parallel algorithms
• Sequential abstract-state machines capture sequential algorithms

This page was built for publication: A Behavioural Theory of Recursive Algorithms