Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
type: Item
instance of: scholarly article
title: Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
zbMATH Open document ID: 1262.68139
author: Hassan Motallebi
author: Mohammad Abdollahi Azgomi
published in: Theoretical Computer Science
publication date: 2012-08-10T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6064624
zbMATH Keywords: hybrid dynamic systems
zbMATH Keywords: timed systems
zbMATH Keywords: hybrid Petri nets (HPNs)
zbMATH Keywords: hybrid automata
zbMATH Keywords: multisingular hybrid Petri nets (MSHPNs)
zbMATH Keywords: speed-based partitioning
describes a project that uses: HyTech
describes a project that uses: Uppaal2k
describes a project that uses: PPL
describes a project that uses: Kronos
describes a project that uses: PolyLib
MaRDI profile type: MaRDI publication profile
full work available at URL: j.tcs.2012.05.023
OpenAlex ID: W1967900449
cites work: CONTINUOUS PETRI NETS: EXPRESSIVE POWER AND DECIDABILITY ISSUES
cites work: The algorithmic analysis of hybrid systems
cites work: Concurrency in timed automata
cites work: A compositional approach to CTL\(^*\) verification
cites work: Q4503930
cites work: Discrete, Continuous, and Hybrid Petri Nets
cites work: Formal verification of real-time systems with preemptive scheduling
cites work: What's decidable about hybrid automata?
cites work: HyTech: A model checker for hybrid systems
cites work: Discrete-time control for rectangular hybrid automata
cites work: A theory of timed automata
cites work: The power of reachability testing for timed automata
cites work: Q4536599
cites work: Updatable timed automata
cites work: Generalized discrete timed automata: Decidable approximations for safety verification.
cites work: Q4845331
cites work: Task automata: Schedulability, decidability and undecidability
cites work: Applications and Theory of Petri Nets 2004
cites work: CTL* model checking for time Petri nets
cites work: Model checking of time Petri nets using the state class timed automaton
cites work: Formal Modeling and Analysis of Timed Systems
cites work: Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
cites work: On hybrid Petri nets
cites work: Decidability results in first-order hybrid Petri nets
cites work: A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
cites work: Q4411960
cites work: Q4835250
cites work: Q5322945
DOI: 10.1016/J.TCS.2012.05.023
description: scientific article; zbMATH DE number 6064624