Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Discrete-time control for rectangular hybrid automata
Theoretical Computer Science
Modelling with Generalized Stochastic Petri Nets
ACM SIGMETRICS Performance Evaluation Review - Special issue on Stochastic Petri Nets
Discrete Event Dynamic Systems
Decidability results in First–Order Hybrid PetriNets
Discrete Event Dynamic Systems
The Impressive Power of Stopwatches
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Modeling Urgency in Timed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Relating Time Progress and Deadlines in Hybrid Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Autonomous And Timed Continous Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Suspension Automata: A Decidable Class of Hybrid Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Generalized discrete timed automata: decidable approximations for safety verification
Theoretical Computer Science - Computing and combinatorics
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The power of reachability testing for timed automata
Theoretical Computer Science
Theoretical Computer Science
A Translation Based Method for the Timed Analysis of Scheduling Extended Time Petri Nets
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Theoretical Computer Science
Model Checking of Time Petri Nets Using the State Class Timed Automaton
Discrete Event Dynamic Systems
CTL* model checking for time Petri nets
Theoretical Computer Science
A compositional approach to CTL* verification
Theoretical Computer Science - Formal methods for components and objects
Task automata: Schedulability, decidability and undecidability
Information and Computation
Deadline-constrained media uploading systems
Multimedia Tools and Applications
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Formal verification of real-time systems with preemptive scheduling
Real-Time Systems
Discrete, Continuous, and Hybrid Petri Nets
Discrete, Continuous, and Hybrid Petri Nets
Comparison of the expressiveness of timed automata and time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 5.23 |
The aim of this research has been to associate the modeling capacities of hybrid Petri nets with the analysis power of hybrid automata in order to perform formal verification of hybrid dynamic systems. In this paper, we propose an extension of hybrid Petri nets, called multisingular hybrid Petri nets (MSHPNs), for modeling and verification of hybrid dynamic systems. This extension consists of enriching hybrid Petri nets with the capabilities of hybrid automata to control the execution and firing of transitions and some modeling facilities for describing some repeatedly encountered aspects of timed and hybrid systems. We discuss the challenging issues of speed computation raised by addition of execution predicates and introduce a speed-based partitioning technique, which is essential for state space computation. We also introduce a method for reachability analysis of MSHPNs, consisting of computing the state class graph. Thus, the verification of timing properties of MSHPNs can be conducted using the existing techniques and tools. The proposed formalism has the expressiveness of multisingular hybrid automata besides the capabilities of Petri nets for modeling concurrent and distributed systems. Some illustrative examples of the proposed formalism are also presented in this paper.