On a fast decomposition method in some models of concurrent computations

DOI10.1016/0304-3975(85)90133-1zbMath0604.68067OpenAlexW1977960768MaRDI QIDQ1083211

Lutz Priese

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90133-1

zbMATH Keywords

parallel computationsautomata netsconcurrent automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Automata and concurrency
• Towards a Theory of Universal Speed-Independent Modules
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a fast decomposition method in some models of concurrent computations