Shared-memory systems and charts
From MaRDI portal
Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- A decomposition theorem for partially ordered sets
- A theory of regular MSC languages
- An extension of the notions of traces and of asynchronous automata
- Analysis of Programs for Parallel Processing
- Asynchronous cellular automata for pomsets
- scientific article; zbMATH DE number 1305000 (Why is no real title available?)
- scientific article; zbMATH DE number 1927576 (Why is no real title available?)
- Infinite-state high-level MSCs: model-checking and realizability
- Notes on finite asynchronous automata
- On recognizable subsets of free partially commutative monoids
- Rational \(\omega\)-languages are non-ambiguous
- Representation of computations in concurrent automata by dependence orders
- Semantics of Deterministic Shared-Memory Systems
- Unambiguous Büchi automata.
- Unambiguous shared-memory systems
- Weak Second‐Order Arithmetic and Finite Automata
This page was built for publication: Shared-memory systems and charts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3007636)