Pomset Languages of Finite Step Transition Systems
From MaRDI portal
Publication:3636841
DOI10.1007/978-3-642-02424-5_7zbMath1242.68177OpenAlexW2146130261MaRDI QIDQ3636841
Publication date: 30 June 2009
Published in: Applications and Theory of Petri Nets (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02424-5_7
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modular construction and partial order semantics of Petri nets
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Modeling concurrency with partial orders
- The equational theory of pomsets
- The monadic second-order logic of graphs. X: Linear orderings
- Series-parallel languages and the bounded-width property
- Asynchronous cellular automata for pomsets
- Towards a language theory for infinite N-free pomsets.
- A trace semantics for Petri nets
- Message-passing automata are expressively equivalent to EMSO logic
- Tree acceptors and some of their applications
- A theory of regular MSC languages
- A decomposition theorem for partially ordered sets
- Weak Second‐Order Arithmetic and Finite Automata
- An extension of the notions of traces and of asynchronous automata
- PETRI NETS AND STEP TRANSITION SYSTEMS
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA
- Generalized finite automata theory with an application to a decision problem of second-order logic
This page was built for publication: Pomset Languages of Finite Step Transition Systems