scientific article; zbMATH DE number 177531

MaRDI QIDQ4037400zbMATH OpenFDO

Authors Eric Madelaine, Didier Vergamini

Publication date 18 May 1993

zbMATH Keywords

finite automataprocess algebrasverification by reductionverification methods for concurrent systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 177252
• scientific article; zbMATH DE number 1484272
• Finite automata over structures (extended abstract)
• scientific article; zbMATH DE number 2102705
• CONCUR 2005 – Concurrency Theory
• A ground-complete axiomatisation of finite-state processes in a generic process algebra
• Lifting non-finite axiomatizability results to extensions of process algebras
• Decision Problems for Finite Automata over Infinite Algebraic Structures
• Algebraic structures of automata
• Automata on algebraic structures

Cited in

(4)

• Proving finiteness of CCS processes by non-standard semantics
• scientific article; zbMATH DE number 177252 (Why is no real title available?)
• scientific article; zbMATH DE number 2102705 (Why is no real title available?)
• Better automata through process algebra

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037400)