Safety analysis of timing properties in real-time systems
IEEE Transactions on Software Engineering - Special issue on reliability and safety in real-time process control
Safety Analysis Using Petri Nets
IEEE Transactions on Software Engineering
Modeling of Concurrent Task Execution in a Distributed System for Real-Time Control
IEEE Transactions on Computers
A graph-theoretic approach for timing analysis and its implementation
IEEE Transactions on Computers - Special Issue on Real-Time Systems
A Generalized Timed Petri Net Model for Performance Analysis
IEEE Transactions on Software Engineering
IEEE Transactions on Computers
Application of Real-Time Monitoring to Scheduling Tasks with Random Execution Times
IEEE Transactions on Software Engineering
A Noninterference Monitoring and Replay Mechanism for Real-Time Software Testing and Debugging
IEEE Transactions on Software Engineering
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
A Unified High-Level Petri Net Formalism for Time-Critical Systems
IEEE Transactions on Software Engineering
Analyzing Hard-Real-Time Programs for Guaranteed Schedulability
IEEE Transactions on Software Engineering
A Hybrid Knowledge Representation as a Basis of Requirement Specification and Specification Analysis
IEEE Transactions on Software Engineering - Special issue on software maintenance
Monitoring and debugging of distributed real-time systems
Monitoring and debugging of distributed real-time systems
Knowledge-Based Software Development for Real-Time Distributed Systems
Knowledge-Based Software Development for Real-Time Distributed Systems
A New Structural Induction Theorem for Rings of Temporal Petri Nets
IEEE Transactions on Software Engineering
Proving Properties of Real-Time Systems Through Logical Specifications and Petri Net Models
IEEE Transactions on Software Engineering
Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis
IEEE Transactions on Software Engineering
Dependability Modeling and Analysis of Distributed Programs
IEEE Transactions on Software Engineering
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
Modeling and Analysis of Workflows Using Petri Nets
Journal of Intelligent Information Systems - Special issue on workflow management systems
PSCP: a scalable parallel ASIP architecture for reactive systems
Proceedings of the conference on Design, automation and test in Europe
Reduction Methods for Real-Time Systems Using Delay Time Petri Nets
IEEE Transactions on Software Engineering
Schedulability analysis of real time actor systems using coloured petri nets
Concurrent object-oriented programming and petri nets
Off-Line Computation of Real-Time Schedules Using Petri Nets
Discrete Event Dynamic Systems
Model and Algorithm for Efficient Verification of High-Assurance Properties of Real-Time Systems
IEEE Transactions on Knowledge and Data Engineering
Verifying Timing Properties for Distributed Real-Time Systems Using Timing Constraint Petri Nets
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
Performance analysis of multistage interconnection networks with a new high-level net model
Journal of Systems Architecture: the EUROMICRO Journal
Synthesis of timing scenarios for embedded systems using modular Petri nets
CEA'07 Proceedings of the 2007 annual Conference on International Conference on Computer Engineering and Applications
Compositional verification of timing constraints for embedded real-time systems
ACOS'07 Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6
Using time stream Petri nets over a service architecture for workflow modelling and enactment
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
A four dimensional petri net approach for workflow management
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Analysis of temporal uncertainty of trains converging based on fuzzy time petri nets
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
An alarm management framework for automated network fault identification
Computer Communications
Time petri nets for schedulability analysis of the transactional event handlers of P-FRP
Proceedings of the 2012 ACM Research in Applied Computation Symposium
Workflow performance analysis and simulation based on multidimensional workflow net
Computers in Industry
Analysis of real-time system conflict based on fuzzy time Petri nets
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Hi-index | 0.00 |
We present timing constraint Petri nets (or TCPN's for short) and describe how to use them to model a real-time system specification and determine whether the specification is schedulable with respect to imposed timing constraints. The strength of TCPN's over other time-related Petri nets is in the modeling and analysis of conflict structures. Schedulability analysis is conducted in three steps: specification modeling, reachability simulation, and timing analysis. First, we model a real-time system by transforming its system specification along with its imposed timing constraints into a TCPN; we call this net Ns. Then we simulate the reachability of Ns to verify whether a marking, Mn, is reachable from an initial marking, Mo. It is important to note that a reachable marking in Petri nets is not necessarily reachable in TCPN's due to the imposed timing constraints, Therefore, in the timing analysis step, a reachable marking Mn, found in the reachability simulation step is analyzed to verify whether Mn, is reachable with the timing constraints. Mn is said to be reachable in the TCPN's if and only if we can find at least one firing sequence σ so that all transitions in σ are strongly schedulable with respect to Mo under the timing constraints. If such Mn can be found, then we can assert that the specification is schedulable under the imposed timing constraints, otherwise the system specification needs to be modified or the timing constraints need to be relaxed. We also present a synthesis method for determining the best approximation of the earliest fire beginning time (EFBT) and the latest fire ending time (LFET) of each strongly schedulable transition