Finite Petri nets as models for recursive causal behaviour
From MaRDI portal
Recommendations
Cites work
- Concurrency and atomicity
- Failures semantics based on interval semiwords is a congruence for refinement
- Finite representations of CCS and TCSP programs by automata and Petri nets
- scientific article; zbMATH DE number 3896316 (Why is no real title available?)
- scientific article; zbMATH DE number 3974312 (Why is no real title available?)
- scientific article; zbMATH DE number 4037225 (Why is no real title available?)
- scientific article; zbMATH DE number 4060688 (Why is no real title available?)
- 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 193318 (Why is no real title available?)
Cited in
(5)- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
- Causality in bounded Petri nets is MSO definable
- Verification of causal models using petri nets
- scientific article; zbMATH DE number 1919472 (Why is no real title available?)
- On the implementation of concurrent calculi in net calculi: two case studies
This page was built for publication: Finite Petri nets as models for recursive causal behaviour
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1318729)