Filters








180 Hits in 3.1 sec

Nested Timed Automata with Frozen Clocks [chapter]

Guoqiang Li, Mizuhito Ogawa, Shoji Yuen
2015 Lecture Notes in Computer Science  
A nested timed automaton (NeTA) is a pushdown system whose control locations and stack alphabet are timed automata (TAs).  ...  In NeTAs, all local clocks of TAs proceed uniformly also in the stack. This paper extends NeTAs with frozen local clocks (NeTA-Fs).  ...  Nested Timed Automata with Frozen Clocks Nested Timed Automata with Frozen Clocks Definition 12 extends Definition 5 in [4] with the choice that all clocks of an interrupted TA are either proceeding  ... 
doi:10.1007/978-3-319-22975-1_13 fatcat:vjxabbldqvecfeavxwd5zzqrf4

Environmental Simulation of Real-Time Systems with Nested Interrupts

Guoqiang Li, Shoji Yuen, Masakazu Adachi
2009 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering  
Together with an interrupt environment modeled as a timed automaton, and a scheduler as a timed automaton with semaphores, the system behaviors with nested interrupts are realized by a sequence of transitions  ...  with time.  ...  automaton and timed automata in the states; • κ is the set of clocks keeping frozen when the time elapses, named frozen clocks; • S is the stack. • Progress transitions: -(s, q, ν, κ, S) → C (s, q, (ν  ... 
doi:10.1109/tase.2009.12 dblp:conf/tase/LiYA09 fatcat:6gfojhhkvbf7roy2ycvowwjz6i

MODELING AND ANALYSIS OF REAL-TIME SYSTEMS WITH MUTEX COMPONENTS

GUOQIANG LI, XIAOJUAN CAI, SHOJI YUEN
2012 International Journal of Foundations of Computer Science  
Communicated by (xxxxxxxxxx) Timed automata are commonly recognized as a formal behavioral model for real-time systems.  ...  This paper proposes a behavioral model, named controller automata, to combine timed automata by focusing on the control passing between components.  ...  on real-time systems with nested interrupts.  ... 
doi:10.1142/s0129054112400382 fatcat:qhcvvcb7n5hgvj6tc2pdrvsuxq

Modeling and analysis of real -time systems with mutex components

Guoqiang Li, Xiaojuan Cai, Shoji Yuen
2010 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)  
Communicated by (xxxxxxxxxx) Timed automata are commonly recognized as a formal behavioral model for real-time systems.  ...  This paper proposes a behavioral model, named controller automata, to combine timed automata by focusing on the control passing between components.  ...  on real-time systems with nested interrupts.  ... 
doi:10.1109/ipdpsw.2010.5470825 dblp:conf/ipps/LiCY10 fatcat:dfnnkgg6nzecxmmz3x4wboxzdq

Emerald: An Automated Modeling and Verification Tool for Component-Based Real-Time Systems

Yizhou Zhang, Hao Lin, Guoqiang Li
2012 2012 12th International Conference on Quality Software  
Controller automata are a formal theory to model and analyze real-time systems with mutex components.  ...  or timed automata, say, UPPAAL.  ...  ∈S X(M (s))∪ {x run } in C; • κ is the set of clocks keeping frozen when the time elapses, named frozen clocks; • S is the stack. • Progress transitions: -(s, q, ν, κ, S) t − → C (s, q, (ν + t)[κ], κ,  ... 
doi:10.1109/qsic.2012.27 dblp:conf/qsic/ZhangLL12 fatcat:esdzm7bluvfqvmhtj6ybng2ntu

An Over-Approximation Forward Analysis for Nested Timed Automata [chapter]

Yunqing Wen, Guoqiang Li, Shoji Yuen
2015 Lecture Notes in Computer Science  
Nested timed automata(NeTAs), proposed by Li et al., are a pushdown system whose stack symbols are timed automata (TAs).  ...  With this formal models, we can model and analyze complex real-time frameworks with recursive context switches.  ...  Nested Timed Automata Definition 7 (Nested Timed automata).  ... 
doi:10.1007/978-3-319-17404-4_5 fatcat:vc7undjfcbe5xfzxhbmwuf3zyq

Updatable timed automata with one updatable clock

Guoqiang Li, Yunqing Wen, Shoji Yuen
2017 Science China Information Sciences  
Updatable timed automata (UTAs) proposed by Bouyer et.al., is an extension of timed automata (TAs) having the extra ability to update clocks in a more elaborate way than simply reset them to zero.  ...  We will show that (1) the reachability of general UTAs with one updatable clock (UTA1s) is still undecidable, and (2) that of UTA1s under diagonal-free constraints is decidable, and the complexity is Pspace-complete  ...  Nested timed automata (NeTAs) [11, 20, 30] extended TAs with recursive structure in a different way.  ... 
doi:10.1007/s11432-016-9027-y fatcat:yynkopatfvhxfiqain4iggxsry

Adding Dense-Timed Stack to Integer Reset Timed Automata [chapter]

Devendra Bhave, Shibashis Guha
2017 Lecture Notes in Computer Science  
We propose dtIRVPA as a class of timed automata with a dense-timed stack.  ...  Integer reset timed automata (IRTA) are known to be a determinizable subclass of timed automata, but it is not known whether they are input-determined, i.e., the clock values are completely determined  ...  Another noteworthy contribution is nested timed automata (NeTA) proposed by Li et al. [16] . In their model, an instance of timed automata can be pushed on the stack along with the clocks.  ... 
doi:10.1007/978-3-319-67089-8_2 fatcat:rj2b3wr37zf7rdjfsw5secr5ha

Timed Automata Semantics for Analyzing Creol

Mohammad Mahdi Jaghoori, Tom Chothia
2010 Electronic Proceedings in Theoretical Computer Science  
We give a real-time semantics for the concurrent, object-oriented modeling language Creol, by mapping Creol processes to a network of timed automata.  ...  Real-time Creol can be useful for analyzing, for instance, abstract models of multi-core embedded systems. We show how analysis can be done in Uppaal.  ...  In a network of timed automata, the enabled transitions from an urgent location may be interleaved with the enabled transitions from other automata (while time is frozen).  ... 
doi:10.4204/eptcs.30.8 fatcat:6jjybncq5fb75hbou4angpasi4

Semantics and pragmatics of Real-Time Maude

Peter Csaba Ölveczky, José Meseguer
2007 Higher-Order and Symbolic Computation  
Real-Time Maude emphasizes ease and generality of specification, including support for distributed real-time object-based systems.  ...  temporal logic propertiesare in general incomplete (although they are complete for discrete time).  ...  This system, with its uninitialized "stopwatch," cannot be expressed by timed automata or by decidable classes of hybrid automata [16] .  ... 
doi:10.1007/s10990-007-9001-5 fatcat:mbjmvpx5hjgdvkuxs2rjjhjxei

LUSTRE: a declarative language for real-time programming

P. Caspi, D. Pilaud, N. Halbwachs, J. A. Plaice
1987 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87  
LUSTRE is a synchronous data-flow language for programming syetema which interact. with their environments in real-time.  ...  , which is equal to the internal time when the stopwatch is not in lap mode, and which is frozen when the lap mode is entered.  ...  LUSTRE must be compared with asynchronous languages with real-time capabilities, such as ADA.  ... 
doi:10.1145/41625.41641 dblp:conf/popl/CaspiPHP87 fatcat:mpvcuemfizh5xbkv4sejspalha

Time as it could be measured in artificial living systems

Andrei D. Robu, Christoph Salge, Chrystopher L. Nehaniv, Daniel Polani
2017 Proceedings of the 14th European Conference on Artificial Life ECAL 2017  
Thus, clocks are ubiquitous in biology. In the present paper, we consider the most minimal abstract pure clocks and investigate their characteristics with respect to their ability to measure time.  ...  We include also cascades of independent clocks ("clock bags") and composite clocks with controlled dependency; the latter show various regimes of markedly different dynamics.  ...  Drop Clock Consider the thought experiment of an insect that leaves its nest to forage or explore.  ... 
doi:10.7551/ecal_a_061 dblp:conf/ecal/RobuSNP17 fatcat:u3enqvmtkfeebdr6uginbzv424

Time as it could Be measured in Artificial Living Systems [article]

Andrei D. Robu, Christoph Salge, Chrystopher L. Nehaniv, Daniel Polani
2017 arXiv   pre-print
Thus, clocks are ubiquitous in biology. In the present paper, we consider the most minimal abstract pure clocks and investigate their characteristics with respect to their ability to measure time.  ...  We include also cascades of independent clocks ("clock bags") and composite clocks with controlled dependency; the latter show various regimes of markedly different dynamics.  ...  Drop Clock Consider the thought experiment of an insect that leaves its nest to forage or explore.  ... 
arXiv:1706.07091v1 fatcat:igagh6gqyjaydk3ddjbh5xrlj4

The synchronous languages 12 years later

A. Benveniste, P. Caspi, S.A. Edwards, N. Halbwachs, P. Le Guernic, R. de Simone
2003 Proceedings of the IEEE  
This paper discusses the improvements, difficulties, and successes that have occured with the synchronous languages since then.  ...  Today, synchronous languages have been established as a technology of choice for modeling, specifying, validating, and implementing real-time embedded applications.  ...  This inefficiency can produce code 100 times slower than that from an automata-based compiler [52] .  ... 
doi:10.1109/jproc.2002.805826 fatcat:pdjbogxbovgvnc27ijgbch47aa

Real-Time Maude 2.1

Peter Csaba Ölveczky, José Meseguer
2005 Electronical Notes in Theoretical Computer Science  
Real-Time Maude 2.1 is an extension of Full Maude 2.1 supporting the formal specification and analysis of real-time and hybrid systems.  ...  (∀X ) t −→ t can be obtained by means of the inference rules of reflexivity, transitivity, congruence, and nested replacement given in [3] .  ...  The com-mand (tsearch [1] {clock(0)} =>* {clock(X:Time)} such that X:Time > 24 in time <= 99 .) checks whether some state {clock(r )}, with r > 24, can be reached from state {clock(0)} in time less than  ... 
doi:10.1016/j.entcs.2004.06.015 fatcat:j267et2gtnhkhf7s77auw2hoaa
« Previous Showing results 1 — 15 out of 180 results