Hasse Diagram Generators and Petri Nets

DOI10.3233/FI-2010-367zbMath1217.68155OpenAlexW4249622096MaRDI QIDQ5894195

Mateus de Oliveira Oliveira

Publication date: 28 March 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2010-367

zbMATH Keywords

Petri netscausality\(k\)-safe \(p/t\)-netsbounded \(p/t\)-netsHasse diagram generatorspartial order theory of concurrency

Mathematics Subject Classification ID

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

Related Items (5)

An algorithmic metatheorem for directed treewidth ⋮ Reachability in Graph Transformation Systems and Slice Languages ⋮ Order Reconfiguration under Width Constraints ⋮ Causality in Bounded Petri Nets is MSO Definable ⋮ A Slice Theoretic Approach for Embedding Problems on Digraphs

This page was built for publication: Hasse Diagram Generators and Petri Nets