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

DOI10.1051/ita/1986200302911zbMath0617.68071OpenAlexW1523561753MaRDI QIDQ4728280

No author found.

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

zbMATH Keywords

separabilitycalculus of communicating systemsclasses of infinitary languages

Mathematics Subject Classification ID

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

Related Items (2)

Proof systems for infinite behaviours ⋮ On an effective hierarchy of communicating processes: Separation principle and testing

Cites Work

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

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