Turing Machines, Transition Systems, and Interaction

DOI10.1016/S1571-0661(04)00220-8zbMath1260.68267OpenAlexW2079779258MaRDI QIDQ4917087

Dina Q. Goldin, Peter Wegner, Scott A. Smolka

Publication date: 26 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)00220-8

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems, Approaching simple and powerful service-computing¹, Turing machines, transition systems, and interaction, Validating for Liveness in Hidden Adversary Systems

Uses Software

• Esterel

Cites Work

• Higher-level synchronising devices in Meije-SCCS
• On the consistency of Koomen's fair abstraction rule
• Statecharts: a visual formalism for complex systems
• Interactive foundations of computing
• The Esterel synchronous programming language: Design, semantics, implementation
• A calculus of mobile processes. II
• Concrete domains
• Sequentiality in an extensional framework
• Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability
• Bisimulation can't be traced
• What is in a step: On the semantics of statecharts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item