32 search results - page 1 / 7 » Diagonal Constraints in Timed Automata: Forward Analysis of ... |
115
Voted
FORMATS
2005
Springer
15 years 9 months ago
2005
Springer
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability...
129
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locat...
126
Voted
ACSD
2006
IEEE
15 years 9 months ago
2006
IEEE
Timed Automata (TA) and Time Petri Nets (TPN) are two well-established formal models for real-time systems. Recently, a linear transformation of TA to TPNs preserving reachability...
132
Voted
RTSS
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...
120
Voted
FSEN
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...