Abstract | ||
---|---|---|
We consider a spectrum of properties proposed in [14]. It is related to causality and concurrency between a pair of given transitions in a place/transition net. For each of these properties, we ask whether it can be verified using an ordinary, interleaving based, model checker. With a systematic approach based on two constructions, we reduce most properties in the spectrum to a reachability problem. Only one problem needs to be left open completely. Some problems can be solved only under the assumption of absent auto-concurrency. |
Year | DOI | Venue |
---|---|---|
2018 | 10.3233/FI-2018-1709 | FUNDAMENTA INFORMATICAE |
Field | DocType | Volume |
Discrete mathematics,Causality,Model checking,Concurrency,Theoretical computer science,Mathematics,Interleaving | Journal | 161 |
Issue | ISSN | Citations |
4 | 0169-2968 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Karsten Wolf | 1 | 757 | 42.53 |