58 search results - page 2 / 12 » When Are Timed Automata Weakly Timed Bisimilar to Time Petri... |
ICALP
2000
Springer
13 years 9 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
ENTCS
2002
13 years 5 months ago
2002
Petri nets where, to my knowledge, the first theoretical model augmented with time constraints [Mer74], and the support of the first reachability algorithm of timed system [BM83, ...
IANDC
2008
13 years 5 months ago
2008
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
APN
2005
Springer
13 years 7 months ago
2005
Springer
Abstract. We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass ...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...