Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

=> Définir comment implanter les SAN #19

Open
mikalziane opened this issue Oct 6, 2023 · 8 comments
Open

=> Définir comment implanter les SAN #19

mikalziane opened this issue Oct 6, 2023 · 8 comments

Comments

@mikalziane
Copy link
Owner

mikalziane commented Oct 6, 2023

Selon The Kronecker product and stochastic automata networks de Amy N. Langville et William J. Stewart
https://www.sciencedirect.com/science/article/pii/S0377042703009312
"One remedy for this storage problem is SANs, which store the infinitesimal generator of the Markov chain in compact form using Kronecker products."
La représentation compacte des SANs s'appuie sur les SAN descriptors de Plateau.

@mikalziane
Copy link
Owner Author

mikalziane commented Oct 12, 2023

Voir le code produit avec chatGPT dans le paquetage jKendrick.sans

@mikalziane
Copy link
Owner Author

san descriptor
Tiré du papier cité plus haut.

@mikalziane
Copy link
Owner Author

san descriptor

@mikalziane
Copy link
Owner Author

ChatGPT provided some information about the San descriptors:
Yes, Brigitte Plateau's work on Stochastic Automata Networks (SANs) often involves efficient representations of the Q-matrix using descriptors. These descriptors capture the local interactions among automata and can significantly reduce the memory requirements for storing the Q-matrix, especially when the system has a large number of states or automata.

Using SAN Descriptors
Local Event Descriptors (LED): These describe the local events in each automaton. They contain the rates of transitions that are local to an automaton.

Synchronization Event Descriptors (SED): These describe the events that synchronize multiple automata. They contain the rates of transitions that involve more than one automaton.

Functional Transition Descriptors (FTD): These describe transitions whose rates are functions of the states of one or more automata.

@mikalziane
Copy link
Owner Author

ChatGPT propose ce code
public class LocalEventDescriptor {
int fromState;
int toState;
double rate;
// ...
}

public class SynchronizationEventDescriptor {
int[] fromStates;
int[] toStates;
double rate;
// ...
}

public class FunctionalTransitionDescriptor {
int fromState;
int toState;
RateFunction rateFunction;
// ...
}

@mikalziane
Copy link
Owner Author

See https://graal.ens-lyon.fr/~abenoit/papers/RR-4259.pdf
Memory E�cient Iterative Methods for Stochastic Automata Networks

@mikalziane
Copy link
Owner Author

Un papier intéressant discute de l'implantation efficace du produit de Kronecker pour les SANs
https://link.springer.com/chapter/10.1007/978-3-540-24611-4_8
Kronecker Based Matrix Representations for Large Markov Models

@mikalziane
Copy link
Owner Author

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant