Name
Abstract | ||
|---|---|---|
In this paper we propose four transformation rules to estimate the marking of a net, discrete or continuous, satisfying the following assumptions: the set of transitions is partitioned into observable and unobservable transitions; the net structure and the initial marking is known. For each rule we derive a set of linear algebraic constraints that characterize the set of markings of the original net that are consistent with the observed firing sequence. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/COASE.2007.4341820 | 2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, VOLS 1-3 |
Keywords | Field | DocType |
satisfiability,sequences,linear algebra,petri net,petri nets | Discrete mathematics,Linear algebra,Petri net,Observable,Algebraic number,Stochastic Petri net,Unobservable,Mathematics | Conference |
ISSN | Citations | PageRank |
2161-8070 | 0 | 0.34 |
References | Authors | |
6 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maria Paola Cabasino | 1 | 318 | 23.10 |
| Alessandro Giua | 2 | 1836 | 199.57 |
| Cristian Mahulea | 3 | 161 | 19.50 |
| Laura Recalde | 4 | 54 | 4.05 |
| Carla Seatzu | 5 | 700 | 67.51 |
| Manuel Silva | 6 | 542 | 84.48 |