Distributed Asynchronous Automata (Q3184669)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Distributed Asynchronous Automata	scientific article

Statements

scholarly article

0 references

Distributed Asynchronous Automata (English)

0 references

0 references

CONCUR 2009 - Concurrency Theory

0 references

publication date

22 October 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-04081-8_9

0 references

Unfolding Synthesis of Asynchronous Automata

0 references

Asynchronous mappings and asynchronous cellular automata

0 references

0 references

Constructing Exponential-Size Deterministic Zielonka Automata

0 references

A Kleene theorem and model checking algorithms for existentially bounded communicating automata

0 references

A theory of regular MSC languages

0 references

Determinizing Büchi asynchronous automata

0 references

Mathematical Foundations of Computer Science 2005

0 references

0 references

0 references

Notes on finite asynchronous automata

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-04081-8_9

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3184669

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