Generating Posets Beyond N
From MaRDI portal
Publication:5098715
DOI10.1007/978-3-030-43520-2_6OpenAlexW3013501474MaRDI QIDQ5098715
Uli Fahrenberg, Christian Johansen, Ratan Bahadur Thapa, Georg Struth
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
Related Items (4)
Languages of higher-dimensional automata ⋮ Posets with interfaces as a model for concurrency ⋮ \( \ell r\)-multisemigroups, modal quantales and the origin of locality ⋮ Learning pomset automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concurrent Kleene algebra with tests and branching automata
- Modular construction and partial order semantics of Petri nets
- Modeling concurrency with interval traces
- Concurrent Kleene algebra and its foundations
- Free shuffle algebras in language varieties
- Structure of concurrency
- Failures semantics based on interval semiwords is a congruence for refinement
- Interval graphs and interval orders
- On interprocess communication. I: Basic formalism
- The equational theory of pomsets
- An algebraic characterization of the behaviour of non-sequential systems
- Series-parallel languages and the bounded-width property
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Modeling operational semantics with interval orders represented by sequences of antichains
- Concurrent Kleene algebra: free model and completeness
- Intransitive indifference with unequal indifference intervals
- Exploring an Interface Model for CKA
- A Discrete Geometric Model of Concurrent Program Execution
- Concurrent dynamic logic
- The Recognition of Series Parallel Digraphs
- The Algebra of Directed Acyclic Graphs
- Concurrent Dynamic Algebra
- Developments in Concurrent Kleene Algebra
- Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages
- The mutual exclusion problem
This page was built for publication: Generating Posets Beyond N
