Generating Posets Beyond N

DOI10.1007/978-3-030-43520-2_6MaRDI QIDQ5098715zbMATH OpenOpenAlexFDO

Authors Uli Fahrenberg, Christian Johansen, Georg Struth, Ratan Bahadur Thapa

Publication date 30 August 2022

Published in Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.06162

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Posets with interfaces as a model for concurrency
• scientific article; zbMATH DE number 1136090
• scientific article; zbMATH DE number 1500658
• N-free posets as generalizations of series-parallel posets
• Equational Theories of Scattered and Countable Series-Parallel Posets

Cites work

• scientific article; zbMATH DE number 4030999 (Why is no real title available?)
• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 2117210 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• scientific article; zbMATH DE number 3099365 (Why is no real title available?)
• A discrete geometric model of concurrent program execution
• An algebraic characterization of the behaviour of non-sequential systems
• Completeness theorems for bi-Kleene algebras and series-parallel rational pomset languages
• Concurrent Kleene algebra and its foundations
• Concurrent Kleene algebra with observations: from hypotheses to completeness
• Concurrent Kleene algebra with tests and branching automata
• Concurrent Kleene algebra: free model and completeness
• Concurrent dynamic algebra
• Concurrent dynamic logic
• Developments in concurrent Kleene algebra
• Exploring an interface model for CKA
• Failures semantics based on interval semiwords is a congruence for refinement
• Free shuffle algebras in language varieties
• Graph structure and monadic second-order logic. A language-theoretic approach
• Interval graphs and interval orders
• Intransitive indifference with unequal indifference intervals
• Modeling concurrency with interval traces
• Modeling operational semantics with interval orders represented by sequences of antichains
• Modular construction and partial order semantics of Petri nets
• On interprocess communication. I: Basic formalism
• Presenting finite posets
• Series-parallel languages and the bounded-width property
• Structure of concurrency
• The Recognition of Series Parallel Digraphs
• The algebra of directed acyclic graphs
• The equational theory of pomsets
• The mutual exclusion problem

Cited in

(6)

• Learning pomset automata
• Presenting interval pomsets with interfaces
• Isolated suborders and their application to counting closure operators
• Languages of higher-dimensional automata
• Posets with interfaces as a model for concurrency
• r-multisemigroups, modal quantales and the origin of locality

This page was built for publication: Generating Posets Beyond N

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