Timing Constraint Petri Nets and Their Schedulability Analysis and Verification

Ruan Jian Xue Bao/Journal of Software - China
doi 10.1360/jos180011
Full Text
Abstract

Available in full text

Categories
Software
Date
Authors
Publisher

China Science Publishing & Media Ltd.

Related search

The Complexity of Diagnosability and Opacity Verification for Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2018English

Towards Automated fUML Model Verification With Petri Nets

2019English

Petri Nets Compositional Modeling and Verification of Flexible Manufacturing Systems

2011English

Advances in Verification of Time Petri Nets and Timed Automata

Studies in Computational Intelligence
Artificial Intelligence
2006English

The Possibilities of Modeling Petri Nets and Their Extensions

2019English

Timing and Schedulability Analysis for Distributed Automotive Control Applications

2011English

Complexity Analysis of Continuous Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2015English

Symbolic Analysis of Bounded Petri Nets

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2001English

Timed Petri Nets and BQOs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy