Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Scheduling Tasks with Resource Requirements in Hard Real-Time Systems
IEEE Transactions on Software Engineering
Safety Analysis Using Petri Nets
IEEE Transactions on Software Engineering
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Timing assumptions and verification of finite-state concurrent systems
Proceedings of the international workshop on Automatic verification methods for finite state systems
Automata for modeling real-time systems
Proceedings of the seventeenth international colloquium on Automata, languages and programming
What is predictability for real-time systems?
Real-Time Systems
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Compiling Real-Time Specifications into Extended Automata
IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
Allocation and Scheduling of Precedence-Related Periodic Tasks
IEEE Transactions on Parallel and Distributed Systems
Timing Analysis of Ada Tasking Programs
IEEE Transactions on Software Engineering - Special issue: best papers of the 1996 international symposium on software testing and analysis ISSTA'96
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
IEEE Transactions on Software Engineering
Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems
IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Dynamic Scheduling of Real-Time Tasks, by Assignment
IEEE Concurrency
The Spring Kernel: A New Paradigm for Real-Time Systems
IEEE Software
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Deciding Properties of Timed Transition Models
IEEE Transactions on Parallel and Distributed Systems
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems
IEEE Transactions on Software Engineering
Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis
IEEE Transactions on Software Engineering
Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets
IEEE Transactions on Software Engineering
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
Modular State Space Analysis of Coloured Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Minimum and Maximum Delay Problems in Real-Time Systems
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Verification with Real-Time COSPAN
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Scheduling a Steel Plant with Timed Automata
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Timed Automata as Task Models for Event-Driven Systems
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Timed State Space Analysis of Real-Time Preemptive Systems
IEEE Transactions on Software Engineering
Verifying functions in online stock trading systems
Journal of Computer Science and Technology
Exploiting Temporal Uncertainty in the Distributed Simulation of Time Petri Nets
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
IEEE Transactions on Software Engineering
Model Checking of Time Petri Nets Using the State Class Timed Automaton
Discrete Event Dynamic Systems
CTL* model checking for time Petri nets
Theoretical Computer Science
A Tailored V-Model Exploiting the Theory of Preemptive Time Petri Nets
Ada-Europe '08 Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies
Towards Building the State Class Graph of the TSPN Model
Fundamenta Informaticae
Soundness for S- and A-timed workflow nets is undecidable
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Specification and simulation of real time concurrent systems using standard SDL tools
SDL'03 Proceedings of the 11th international conference on System design
A model-based approach for multiple QoS in scheduling: from models to implementation
Automated Software Engineering
A formal approach to design and verification of two-level hierarchical scheduling systems
Ada-Europe'11 Proceedings of the 16th Ada-Europe international conference on Reliable software technologies
A framework for simulation and symbolic state space analysis of non-markovian models
SAFECOMP'11 Proceedings of the 30th international conference on Computer safety, reliability, and security
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Transient analysis of non-Markovian models using stochastic state classes
Performance Evaluation
Towards Building the State Class Graph of the TSPN Model
Fundamenta Informaticae
Region-Based analysis of hybrid petri nets with a single general one-shot transition
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Non-markovian analysis for model driven engineering of real-time software
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
| Hi-index | 0.01 |
An enumerative technique is presented which supports reachability and timeliness analysis of time-dependent models. The technique assumes a dense model of time and uses equivalence classes to enable discrete and compact enumeration of the state space. Properties of timed reachability among states are recovered through the analysis of timing constraints embedded within equivalence classes. In particular, algorithms are given to evaluate a tight profile for the set of feasible timings of any untimed run. Runtime refinement of static profiles supports a mixed static/dynamic strategy in the development of a failure avoidance mechanism for dynamic acceptance and a guarantee of hard real-time processes.