Bisimulation and effectiveness

DOI10.1016/0020-0190(89)90168-3zbMath0668.68028OpenAlexW97425458MaRDI QIDQ1118393

S. H. Smith

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90168-3

zbMATH Keywords

bisimulationhalting problem

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Theory of operating systems (68N25)

Related Items

Reactive Turing machines ⋮ Undecidability of bisimilarity for Petri nets and some related problems ⋮ Reactive Turing Machines

Cites Work

• Formal verification of parallel programs
• Unnamed Item
• Unnamed Item
• Unnamed Item