Concurrency-preserving minimal process representation

DOI10.1007/978-3-319-57418-9_15zbMATH Open1486.68115OpenAlexW2609656742MaRDI QIDQ5283215FDOQ5283215

Authors: Adrián Puerto 

Publication date: 21 July 2017

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-57418-9_15

Recommendations

• Closure operators and lattices derived from concurrency in posets and occurrence nets
• Closed sets in occurrence nets with conflicts
• Reduction of event structures under history preserving bisimulation
• scientific article; zbMATH DE number 7301527
• Structure of concurrency

zbMATH Keywords

latticepartial orderconcurrencyatomclosure operatorcausal net

Mathematics Subject Classification ID

Partial orders, general (06A06) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Petri nets, event structures and domains. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Partially Ordered Sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Closure operators and lattices derived from concurrency in posets and occurrence nets
• Closed sets in occurrence nets with conflicts
• Carl Adam Petri. Life and science. Translated from the German by the author and Tim Denvir

This page was built for publication: Concurrency-preserving minimal process representation

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