Algebra and theory of order-deterministic pomsets

DOI10.1305/ndjfl/1040046090zbMath0865.06004OpenAlexW1987134164MaRDI QIDQ1815430

Arend Rensink

Publication date: 11 December 1996

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1040046090

zbMATH Keywords

homomorphismspartially ordered setswords over a finite alphabetreflexive subcategorycategory of pomsetslabeled preordered setorder-deterministic pomsetspartially ordered multiset

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Ordered sets (06A99) Distributed algorithms (68W15)

Related Items (2)

On the homomorphism order of labeled posets ⋮ Labeled posets are universal

Cites Work

• Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
• Partial evaluation and \(\omega\)-completeness of algebraic specifications
• Modeling concurrency with partial orders
• Theory of traces
• The equational theory of pomsets
• A completeness theorem for Kleene algebras and the algebra of regular events
• Process Algebra
• Processes as terms: non-well-founded models for bisimulation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebra and theory of order-deterministic pomsets