Dependence orders for computations of concurrent automata

DOI10.1007/3-540-59042-0_97zbMATH Open1379.68246OpenAlexW1872575215MaRDI QIDQ4596645FDOQ4596645

Authors: Felipe Bracho, Manfred Droste, Dietrich Kuske 

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_97

Recommendations

• Representation of computations in concurrent automata by dependence orders
• CONCURRENT AUTOMATA AND DOMAINS
• From domains to automata with concurrency
• Recognizable languages in concurrency monoids
• Recognizable and logically definable languages of infinite computations in concurrent automata

Mathematics Subject Classification ID

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

Cited In (11)

• Languages and logical definability in concurrency monoids
• Title not available (Why is that?)
• Representation of computations in concurrent automata by dependence orders
• Title not available (Why is that?)
• Recognizable and logically definable languages of infinite computations in concurrent automata
• Topology for Computations of Concurrent Automata
• Asynchronous cellular automata for pomsets without auto-concurrency
• From domains to automata with concurrency
• CONCURRENT AUTOMATA AND DOMAINS
• Title not available (Why is that?)
• Recognizable languages in concurrency monoids

This page was built for publication: Dependence orders for computations of concurrent automata

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