Synchronized Product of Linear Bounded Machines

Authors:
Teodor Knapik;Étienne Payet
Affiliations:
-;-
Venue:
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Year:
1999

Citing 10
Cited 2

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Notes on algebraic calculi of processes

Logics and models of concurrent systems
Logics of programs

Handbook of theoretical computer science (vol. B)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Finite transition systems: semantics of communicating systems

Finite transition systems: semantics of communicating systems
Computer-aided verification of coordinating processes: the automata-theoretic approach

Computer-aided verification of coordinating processes: the automata-theoretic approach
Binary decision diagrams and beyond: enabling technologies for formal verification

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
A Theory of Program Size Formally Identical to Information Theory

Journal of the ACM (JACM)
Symbolic Model Checking

Symbolic Model Checking
On Infinite Transition Graphs Having a Decidable Monadic Theory

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming

A Chomsky-Like Hierarchy of Infinite Graphs

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Linearly bounded infinite graphs

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a class of graphs associated to linear bounded machines. It is shown that this class is closed, up to observational equivalence, under synchronized product. The first-order theory of these graphs is investegated and shown to be undecidable. The latter result extends to any logic in which the existence of sinks may be stated.