On the public citation graph
When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?
0 signed · 33 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1045openalex-snapshot
Symbolic Model Checking for Real-Time Systems
inferredcites →https://doi.org/10.1007/11562948_23openalex-snapshot
Comparison of Different Semantics for Time Petri Nets
inferredcites →https://doi.org/10.1007/11603009_17openalex-snapshot
Comparison of the Expressiveness of Timed Automata and Time Petri Nets
inferredcites →https://doi.org/10.1007/11787006_36openalex-snapshot
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
inferredcites →https://doi.org/10.1007/3-540-36577-x_33openalex-snapshot
State Class Constructions for Branching Analysis of Time Petri Nets
inferredcites →https://doi.org/10.1007/3-540-52148-8_17openalex-snapshot
Timing assumptions and verification of finite-state concurrent systems
inferredcites →https://doi.org/10.1007/s100090050009openalex-snapshot
KRONOS: a verification tool for real-time systems
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/s0304-3975(99)00114-0openalex-snapshot
A causal semantics for time Petri nets
inferredcites →https://doi.org/10.1016/s1567-8326(02)00022-xopenalex-snapshot
Is your model checker on time? On the complexity of model checking for timed modal logics
inferredcites →https://doi.org/10.1023/b:form.0000026093.21513.31openalex-snapshot
Forward Analysis of Updatable Timed Automata
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/32.75415openalex-snapshot
Modeling and verification of time dependent systems using time Petri nets
inferredcites →https://doi.org/10.1109/pnpm.2003.1231549openalex-snapshot
State class timed automaton of a time Petri net
inferredcites →https://doi.org/10.1109/qest.2006.56openalex-snapshot
Time Petri Nets Analysis with TINA
inferredcites →https://doi.org/10.1109/tse.2004.1265815openalex-snapshot
Timed state space analysis of real-time preemptive systems
inferredcites →https://doi.org/10.1109/wodes.2002.1167678openalex-snapshot
Equivalence of timed state machines and safe TPN
inferredcites →https://doi.org/10.3233/fi-1998-36233openalex-snapshot
Characterization of the Expressive Power of Silent Transitions in Timed Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_7openalex-snapshot
Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-85778-5_3openalex-snapshot
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-05031-2_1openalex-snapshot
Testing Real-Time Systems Using TINA
inferred← citeshttps://doi.org/10.1007/s10626-011-0102-2openalex-snapshot
On the composition of time Petri nets
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.030openalex-snapshot
When are Timed Automata weakly timed bisimilar to Time Petri Nets?
inferred← citeshttps://doi.org/10.1109/aiccsa.2008.4493609openalex-snapshot
Test of preemptive real-time systems
inferred← citeshttps://doi.org/10.1109/cise.2009.5366263openalex-snapshot
Translation Methods from Timed Automata to Time Petri Nets
inferred← citeshttps://doi.org/10.1109/icmtma.2010.82openalex-snapshot
Comparison of the Expressiveness of Time Petri Nets and Timed Automata
inferred← citeshttps://doi.org/10.1109/valid.2009.31openalex-snapshot
Time-Optimal Real-Time Test Case Generation Using Prioritized Time Petri Nets
inferred← citeshttps://doi.org/10.4018/ijertcs.2013100101openalex-snapshot
Conformance Testing of Preemptive Real-Time Systems
inferred← citeshttps://doi.org/10.70675/47c0f168z6806z460dz9c3fzeff81c4e7df7openalex-snapshot
Réseaux de Petri temporels à inhibitions / permissions : application à la modélisation et vérification de systèmes de tâches temps réel
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.