Communicating sequential processes
Communicating sequential processes
Theoretical Computer Science
The Object-Z specification language
The Object-Z specification language
Decidability and Undecidability Results for Duration Calculus
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Constructing Test Automata from Graphical Real-Time Requirements
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
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
From Duration Calculus To Linear Hybrid Automata
Proceedings of the 7th International Conference on Computer Aided Verification
CSP-OZ-DC: a combination of specification techniques for processes, data and time
Nordic Journal of Computing
The power of reachability testing for timed automata
Theoretical Computer Science
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model-checking dense-time Duration Calculus
Formal Aspects of Computing
From StoCharts to MoDeST: a comparative reliability analysis of train radio communications
Proceedings of the 5th international workshop on Software and performance
Towards modeling and evaluation of ETCS real-time communication and operation
Journal of Systems and Software - Special issue: Parallel and distributed real-time systems
Model-checking of specifications integrating processes, data and time
FM'05 Proceedings of the 2005 international conference on Formal Methods
Modal strength reduction in quantified discrete duration calculus
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic Verification of Combined Specifications: An Overview
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of Linear Duration Invariants by Model Checking CTL Properties
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
ACM Computing Surveys (CSUR)
Constraint solving for interpolation
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Slicing concurrent real-time system specifications for verification
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Verifying CSP-OZ-DC specifications with complex data types and timing parameters
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Formal methods and hybrid real-time systems
Constraint solving for interpolation
Journal of Symbolic Computation
Model checking linear duration invariants of networks of automata
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |
Model checking of real-time systems with respect to Duration Calculus (DC) specifications requires the translation of DC formulae into automata-based semantics. This task is difficult to automate. The existing algorithms provide a limited DC coverage and do not support compositional verification. We propose a translation algorithm that advances the applicability of model checking tools to real world applications. Our algorithm significantly extends the subset of DC that can be handled. It decomposes DC specifications into sub-properties that can be verified independently. The decomposition bases on a novel distributive law for DC. We implemented the algorithm as part of our tool chain for the automated verification of systems comprising data, communication, and real-time aspects. Our translation facilitated a successful application of the tool chain on an industrial case study from the European Train Control System (ETCS).