On the expressive power of timed automata and time petri nets

Authors:
B. Bérard
Affiliations:
LAMSADE, Paris, France
Venue:
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Year:
2008

Citing 14
Cited 0

Timing assumptions and verification of finite-state concurrent systems

Proceedings of the international workshop on Automatic verification methods for finite state systems
Modeling and Verification of Time Dependent Systems Using Time Petri Nets

IEEE Transactions on Software Engineering
A theory of timed automata

Theoretical Computer Science
Symbolic model checking for real-time systems

Information and Computation
Timed Petri Nets and BQOs

ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Equivalence of Timed State Machines and Safe TPN

WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
A study of the recoverability of computing systems.

A study of the recoverability of computing systems.
Time Petri Nets Analysis with TINA

QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Timed petri nets and timed automata: on the discriminating power of zeno sequences

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Comparison of different semantics for time petri nets

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Comparison of the expressiveness of timed automata and time petri nets

FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
When are timed automata weakly timed bisimilar to time petri nets?

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Romeo: a tool for analyzing time petri nets

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed petri nets

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This presentation is based on joint work with F. Cassez*, S. Haddad**, D. Lime* and O. H. Roux* (*IRCCyN, Nantes and **LSV, Cachan), published in the proceedings of ATVA'05, CONCUR'05, FSTTCS'05, with an extended version of the third paper to appear in Theoretical Computer Science. The aim of this work was to compare the expressive power of Timed Automata (TA) and Time Petri Nets (TPN).