Results 31 to 40 of about 4,872 (300)
Information and Computation, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ocan Sankur +2 more
openaire +5 more sources
Simulations for Event-Clock Automata [PDF]
Logical Methods in Computer ScienceEvent-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and are practically useful to capture timed specifications.
S Akshay +3 more
doaj +1 more source
Verification for Timed Automata extended with Unbounded Discrete Data Structures [PDF]
Logical Methods in Computer Science, 2015 We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack.
Karin Quaas
doaj +1 more source
Automated Predicate Abstraction for Real-Time Models [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 We present a technique designed to automatically compute predicate abstractions for dense real-timed models represented as networks of timed automata. We use the CIPM algorithm in our previous work which computes new invariants for timed automata control
Bahareh Badban +2 more
doaj +1 more source
Relating timed and register automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Timed automata and register automata are well-known models of computation over timed and data words respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can store data ...
Diego Figueira +2 more
doaj +1 more source
Decomposition of Timed Automata
J. Univers. Comput. Sci., 1999 JUCS - Journal of Universal Computer Science Volume Nr.
Mason,Kahn, Krishnan,Padmanabhan
openaire +3 more sources
Weak Alternating Timed Automata [PDF]
Logical Methods in Computer Science, 2012 Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable.
Pawel Parys, Igor Walukiewicz
doaj +1 more source
Timed Automata Robustness Analysis via Model Checking [PDF]
Logical Methods in Computer Science, 2022 Timed automata (TA) have been widely adopted as a suitable formalism to model time-critical systems. Furthermore, contemporary model-checking tools allow the designer to check whether a TA complies with a system specification.
Jaroslav Bendík +3 more
doaj +1 more source
Theoretical Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jan Springintveld +2 more
openaire +3 more sources
Efficient Detection of Zeno Runs in Timed Automata [PDF]
, 2007 Zeno runs, where infinitely many actions occur in finite time, may inadvertently arise in timed automata specifications. Zeno runs may compromise the reliability of formal verification, and few model-checkers provide the means to deal with them: this ...
Gomez, Rodolfo, Bowman, Howard
core +1 more source