2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing 2011
DOI: 10.1109/synasc.2011.16
|View full text |Cite
|
Sign up to set email alerts
|

Reachability Analysis of Time Basic Petri Nets: A Time Coverage Approach

Abstract: We introduce a technique for reachability analysis of Time-Basic (TB) Petri nets, a powerful formalism for realtime systems where time constraints are expressed as intervals, representing possible transition firing times, whose bounds are functions of marking's time description. The technique consists of building a symbolic reachability graph relying on a sort of time coverage, and overcomes the limitations of the only available analyzer for TB nets, based in turn on a time-bounded inspection of a (possibly in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
14
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(14 citation statements)
references
References 10 publications
0
14
0
Order By: Relevance
“…The Time Reachability Graph (TRG) [32] is an abstract state-transition system which covers the infinite state space associated with a TB net model. The TRG construction, implemented by the Graphgen software tool [32,33], relies on the symbolic state notion and the symbolic firing mechanism.…”
Section: Time Reachability Graphmentioning
confidence: 99%
See 4 more Smart Citations
“…The Time Reachability Graph (TRG) [32] is an abstract state-transition system which covers the infinite state space associated with a TB net model. The TRG construction, implemented by the Graphgen software tool [32,33], relies on the symbolic state notion and the symbolic firing mechanism.…”
Section: Time Reachability Graphmentioning
confidence: 99%
“…The TRG construction, implemented by the Graphgen software tool [32,33], relies on the symbolic state notion and the symbolic firing mechanism. Let T S = {T i } i≥0 , be the set of time-stamp symbols.…”
Section: Time Reachability Graphmentioning
confidence: 99%
See 3 more Smart Citations