Name
Abstract | ||
|---|---|---|
Automata with weights (multiplicities) in (max,+) algebra form a class of timed automata. Determinism is a crucial property for numerous results on (max,+) automata and, in particular, for applications to performance evaluation and control of a large class of timed discrete event systems. In this paper, we show how to build a deterministic (max, +) automaton equivalent to a live and safe timed Petri net in which, between any two transitions, there exists an oriented path which contains at most one “conflict place” |
Year | DOI | Venue |
|---|---|---|
2014 | 10.3182/20140514-3-FR-4046.00091 | IFAC Proceedings Volumes |
Keywords | Field | DocType |
Petri nets,(max,+) automata,modeling,determinization | Discrete mathematics,Quantum finite automata,Automata theory,Petri net,Existential quantification,Computer science,Determinism,Automaton,Timed automaton | Conference |
Volume | Issue | ISSN |
47 | 2 | 1474-6670 |
Citations | PageRank | References |
3 | 0.39 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sébastien Lahaye | 1 | 71 | 12.16 |
| Jan Komenda | 2 | 147 | 21.85 |
| Jean-Louis Boimond | 3 | 152 | 20.21 |