Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
DOI10.1016/J.TCS.2012.05.023zbMATH Open1262.68139OpenAlexW1967900449MaRDI QIDQ442295FDOQ442295
Authors: Hassan Motallebi, Mohammad Abdollahi Azgomi 
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.023
Recommendations
- Translation from multisingular hybrid Petri nets to multisingular hybrid automata
- Modeling by hybrid Petri nets and verification by hybrid automata and its analysis technique
- scientific article; zbMATH DE number 2144773
- Modeling and analysis using hybrid Petri nets
- Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
hybrid automatahybrid dynamic systemshybrid Petri nets (HPNs)multisingular hybrid Petri nets (MSHPNs)speed-based partitioningtimed systems
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- HyTech: A model checker for hybrid systems
- Title not available (Why is that?)
- A theory of timed automata
- What's decidable about hybrid automata?
- Updatable timed automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Discrete, Continuous, and Hybrid Petri Nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- The algorithmic analysis of hybrid systems
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
- Formal Modeling and Analysis of Timed Systems
- Continuous Petri nets: expressive power and decidability issues
- On hybrid Petri nets
- Discrete-time control for rectangular hybrid automata
- Task automata: Schedulability, decidability and undecidability
- The power of reachability testing for timed automata
- Generalized discrete timed automata: Decidable approximations for safety verification.
- A compositional approach to CTL\(^*\) verification
- Concurrency in timed automata
- CTL* model checking for time Petri nets
- A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
- Title not available (Why is that?)
- Applications and Theory of Petri Nets 2004
- Decidability results in first-order hybrid Petri nets
- Formal verification of real-time systems with preemptive scheduling
- Model checking of time Petri nets using the state class timed automaton
Cited In (6)
- Translation from multisingular hybrid Petri nets to multisingular hybrid automata
- Modeling by hybrid Petri nets and verification by hybrid automata and its analysis technique
- Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
- Special issue: Hybrid Petri nets
- Enzymatic competition: Modeling and verification with timed hybrid Petri nets
- Modeling and analysis using hybrid Petri nets
Uses Software
This page was built for publication: Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442295)
