The equational theory of pomsets
From MaRDI portal
Publication:1119012
DOI10.1016/0304-3975(88)90124-7zbMath0669.68015OpenAlexW1981404622MaRDI QIDQ1119012
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90124-7
Partial orders, general (06A06) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (63)
Convolution as a Unifying Concept ⋮ Towards a language theory for infinite N-free pomsets. ⋮ Taming Multirelations ⋮ Equational Theories of Scattered and Countable Series-Parallel Posets ⋮ Developments in concurrent Kleene algebra ⋮ Concurrent Kleene algebra with tests and branching automata ⋮ Nonfinite axiomatizability of the equational theory of shuffle ⋮ Behavioural Analysis of Sessions Using the Calculus of Structures ⋮ Schedulers and Finishers: On Generating the Behaviours of an Event Structure ⋮ The Laws of Programming Unify Process Calculi ⋮ Two equational theories of partial words ⋮ Bisimilarity is not finitely based over BPA with interrupt ⋮ Languages of higher-dimensional automata ⋮ Nested semantics over finite trees are equationally hard ⋮ An application of temporal projection to interleaving concurrency ⋮ Convolution and concurrency ⋮ Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers ⋮ Exploring an Interface Model for CKA ⋮ Preference Decomposition and the Expressiveness of Preference Query Languages ⋮ Axiomatizing shuffle and concatenation in languages ⋮ Free shuffle algebras in language varieties extended abstract ⋮ Posets with interfaces as a model for concurrency ⋮ Nonfinite axiomatizability of shuffle inequalities ⋮ Generating Posets Beyond N ⋮ Languages under concatenation and shuffling ⋮ Asynchronous cellular automata for pomsets without auto-concurrency ⋮ Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks ⋮ Unnamed Item ⋮ On the homomorphism order of labeled posets ⋮ On series-parallel pomset languages: rationality, context-freeness and automata ⋮ Learning pomset automata ⋮ Free shuffle algebras in language varieties ⋮ Labeled posets are universal ⋮ Unnamed Item ⋮ On Weighted Petri Net Transducers ⋮ Partition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementations ⋮ CCS with Hennessy's merge has no finite-equational axiomatization ⋮ Branching automata with costs -- a way of reflecting parallelism in costs ⋮ Concurrent Kleene algebra and its foundations ⋮ Algebraic and graph-theoretic properties of infiniten-posets ⋮ Unnamed Item ⋮ Schedulers and finishers: on generating and filtering the behaviours of an event structure ⋮ Event Correlation with Boxed Pomsets ⋮ Lattice-based sum of t-norms on bounded lattices ⋮ Operational semantics with semicommutations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Causality in Bounded Petri Nets is MSO Definable ⋮ On Locality and the Exchange Law for Concurrent Processes ⋮ Unifying Petri Net Semantics with Token Flows ⋮ Pomset Languages of Finite Step Transition Systems ⋮ Algebra and theory of order-deterministic pomsets ⋮ Representation of computations in concurrent automata by dependence orders ⋮ Series-parallel languages and the bounded-width property ⋮ Constructing weak simulations from linear implications for processes with private names ⋮ Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\) ⋮ Asynchronous cellular automata for pomsets ⋮ Unnamed Item ⋮ Decidability of split equivalence ⋮ A categorical framework for learning generalised tree automata ⋮ The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems ⋮ Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Cites Work
- A complete inference system for a class of regular behaviours
- Extending regular expressions with iterated shuffle
- Modeling concurrency with partial orders
- Net theory and applications. Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg, October 8-19, 1979. Ed. by Wilfried Brauer
- A calculus of communicating systems
- Relations of flow languages to Petri net languages
- The power of synchronizing operations on strings
- Complements and transitive closures
- A Theory of Communicating Sequential Processes
- Shuffle languages, Petri nets, and context-sensitive grammars
- The Recognition of Series Parallel Digraphs
- Time, clocks, and the ordering of events in a distributed system
- Software Descriptions with Flow Expressions
- Two Complete Axiom Systems for the Algebra of Regular Events
- The mutual exclusion problem
- Unnamed Item
- Unnamed Item
- 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: The equational theory of pomsets
