scientific article; zbMATH DE number 1927576

zbMATH Open1012.68135MaRDI QIDQ4484501FDOQ4484501

Authors: Jean Fanchon, Rémi Morin 

Publication date: 12 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210402.htm

Title of this publication is not available (Why is that?)

Recommendations

• Towards a language theory for infinite N-free pomsets.
• The equational theory of pomsets
• Complexity Results for POMSET Languages
• Parsing Partially Ordered Multisets
• Algebra and theory of order-deterministic pomsets

Mathematics Subject Classification ID

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

Cited In (11)

• Pomset Languages of Finite Step Transition Systems
• Towards a language theory for infinite N-free pomsets.
• Closure and decision properties for higher-dimensional automata
• Complexity Results for POMSET Languages
• Shared-memory systems and charts
• Languages of higher-dimensional automata
• Realisability of pomsets
• Title not available (Why is that?)
• A Myhill-Nerode theorem for higher-dimensional automata
• Semantics of Deterministic Shared-Memory Systems
• Algebra and theory of order-deterministic pomsets

This page was built for publication:

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