When are Timed Automata weakly timed bisimilar to Time Petri Nets?
Authors:
- B. BérardBBB. Bérard
- F. CassezFCF. Cassez
- S. HaddadSHS. Haddad
- D. LimeDLD. Lime
- O.H. RouxORO.H. Roux
- 1 August 2008
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 403 (2-3) , 202-220
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Structural translation from Time Petri Nets to Timed AutomataJournal of Systems and Software, 2006
- Updatable timed automataTheoretical Computer Science, 2004
- Timed state space analysis of real-time preemptive systemsIEEE Transactions on Software Engineering, 2004
- Forward Analysis of Updatable Timed AutomataFormal Methods in System Design, 2004
- Is your model checker on time? On the complexity of model checking for timed modal logicsThe Journal of Logic and Algebraic Programming, 2002
- A causal semantics for time Petri netsTheoretical Computer Science, 2000
- Characterization of the Expressive Power of Silent Transitions in Timed AutomataFundamenta Informaticae, 1998
- Symbolic Model Checking for Real-Time SystemsInformation and Computation, 1994
- A theory of timed automataTheoretical Computer Science, 1994
- Modeling and verification of time dependent systems using time Petri netsIEEE Transactions on Software Engineering, 1991