Dependence orders for computations of concurrent automata

DOI10.1007/3-540-59042-0_97zbMath1379.68246OpenAlexW1872575215MaRDI QIDQ4596645

Felipe Bracho, Dietrich Kuske, Manfred Droste

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

Mathematics Subject Classification ID

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

Related Items (3)

Asynchronous cellular automata for pomsets without auto-concurrency ⋮ Topology for Computations of Concurrent Automata ⋮ Representation of computations in concurrent automata by dependence orders

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