Topology for Computations of Concurrent Automata

DOI10.1142/S021819679800017XMaRDI QIDQ4354233zbMATH OpenFDO

Authors R. M. Shortt, Dietrich Kuske

Publication date 15 September 1997

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

topologyinfinite computations of concurrent automata

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Recommendations

• Rational and recognizable complex trace languages
• Infinite concurrent systems. I: The relationship between metric and order convergence
• scientific article; zbMATH DE number 176497

Cites work

• Dependence orders for computations of concurrent automata
• Labelled domains and automata with concurrency
• On finite monoids having only trivial subgroups
• On the definition of a family of automata
• Recognizable languages in concurrency monoids
• Representation of computations in concurrent automata by dependence orders
• Star-free trace languages
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(3)

• Topological Self-Stabilization with Name-Passing Process Calculi
• Topological automata
• Toward a Topological Characterization of Asynchronous Complexity

This page was built for publication: Topology for Computations of Concurrent Automata

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