Article

Equivalence of Timed State Machines and Safe TPN

Authors:

S. Haar,

L. Kaiser,

F. Simonot-Lion,

J. ToussaintAuthors Info & Claims

WODES '02: Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)

Page 119

Published: 02 October 2002 Publication History

Publisher Site

Abstract

We show that an important subclass of Timed Automata (Alur and Dill [1]), called Timed State Machines, is weakly time equivalent to safe non-Zeno Time Petri Nets (TPNs) in the sense of Merlin and Farber [15]. We present an explicit construction for two-way translation between 1-safe TPN-s and TSMs. The translation improves on the efficiency of other methods: the TSM obtained for a given net is polynomial in the size of the reachability graph, and a given TSM is translated into a net whose size grows linearly with that of the automaton model.

Cited By

View all

Bérard BCassez FHaddad SLime DRoux O(2013)The expressive power of time Petri netsTheoretical Computer Science10.5555/2438099.2438154474(1-20)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.5555/2438099.2438154
Berthomieu BPeres FVernadat F(2006)Bridging the gap between timed automata and bounded time petri netsProceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems10.1007/11867340_7(82-97)Online publication date: 25-Sep-2006
https://dl.acm.org/doi/10.1007/11867340_7
Bérard BCassez FHaddad SLime DRoux O(2005)Comparison of the expressiveness of timed automata and time petri netsProceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems10.1007/11603009_17(211-225)Online publication date: 26-Sep-2005
https://dl.acm.org/doi/10.1007/11603009_17
Show More Cited By

Equivalence of Timed State Machines and Safe TPN
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation

Recommendations

When are Timed Automata weakly timed bisimilar to Time Petri Nets?

In this paper, we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly included in the class of TA. It is thus natural to try and identify the ...
Structural Translation from Time Petri Nets to Timed Automata

In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the ...
Interrupt Timed Automata: verification and expressiveness

We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.

While the reachability problem is undecidable for ...

Comments

Information & Contributors

Information

Published In

WODES '02: Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)

October 2002

ISBN:0769516831

Publisher

IEEE Computer Society

United States

Publication History

Published: 02 October 2002

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bérard BCassez FHaddad SLime DRoux O(2013)The expressive power of time Petri netsTheoretical Computer Science10.5555/2438099.2438154474(1-20)Online publication date: 1-Feb-2013
https://dl.acm.org/doi/10.5555/2438099.2438154
Berthomieu BPeres FVernadat F(2006)Bridging the gap between timed automata and bounded time petri netsProceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems10.1007/11867340_7(82-97)Online publication date: 25-Sep-2006
https://dl.acm.org/doi/10.1007/11867340_7
Bérard BCassez FHaddad SLime DRoux O(2005)Comparison of the expressiveness of timed automata and time petri netsProceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems10.1007/11603009_17(211-225)Online publication date: 26-Sep-2005
https://dl.acm.org/doi/10.1007/11603009_17
Bérard BCassez FHaddad SLime DRoux O(2005)When are timed automata weakly timed bisimilar to time petri nets?Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science10.1007/11590156_22(273-284)Online publication date: 18-Dec-2005
https://dl.acm.org/doi/10.1007/11590156_22
Srba J(2005)Timed-arc petri nets vs. networks of timed automataProceedings of the 26th international conference on Applications and Theory of Petri Nets10.1007/11494744_22(385-402)Online publication date: 20-Jun-2005
https://dl.acm.org/doi/10.1007/11494744_22

Abstract

Cited By

Recommendations

When are Timed Automata weakly timed bisimilar to Time Petri Nets?

Structural Translation from Time Petri Nets to Timed Automata

Interrupt Timed Automata: verification and expressiveness

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations