Proving properties of a ring of finite-state machines

DOI10.1016/0020-0190(88)90211-6zbMath0664.68048OpenAlexW2066611459MaRDI QIDQ1115609

Ichiro Suzuki

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90211-6

zbMATH Keywords

verificationfinite automatonhalting problemsimulation of Turing machineunidirectional ring

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Related Items (15)

Formal verification of mobile robot protocols ⋮ A case study on parametric verification of failure detectors ⋮ Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ Liveness of Parameterized Timed Networks ⋮ Parameterized model checking of rendezvous systems ⋮ Fair Petri nets and structural induction for rings of processes ⋮ Model Checking Parameterized Systems ⋮ Verification of agent navigation in partially-known environments ⋮ Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems ⋮ Unnamed Item ⋮ Parametrized invariance for infinite state processes ⋮ Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems ⋮ Model Checking Parameterised Multi-token Systems via the Composition Method ⋮ An experience in proving regular networks of processes by modular model checking

Cites Work

• Unnamed Item

This page was built for publication: Proving properties of a ring of finite-state machines