Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1696456 (Why is no real title available?)
- scientific article; zbMATH DE number 2088674 (Why is no real title available?)
- scientific article; zbMATH DE number 4209631 (Why is no real title available?)
- scientific article; zbMATH DE number 177824 (Why is no real title available?)
- scientific article; zbMATH DE number 1228291 (Why is no real title available?)
- scientific article; zbMATH DE number 1302047 (Why is no real title available?)
- scientific article; zbMATH DE number 559221 (Why is no real title available?)
- scientific article; zbMATH DE number 557977 (Why is no real title available?)
- scientific article; zbMATH DE number 2081112 (Why is no real title available?)
- scientific article; zbMATH DE number 1746447 (Why is no real title available?)
- scientific article; zbMATH DE number 1755138 (Why is no real title available?)
- scientific article; zbMATH DE number 1796156 (Why is no real title available?)
- scientific article; zbMATH DE number 5228180 (Why is no real title available?)
- A theory of timed automata
- Advances in verification of time Petri nets and timed automata. A temporal logic approach.
- Applications and Theory of Petri Nets 2005
- Automated Technology for Verification and Analysis
- Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
- CONCUR 2005 – Concurrency Theory
- Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets
- Complexity of some problems in Petri nets
- Compositional specification of timed systems
- Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Formal Approaches to Software Testing
- Formal Methods for the Design of Real-Time Systems
- Formal Methods for the Design of Real-Time Systems
- Formal Modeling and Analysis of Timed Systems
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- From Time Petri Nets to Timed Automata: An Untimed Approach
- Hybrid Systems: Computation and Control
- Is your model checker on time? On the complexity of model checking for timed modal logics
- Lectures on Concurrency and Petri Nets
- Model Checking Software
- Model checking of time Petri nets using the state class timed automaton
- On the synthesis of discrete controllers for timed systems
- Optimal paths in weighted timed automata
- Recoverability of Communication Protocols--Implications of a Theoretical Study
- TCTL model checking of time Petri nets
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- Time Petri nets for modelling and analysis of biochemical networks
- Time-abstracted bisimulation: Implicit specifications and decidability
- Time-based expressivity of time Petri nets for system specification
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
- Undecidability of bisimilarity for Petri nets and some related problems
- Uppaal in a nutshell
- Well-structured transition systems everywhere!
- When are timed automata weakly timed bisimilar to time Petri nets?
Cited in
(14)- Comparing Semantics Under Strong Timing of Petri Nets
- Expressiveness of Petri Nets with Stopwatches. Dense-time Part
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
- Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
- Comparative trace semantics of time Petri nets
- Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
- Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
- Timed Petri nets and timed automata: On the discriminating power of Zeno sequences
- Formal Modeling and Analysis of Timed Systems
- Verification of Timed-Arc Petri Nets
- Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
- Performance evaluation of an emergency call center: tropical polynomial systems applied to timed Petri nets
- Blending timed formal models with clock transition systems
- scientific article; zbMATH DE number 5506896 (Why is no real title available?)
This page was built for publication: Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543285)
