The expressive power of time Petri nets
- 20 December 2012
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 474, 1-20
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- When are Timed Automata weakly timed bisimilar to Time Petri Nets?Theoretical Computer Science, 2008
- Structural translation from Time Petri Nets to Timed AutomataJournal of Systems and Software, 2006
- Model Checking of Time Petri Nets Using the State Class Timed AutomatonDiscrete Event Dynamic Systems, 2006
- Automata for modeling real-time systems2005
- The tool TINA – Construction of abstract state spaces for petri nets and time petri netsInternational Journal of Production Research, 2004
- Event-clock automata: a determinizable class of timed automataTheoretical Computer Science, 1999
- Reset nets between decidability and undecidability1998
- A theory of timed automataTheoretical Computer Science, 1994
- Complexity of some problems in Petri netsTheoretical Computer Science, 1977
- Some decision problems related to the reachability problem for Petri netsTheoretical Computer Science, 1976