Modeling concurrency with partial orders
International Journal of Parallel Programming
The greatest fixed-points and rational omega-tree languages
Theoretical Computer Science
The equational theory of pomsets
Theoretical Computer Science
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
An extension of Kleene's and Ochman´ski's theorems to infinite traces
Theoretical Computer Science
Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Asynchronous cellular automata for promsets
Theoretical Computer Science
Series-parallel languages and the bounded-width property
Theoretical Computer Science
The Book of Traces
Series-Parallel Posets: Algebra, Automata and Languages
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
A Kleene Iteration for Parallelism
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Regular Sets of Pomsets with Autoconcurrency
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Automata on Series-Parallel Biposets
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Series-parallel languages on scattered and countable posets
Theoretical Computer Science
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Series-parallel languages on scattered and countable posets
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We show that a set of uniformly width-bounded infinite series-parallel pomsets is ω-series-rational iff it is axiomatizable in monadic second order logic iff it is ω-recognizable. This extends recent work by Lodaya and Weil on sets of finite series-parallel pomsets in two aspects: It relates their notion of series-rationality to logical concepts, and it generalizes the equivalence of recognizability and series-rationality to infinite series-parallel pomsets.