Posets with interfaces as a model for concurrency
From MaRDI portal
Publication:2672275
DOI10.1016/j.ic.2022.104914OpenAlexW4225371142MaRDI QIDQ2672275
Christian Johansen, Krzysztof Ziemiański, Georg Struth, Uli Fahrenberg
Publication date: 8 June 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.10895
Partial orders, general (06A06) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Posets on up to 16 points
- Erratum to ``On the expressiveness of higher dimensional automata
- Modeling concurrency with partial orders
- The equational theory of pomsets
- An algebraic characterization of the behaviour of non-sequential systems
- Series-parallel languages and the bounded-width property
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- Modeling operational semantics with interval orders represented by sequences of antichains
- On the expressiveness of higher dimensional automata
- Intransitive indifference with unequal indifference intervals
- 2-Dimensional Categories
- Varieties generated by languages with poset operations
- Transition and cancellation in concurrency and branching time
- The Algebra of Directed Acyclic Graphs
- Trimming the Hedges: An Algebra to Tame Concurrency
- Languages of higher-dimensional automata
- Generating Posets Beyond N
- Refinement of actions and equivalence notions for concurrent systems
This page was built for publication: Posets with interfaces as a model for concurrency
