Filters








1,264 Hits in 5.0 sec

On Timed Automata with Discrete Time – Structural and Language Theoretical Characterization [chapter]

Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara König
2005 Lecture Notes in Computer Science  
We develop a structural and language theoretical characterization of timed languages over discrete time in terms of a variant of Büchi automata and languages.  ...  The characterizations hold alike for timed automata with and without periodic clock constraints.  ...  Both these extensions are equally powerful and strictly increase the expressive power of timed automata, regardless of the used time semantics, i.e., the interpretation of the clocks, which assigns some  ... 
doi:10.1007/11505877_24 fatcat:gkyttxrnbnfezlrvyqhzorrepm

Nested Weighted Automata

Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2015 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science  
Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification.  ...  time cannot be expressed using weighted automata, nor in any other know decidable formalism.  ...  Conclusion and Future Work Motivated by important system properties such as long-run average response time, we introduced the framework of nested weighted automata as a new, expressive, and convenient  ... 
doi:10.1109/lics.2015.72 dblp:conf/lics/ChatterjeeHO15 fatcat:akcto2c2dndkpphnjd5cc55ugq

Page 8885 of Mathematical Reviews Vol. , Issue 2000m [page]

2000 Mathematical Reviews  
of the expressive power of silent transitions in timed automata.  ...  It turns out that such transitions increase the computational power of timed automata; on the other hand, all interesting properties like closure under union and intersection and decidability of the emptiness  ... 

Nested Weighted Automata [article]

Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
2015 arXiv   pre-print
Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification.  ...  time cannot be expressed using weighted automata, nor in any other know decidable formalism.  ...  To achieve synchronization of silent transitions, we modify slave automata so that during silent transitions of the master automaton, slave automata accumulate their values in their states, while taking  ... 
arXiv:1504.06117v1 fatcat:g5zy7ztnsffzvi5xr7vovjv5me

The Impressive Power of Stopwatches [chapter]

Franck Cassez, Kim Larsen
2000 Lecture Notes in Computer Science  
In particular, we investigate the expressive power of this class of automata, and show as a main result that any finite or infinite timed language accepted by a linear hybrid automaton is also acceptable  ...  The consequences of this result are two-fold: firstly, it shows that the seemingly minor upgrade from timed automata to stopwatch automata immediately yields the full expressive power of linear hybrid  ...  Acknowledgement The authors would like to thank Gerd Behrmann, Johan Bengtsson and Paul Pettersson for numerous discussions and assistance in making the stopwatchextension of UPPAAL.  ... 
doi:10.1007/3-540-44618-4_12 fatcat:phpkxtmhf5gfldcsqzoui7fxbe

8 Test Derivation from Timed Automata [chapter]

Laura Brandán Briones, Mathias Röhl
2005 Lecture Notes in Computer Science  
the testing of deterministic timed automata with silent transitions.  ...  Henzinger et al. showed that the digitization of clocks allows to distinguish all systems which are distinguishable in the dense time domain if the system can be modeled as a timed transition system [HMP92  ...  Whereas silent transition do not increase the expressiveness of untimed automata they strictly increase the power of timed automata.  ... 
doi:10.1007/11498490_10 fatcat:lr6ysy24vjef5k2x7e3ctfjj74

Updatable timed automata*1

P BOUYER
2004 Theoretical Computer Science  
We thus describe in a quite precise way the thin frontier between decidable and undecidable classes of updatable timed automata. We also study the expressive power of updatable timed automata.  ...  We call these automata updatable timed automata. They form an undecidable class of models, in the sense that emptiness checking is not decidable.  ...  Acknowledgements We would like to thank BÃ eatrice BÃ erard for her careful reading of the paper and her comments.  ... 
doi:10.1016/s0304-3975(04)00265-8 fatcat:sl5dnynorjhsphnzfbhrliipz4

Scaling behavior in probabilistic neuronal cellular automata

Kaustubh Manchanda, Avinash Chand Yadav, Ramakrishna Ramaswamy
2013 Physical Review E  
At the critical point, we find that the scaling exponents for the variables are in good agreement with a mean--field theory.  ...  We study a neural network model of interacting stochastic discrete two--state cellular automata on a regular lattice.  ...  Our presentation, and indeed the work itself, has benefited greatly from the comments of anonymous referees.  ... 
doi:10.1103/physreve.87.012704 pmid:23410356 fatcat:kgmsjpyjizayhkpq2dw4wanwcm

Updatable timed automata

Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit
2004 Theoretical Computer Science  
We thus describe in a quite precise way the thin frontier between decidable and undecidable classes of updatable timed automata. We also study the expressive power of updatable timed automata.  ...  We call these automata updatable timed automata. They form an undecidable class of models, in the sense that emptiness checking is not decidable.  ...  Acknowledgements: We would like to thank Béatrice Bérard for her careful reading of the paper and her comments.  ... 
doi:10.1016/j.tcs.2004.04.003 fatcat:syttd25azvhgbl6kp3ihvpi73i

Model Checking Real-Time Systems [chapter]

Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Joël Ouaknine, James Worrell
2018 Handbook of Model Checking  
We begin with introducing the model, as an extension of finite-state automata with real-valued variables for measuring time.  ...  We then present the main model-checking results in this framework, and give a hint about some recent extensions (namely weighted timed automata and timed games).  ...  Acknowledgement We thank the reviewers for their numerous comments, remarks and additional references, which greatly helped us improve this chapter.  ... 
doi:10.1007/978-3-319-10575-8_29 fatcat:thsp3udcpnfyjpjzn6i2slbplm

Removing All Silent Transitions from Timed Automata [chapter]

Cătălin Dima, Ruggero Lanotte
2009 Lecture Notes in Computer Science  
This utilizes a representation of the reachability relation in timed automata in a generalization of Difference Logic with periodic constraints.  ...  We also show that periodic updates are necessary for the removal of ε-transitions.  ...  In this paper we are interested in closing a gap in the theory of timed automata, namely the possibility remove ε-transitions (a.k.a. silent transitions).  ... 
doi:10.1007/978-3-642-04368-0_11 fatcat:bntasqw6ibbsbgbo6jdgjwxp6m

Labeled Generalized Stochastic Petri Net Based Approach for Web Services Composition

Sofiane Chemaa, Mouna Bouarioua, Allaoua chaoui
2013 International Journal of Computer Science & Information Technology (IJCSIT)  
In this context, we propose an expressive Labeled generalized stochastic Petri net based algebra that succeeds in the complex Web services composition.  ...  with the Web Services standards.  ...  In this work, we have modeled a silent transition ( ) by an immediate transition with ( ) = | ∈ ℕ * and ( ) = | ∈ ℝ .  ... 
doi:10.5121/ijcsit.2013.5312 fatcat:7a74nqzsqbdzzp3qmuq6pjsyme

Page 7105 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
In turn, necessary and sufficient combinatorial conditions are established, expressed in terms of transfer parameters, which precisely characterize many important and well-studied classes of balancing  ...  Section 3 inves- tigates a relationship between the accepting powers of alternating multi-counter automata with and without | inkdot.  ... 

Compositional timing analysis

Ramzi Ben Salah, Marius Dorel Bozga, Oded Maler
2009 Proceedings of the seventh ACM international conference on Embedded software - EMSOFT '09  
Using this technique we can analyze timed system of size beyond the capabilities of contemporary analysis tools for timed automata.  ...  We develop and implement a methodology for automatic abstraction of systems defined as networks of timed components modeled by timed automata.  ...  which is much stronger in expressive power but is notorious for not scaling up beyond toy problems. 3 It is this clock-explosion challenge that we try to meet in this work.  ... 
doi:10.1145/1629335.1629342 dblp:conf/emsoft/SalahBM09 fatcat:p4fhjkvv6nakdo577jx4py4xrq

Polychronous Automata

Paul Le Guernic, Thierry Gautier, Jean-Pierre Talpin, Loic Besnard
2015 2015 International Symposium on Theoretical Aspects of Software Engineering  
This paper investigates the way state diagrams can be best represented in the polychronous model of computation.  ...  We propose a model of finite-state automata, called polychronous automata, which is based on clock relations. A specificity of this model is that an automaton is submitted to clock constraints.  ...  The input-free equation x := x $ init 0 is a typical example of not timely deterministic process: x holds a sequence of constant value 0 separated by an undetermined number of silent transitions, characterized  ... 
doi:10.1109/tase.2015.21 dblp:conf/tase/GuernicGTB15 fatcat:p2vvncvo4fdlvnk5dk2rmqnkje
« Previous Showing results 1 — 15 out of 1,264 results