Improvements in Unfolding of Colored Petri Nets
Gespeichert in:
| Veröffentlicht in: | RP (15. : 2021 : Liverpool) Reachability Problems |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , , , |
| Format: | UnknownFormat |
| Sprache: | eng |
| Veröffentlicht: |
2021
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Tag hinzufügen | Titel | Jahr | Verfasser |
|---|---|---|
| Population Protocols: Beyond Runtime Analysis | 2021 | Esparza, Javier |
| Quantitative vs. Weighted Automata | 2021 | Boker, Udi |
| Recent Advances on Reachability Problems for Valence Systems (Invited Talk) | 2021 | Zetzsche, Georg |
| Continued Fraction Approach to Gauss Reduction Thepry | 2021 | Karpenkov, Oleg |
| Minimal Number of Calls in Propositional Protocols | 2021 | Livesey, Joseph |
| Reachability is NP-Complete Even for the Simplest Neural Networks | 2021 | Sälzer, Marco |
| Reachability of Weakly Nonlinear Systems Using Carleman Linearization | 2021 | Forets, Marcelo |
| Theorem Proving Using Clausal Resolution: From Past to Present | 2021 | Dixon, Clare |
| Improvements in Unfolding of Colored Petri Nets | 2021 | Bilgram, Alexander |
| Absent Subsequences in Words | 2021 | Kosche, Maria |