Shared-Memory Systems and Charts

DOI10.1007/978-3-642-20712-9_25zbMath1332.68160OpenAlexW82643955MaRDI QIDQ3007636

Rémi Morin

Publication date: 17 June 2011

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_25

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Rational \(\omega\)-languages are non-ambiguous
• On recognizable subsets of free partially commutative monoids
• Representation of computations in concurrent automata by dependence orders
• Unambiguous Büchi automata.
• Asynchronous cellular automata for pomsets
• Infinite-state high-level MSCs: model-checking and realizability
• A theory of regular MSC languages
• A decomposition theorem for partially ordered sets
• Weak Second‐Order Arithmetic and Finite Automata
• Semantics of Deterministic Shared-Memory Systems
• UNAMBIGUOUS SHARED-MEMORY SYSTEMS
• Notes on finite asynchronous automata
• An extension of the notions of traces and of asynchronous automata
• Analysis of Programs for Parallel Processing