Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets

DOI10.1016/J.TCS.2012.05.023MaRDI QIDQ442295zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

hybrid automatahybrid dynamic systemshybrid Petri nets (HPNs)multisingular hybrid Petri nets (MSHPNs)speed-based partitioningtimed systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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

Cites work

• scientific article; zbMATH DE number 1948398 (Why is no real title available?)
• scientific article; zbMATH DE number 1507210 (Why is no real title available?)
• scientific article; zbMATH DE number 1759608 (Why is no real title available?)
• scientific article; zbMATH DE number 763717 (Why is no real title available?)
• scientific article; zbMATH DE number 795181 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
• A compositional approach to CTL\(^*\) verification
• A theory of timed automata
• Applications and Theory of Petri Nets 2004
• CTL* model checking for time Petri nets
• Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
• Concurrency in timed automata
• Continuous Petri nets: expressive power and decidability issues
• Decidability results in first-order hybrid Petri nets
• Discrete, Continuous, and Hybrid Petri Nets
• Discrete-time control for rectangular hybrid automata
• Formal Modeling and Analysis of Timed Systems
• Formal verification of real-time systems with preemptive scheduling
• Generalized discrete timed automata: Decidable approximations for safety verification.
• HyTech: A model checker for hybrid systems
• Model checking of time Petri nets using the state class timed automaton
• On hybrid Petri nets
• Task automata: Schedulability, decidability and undecidability
• The algorithmic analysis of hybrid systems
• The power of reachability testing for timed automata
• Updatable timed automata
• What's decidable about hybrid automata?

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
• Modeling and analysis using hybrid Petri nets
• Special issue: Hybrid Petri nets
• Enzymatic competition: Modeling and verification with timed hybrid Petri nets

Describes a project that uses

Uses Software

• Kronos
• Uppaal2k
• HyTech
• PPL
• PolyLib

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)