Recommendations
Cited in
(20)- Well quasi-orders arising from finite ordered semigroups
- The transformation monoid of a partially lossy queue
- On freeze LTL with ordered attributes
- Complexity hierarchies beyond elementary
- The ideal approach to computing closed subsets in well-quasi-orderings
- About priority encoding transmission
- The inclusion structure of partially lossy queue monoids and their trace submonoids
- The Cayley-graph of the queue monoid: logic and decidability
- The Parametric Complexity of Lossy Counter Machines
- On functions weakly computable by pushdown Petri nets and related systems
- The Power of Priority Channel Systems
- Perfect failure detection with very few bits
- The ideal view on Rackoff's coverability technique
- Send to me first: Priority in synchronous message-passing
- Branching in well-structured transition systems (invited talk)
- On the width of the Cartesian product of ordinals
- Priority downward closures
- Verifying unboundedness via amalgamation
- Reachability problems on reliable and lossy queue automata
- On the state complexity of closures and interiors of regular languages with subwords and superwords
This page was built for publication: The power of priority channel systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892062)