Timed Automata Relaxation for Reachability

AbstractTimed automata (TA) have shown to be a suitable formalism for modeling real-time systems. Moreover, modern model-checking tools allow a designer to check whether a TA complies with the system specification. However, the exact timing constraints of the system are often uncertain during the design phase. Consequently, the designer is able to build a TA with a correct structure, however, the timing constraints need to be tuned to make the TA comply with the specification.In this work, we assume that we are given a TA together with an existential property, such as reachability, that is not satisfied by the TA. We propose a novel concept of a minimal sufficient reduction (MSR) that allows us to identify the minimal set S of timing constraints of the TA that needs to be tuned to meet the specification. Moreover, we employ mixed-integer linear programming to actually find a tuning of S that leads to meeting the specification.

Download Full-text

Time Petri Nets with Action Duration

International Journal of Embedded and Real-Time Communication Systems ◽

10.4018/jertcs.2013040104 ◽

2013 ◽

Vol 4 (2) ◽

pp. 62-83 ◽

Cited By ~ 9

Author(s):

N. Belala ◽

D.E. Saїdouni ◽

R. Boukharrou ◽

A.C. Chaouche ◽

A. Seraoui ◽

...

Keyword(s):

Petri Nets ◽

Real Time ◽

Timed Automata ◽

Operational Semantics ◽

Time Interval ◽

Timing Constraints ◽

Time Petri Nets ◽

Real Time Systems ◽

High Level ◽

Time Systems

The design of real-time systems needs a high-level specification model supporting at the same time timing constraints and actions duration. The authors introduce in this paper an extension of Petri Nets called Time Petri Nets with Action Duration (DTPN) where time is associated with transitions. In DTPN, the firing of transitions is bound to a time interval and transitions represent actions which have explicit durations. The authors give an operational semantics for DTPN in terms of Durational Action Timed Automata (DATA). DTPN considers both timing constraints and durations under a true-concurrency semantics with an aim of better expressing concurrent and parallel behaviours of real-time systems.

Download Full-text

UAV Task Assignment with Timing Constraints via Mixed-Integer Linear Programming

AIAA 3rd "Unmanned Unlimited" Technical Conference, Workshop and Exhibit ◽

10.2514/6.2004-6410 ◽

2004 ◽

Cited By ~ 27

Author(s):

Corey Schumacher ◽

Phillip Chandler ◽

Meir Pachter ◽

Lior Pachter

Keyword(s):

Linear Programming ◽

Integer Linear Programming ◽

Mixed Integer Linear Programming ◽

Task Assignment ◽

Mixed Integer ◽

Timing Constraints

Download Full-text

IMITATOR 3: Synthesis of Timing Parameters Beyond Decidability

Computer Aided Verification - Lecture Notes in Computer Science ◽

10.1007/978-3-030-81685-8_26 ◽

2021 ◽

pp. 552-565

Author(s):

Étienne André

Keyword(s):

Model Checking ◽

Real Time ◽

Timed Automata ◽

Robustness Analysis ◽

Parametric Model ◽

Timing Constraints ◽

Real Time Systems ◽

Model Checker ◽

Time Systems ◽

Timed Model Checking

AbstractReal-time systems are notoriously hard to verify due to nondeterminism, concurrency and timing constraints. When timing constants are uncertain (in early the design phase, or due to slight variations of the timing bounds), timed model checking techniques may not be satisfactory. In contrast, parametric timed model checking synthesizes timing values ensuring correctness. takes as input an extension of parametric timed automata (PTAs), a powerful formalism to formally verify critical real-time systems. extends PTAs with multi-rate clocks, global rational-valued variables and a set of additional useful features. We describe here the new features and algorithms offered by 3, that moved along the years from a simple prototype dedicated to robustness analysis to a standalone parametric model checker for timed systems.

Download Full-text

Optimization for Stop Plan of Passenger-Like Container Train with Container Distributions and Train Utilization Rates

Mathematical Problems in Engineering ◽

10.1155/2019/6736495 ◽

2019 ◽

Vol 2019 ◽

pp. 1-12 ◽

Cited By ~ 1

Author(s):

Yang Xia ◽

Yuguang Wei ◽

Yihuan Lai ◽

Qi Zhang

Keyword(s):

Mixed Integer Linear Programming ◽

Numerical Experiments ◽

Optimal Operation ◽

Mixed Integer ◽

Utilization Rate ◽

Container Transportation ◽

Accumulation Time ◽

Railway Line ◽

Proposed Model ◽

Novel Concept

The railway container transportation is attracting more and more attention in China. In order to improve the service quality, a novel concept of passenger-like container train is proposed, which can reduce the accumulation time of containers at the origin station and increase the train frequency compared with the traditional container through train. With the aim of generating optimal operation strategies for passenger-like container trains, this paper establishes an optimization model for the train stop plan problem, in which the objective is to minimize the total number of stops. In addition, the specific container-to-train distribution and the utilization rate of each individual train are considered. The proposed model is a mixed-integer linear programming one, which can be solved by using the CPLEX solver. Finally, the numerical experiments are performed to test the effectiveness of our model by using a simple railway line and the China Railway Express corridor as examples. The results prove the advantages of our method.

Download Full-text