Representing and modeling digital circuits
Representing and modeling digital circuits
Diagnostic model-checking for real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Experience with Literate Programming in the Modelling and Validation of Systems
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Error Detection with Directed Symbolic Model Checking
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
HYTECH: A Model Checker for Hybrid Systems
CAV '97 Proceedings of the 9th International Conference 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
UPPAAL - Now, Next, and Future
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Preemptive Job-Shop Scheduling Using Stopwatch Automata
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verification of Timed Automata via Satisfiability Checking
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Job-Shop Scheduling Using Timed Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Towards formal specification and analysis of avionics mission systems
CRPIT '02 Proceedings of the conference on Application and theory of petri nets: formal methods in software engineering and defence systems - Volume 12
A Test Case Generation Algorithm for Real-Time Systems
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
Optimal scheduling using priced timed automata
ACM SIGMETRICS Performance Evaluation Review
Solving scheduling problems by untimed model checking: the clinical chemical analyser case study
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Memory arbiter synthesis and verification for a radar memory interface card
Nordic Journal of Computing
Using heuristic search for finding deadlocks in concurrent systems
Information and Computation
Scheduling with timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
On using priced timed automata to achieve optimal scheduling
Formal Methods in System Design
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
Scheduling for multi-threaded real-time programs via path planning
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
DELFIN+: An efficient deadlock detection tool for CCS processes
Journal of Computer and System Sciences
Optimal infinite scheduling for multi-priced timed automata
Formal Methods in System Design
Distributed Extended Beam Search for Quantitative Model Checking
Model Checking and Artificial Intelligence
Test Plan Generation for Concurrent Real-Time Systems Based on Zone Coverage Analysis
TestCom '08 / FATES '08 Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop
Scheduling optimisations for SPIN to minimise buffer requirements in synchronous data flow
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Survey on Directed Model Checking
Model Checking and Artificial Intelligence
On the Supports of Recognizable Timed Series
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Liveness Checking as Safety Checking for Infinite State Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Using heuristic search for finding deadlocks in concurrent systems
Information and Computation
On optimal scheduling under uncertainty
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Optimal scheduling using branch and bound with SPIN 4.0
SPIN'03 Proceedings of the 10th international conference on Model checking software
SPIN'03 Proceedings of the 10th international conference on Model checking software
Testing real-time systems using UPPAAL
Formal methods and testing
Developing UPPAAL over 15 years
Software—Practice & Experience
Quantitative analysis of real-time systems using priced timed automata
Communications of the ACM
Beyond liveness: efficient parameter synthesis for time bounded liveness
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Priced timed automata: algorithms and applications
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Directed model checking with distance-preserving abstractions
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Adapting an AI planning heuristic for directed model checking
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Hi-index | 0.02 |
In this paper we present an algorithm for efficiently computing the minimum cost of reaching a goal state in the model of Uniformly Priced Timed Automata (UPTA). This model can be seen as a submodel of the recently suggested model of linearly priced timed automata, which extends timed automata with prices on both locations and transitions. The presented algorithm is based on a symbolic semantics of UTPA, and an efficient representation and operations based on difference bound matrices. In analogy with Dijkstra's shortest path algorithm, we show that the search order of the algorithm can be chosen such that the number of symbolic states explored by the algorithm is optimal, in the sense that the number of explored states can not be reduced by any other search order. We also present a number of techniques inspired by branch-and-bound algorithms which can be used for limiting the search space and for quickly finding near-optimal solutions.The algorithm has been implemented in the verification tool UPPAAL. When applied on a number of experiments the presented techniques reduced the explored state-space with up to 90%.