Canonizable partial order generators

DOI10.1007/978-3-642-28332-1_38MaRDI QIDQ2890217zbMATH OpenOpenAlexFDO

Authors Mateus de Oliveira Oliveira

Publication date 8 June 2012

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28332-1_38

zbMATH Keywords

automatacanonizationpartial orders

Mathematics Subject Classification ID

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

Recommendations

• Hasse diagram generators and Petri nets
• Hasse Diagram Generators and Petri Nets
• scientific article; zbMATH DE number 4047060
• Building bridges between sets of partial orders
• Partial order behaviour and structure of Petri nets

Cited in

(8)

• Building bridges between sets of partial orders
• Causality in bounded Petri nets is MSO definable
• A slice theoretic approach for embedding problems on digraphs
• Reachability in graph transformation systems and slice languages
• scientific article; zbMATH DE number 1294414 (Why is no real title available?)
• Hasse diagram generators and Petri nets
• Hasse Diagram Generators and Petri Nets
• Synthesis and Analysis of Petri Nets from Causal Specifications

This page was built for publication: Canonizable partial order generators

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