Expressiveness of Process Algebras (Q2870198)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Expressiveness of Process Algebras	scientific article

Statements

scholarly article

0 references

Expressiveness of Process Algebras (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.entcs.2008.04.011

0 references

0 references

Electronic Notes in Theoretical Computer Science

0 references

publication date

17 January 2014

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

process algebra

0 references

expressiveness

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.entcs.2008.04.011

0 references

0 references

On the consistency of Koomen's fair abstraction rule

0 references

Automata, Languages and Programming

0 references

0 references

Higher-level synchronising devices in Meije-SCCS

0 references

What is a ``good'' encoding of guarded choice?

0 references

Decoding choice encodings

0 references

0 references

0 references

From π-calculus to higher-order π-calculus — and back

0 references

Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2870198

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2870198&oldid=35368746"