Automata on distributed alphabets
From MaRDI portal
Recommendations
Cited in
(17)- scientific article; zbMATH DE number 7559475 (Why is no real title available?)
- scientific article; zbMATH DE number 7566078 (Why is no real title available?)
- Distributed ω-Automata
- scientific article; zbMATH DE number 7204953 (Why is no real title available?)
- Kleene Theorems for Synchronous Products with Matching
- Kleene theorems for free choice automata over distributed alphabets
- Interacting Automata for Modelling Distributed Systems
- Modular constructions of distributing automata
- Distributed Time-Asynchronous Automata
- Distributed Asynchronous Automata
- Identifiers in registers. Describing network algorithms with logic
- Distribution and synchronized automata
- Asynchronous transition system games for two processes and their analysis
- Classifying recognizable infinitary trace languages using word automata
- Classifying recognizable infinitary trace languages using word automata
- Model checking distributed temporal logic
- On distributed monitoring of asynchronous systems
This page was built for publication: Automata on distributed alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4907861)