Analyzing Paths in Time Petri Nets

Popova-Zeugmann, Louchka; Schlatter, Dirk

doi:10.3233/fi-1999-37307

Search citation statements

Order By: Relevance

Paper Sections

Select...

Third-party Support1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2008

2015

Publication Types

Select...

Book5

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 13 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, we also support a smaller abstraction of the state graph, that preserves CTL properties provided atomic properties of the formula do not refer to clocks. This abstraction called essential states was first defined [27] for time Petri nets in a discrete time setting (and is implemented notably by the tool Tina [8] see option −SD). It retains in the state graph only states that are reached through a discrete transition.…”

Section: Third-party Supportmentioning

confidence: 99%

Symbolic Model-Checking Using ITS-Tools

Thierry-Mieg

2015

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

International audienceWe present verification toolset ITS-tools, featuring a symbolic model-checking back-end engine based on hierarchical set decision diagrams (SDD) that supports reachability, CTL and LTL model-checking and a user-friendly eclipse based front-end. Using model transformations to a Guarded Action Language (GAL) as intermediate format, ITS-tools can analyze third party (Uppaal, Spin, Divine...) specifications

show abstract

Section: Third-party Supportmentioning

confidence: 99%