Pomset Languages of Finite Step Transition Systems

DOI10.1007/978-3-642-02424-5_7MaRDI QIDQ3636841zbMATH OpenOpenAlexFDO

Authors Jean Fanchon, Rémi Morin

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Complexity Results for POMSET Languages
• On series-parallel pomset languages: rationality, context-freeness and automata
• scientific article; zbMATH DE number 1916672
• scientific article; zbMATH DE number 1759627
• Towards a language theory for infinite N-free pomsets.
• Language representability of finite P/T nets
• Finite-state \(\omega\)-languages
• scientific article; zbMATH DE number 1104370
• The expressiveness of a family of finite set languages
• Algebraic characterization of petri net pomset semantics

Cites work

• A decomposition theorem for partially ordered sets
• A theory of regular MSC languages
• A trace semantics for Petri nets
• An extension of the notions of traces and of asynchronous automata
• Asynchronous cellular automata for pomsets
• Generalized finite automata theory with an application to a decision problem of second-order logic
• scientific article; zbMATH DE number 4087033 (Why is no real title available?)
• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 1305000 (Why is no real title available?)
• scientific article; zbMATH DE number 1927576 (Why is no real title available?)
• scientific article; zbMATH DE number 2086413 (Why is no real title available?)
• scientific article; zbMATH DE number 1916672 (Why is no real title available?)
• Message-passing automata are expressively equivalent to EMSO logic
• Modeling concurrency with partial orders
• Modular construction and partial order semantics of Petri nets
• Partial (set) 2-structures. II: State spaces of concurrent systems
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Recognizable and logically definable languages of infinite computations in concurrent automata
• Series-parallel languages and the bounded-width property
• The equational theory of pomsets
• The monadic second-order logic of graphs. X: Linear orderings
• Towards a language theory for infinite N-free pomsets.
• Tree acceptors and some of their applications
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(7)

• scientific article; zbMATH DE number 1759627 (Why is no real title available?)
• scientific article; zbMATH DE number 1916672 (Why is no real title available?)
• A CHARACTERIZATION OF PARIKH SETS OF ET0L LANGUAGES IN TERMS OF P SYSTEMS
• Strictifying and taming directed paths in higher dimensional automata
• Synthesis and Analysis of Petri Nets from Causal Specifications
• A Myhill-Nerode theorem for higher-dimensional automata
• Logic and languages of higher-dimensional automata

This page was built for publication: Pomset Languages of Finite Step Transition Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636841)