Sciweavers

3229 search results - page 40 / 646
» The Theory of Timed Automata
Sort
View
ACSD
2006
IEEE
129views Hardware» more  ACSD 2006»
14 years 2 months ago
Extended Timed Automata and Time Petri Nets
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...
Patricia Bouyer, Pierre-Alain Reynier, Serge Hadda...
ICFEM
2004
Springer
14 years 2 months ago
Timed Patterns: TCOZ to Timed Automata
Abstract. The integrated logic-based modeling language, Timed Communicating Object Z (TCOZ), is well suited for presenting complete and coherent requirement models for complex real...
Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun 00...
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
14 years 14 days ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
ATVA
2008
Springer
102views Hardware» more  ATVA 2008»
13 years 10 months ago
Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions
The evaluation of successor or predecessor state spaces through time progress is a central component in the model-checking algorithm of dense-time automata. The definition of the t...
Farn Wang
TCS
2002
13 years 8 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo