Combining programs and state machines

DOI10.1016/S1567-8326(02)00020-6zbMath1008.68068OpenAlexW2114247177MaRDI QIDQ1858434

Alban Ponse, Jan A. Bergstra

Publication date: 13 February 2003

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1567-8326(02)00020-6

zbMATH Keywords

state machineprogram algebraabstract data type

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Execution architectures for program algebra ⋮ Decision problems for pushdown threads ⋮ Thread algebra for strategic interleaving ⋮ Synchronous cooperation for explicit multi-threading ⋮ On the operating unit size of load/store architectures ⋮ Program algebra with a jump-shift instruction ⋮ On the contribution of backward jumps to instruction sequence expressiveness ⋮ Simulating Turing machines on Maurer machines ⋮ Straight-line instruction sequence completeness for total calculation on cancellation meadows ⋮ Instruction sequence processing operators ⋮ A thread calculus with molecular dynamics ⋮ Machine structure oriented control code logic ⋮ Maurer computers for pipelined instruction processing ⋮ Risk assessment for one-counter threads

Cites Work

• Kleene's three-valued logic and process algebra
• What is an abstract datatype?
• Program algebra for component code
• Process algebra and conditional composition
• Program algebra for sequential code
• Laws of programming
• Unnamed Item
• Unnamed Item