When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?
Béatrice BérardFranck CassezSerge HaddadDidier LimeOlivier H. RouxPublished in: FSTTCS (2005)
Keyphrases
- petri net
- timed automata
- model checking
- reachability analysis
- theorem prover
- colored petri nets
- petri net model
- manufacturing systems
- discrete event systems
- stochastic petri net
- first order logic
- theorem proving
- temporal logic
- ims ld
- real time systems
- service composition
- machine learning
- knowledge representation
- concurrent processes
- natural language