Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages

DOI10.1051/ITA/1986200302911zbMATH Open0617.68071OpenAlexW1523561753MaRDI QIDQ4728280FDOQ4728280

Authors:

Publication date: 1986

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92261

Recommendations

• scientific article; zbMATH DE number 3978421
• On an effective hierarchy of communicating processes: Separation principle and testing
• Separating regular languages by piecewise testable and unambiguous languages
• scientific article; zbMATH DE number 3856432
• On separation by locally testable and locally threshold testable languages

zbMATH Keywords

separabilitycalculus of communicating systemsclasses of infinitary languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A calculus of communicating systems
• Testing equivalences for processes
• Software Descriptions with Flow Expressions
• Fully abstract models of typed \(\lambda\)-calculi
• Algebraic semantics
• Adherences of languages
• Title not available (Why is that?)
• Synchronous and asynchronous experiments on processes
• About fair asynchrony
• Title not available (Why is that?)

Cited In (4)

• Proof systems for infinite behaviours
• On an effective hierarchy of communicating processes: Separation principle and testing
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages

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