Filters








1,403 Hits in 7.1 sec

Decomposing Verification of Timed I/O Automata [chapter]

Dilsun Kırlı Kaynar, Nancy Lynch
2004 Lecture Notes in Computer Science  
These results are useful for decomposing verification of systems where the implementation and the specification are represented as timed I/O automata.  ...  This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework.  ...  Timed I/O Automata Definition Formally, a timed I/O automaton (TIOA) consists of: -A set X of internal variables. -A set Q ⊆ val (X) of states. -A nonempty set Θ ⊆ Q of start states.  ... 
doi:10.1007/978-3-540-30206-3_8 fatcat:meirfnq2ezbprdpivtulofzniq

Hybrid I/O automata

Nancy Lynch, Roberto Segala, Frits Vaandrager
2003 Information and Computation  
Timed I/O automata add explicit time-passage steps, which allow time to pass in discrete jumps.  ...  Basic I/O automata consist essentially of states, start states, and discrete transitions.  ...  have helped us greatly in completing the development of the model.  ... 
doi:10.1016/s0890-5401(03)00067-1 fatcat:7nibo6ry6vebpkkp3w52p5aukq

Task-structured probabilistic I/O automata

Ran Canetti, Ling Cheung, Dilsun Kaynar, Moses Liskov, Nancy Lynch, Olivier Pereira, Roberto Segala
2018 Journal of computer and system sciences (Print)  
Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit both probabilistic and nondeterministic choices.  ...  We illustrate the potential of the task-PIOA framework by outlining its use in verifying an Oblivious Transfer protocol. * This report presents an extension of the task-PIOA theory first introduced in  ...  We thank Silvio Micali for impressing upon us the importance of adaptive adversarial schedulers in the cryptographic setting.  ... 
doi:10.1016/j.jcss.2017.09.007 fatcat:45hz27ezovbhpaez4e5hkfc4zm

The Theory of Timed I/O Automata

Dilsun K. Kaynar, Nancy Lynch, Roberto Segala, Frits Vaandrager
2006 Synthesis Lectures on Computer Science  
In particular, the framework includes a notion of external behavior for a timed I/O automaton, which captures its discrete interactions with its environment.  ...  An important feature of this model is its support for decomposing timed system descriptions.  ...  of I/O feasible automata.  ... 
doi:10.2200/s00006ed1v01y200508csl001 fatcat:g4kijt2xtrfsri5sezmxxppl6m

Proving Approximate Implementations for Probabilistic I/O Automata

Sayan Mitra, Nancy Lynch
2007 Electronical Notes in Theoretical Computer Science  
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships.  ...  We discuss applications of approximate implementations to verification of probabilistic safety and termination.  ...  The set A := IO∪H is called the set of actions of A. If I = Ø, then A is closed. The set of external actions of A is E := IO and the set of locally controlled actions is L := O ∪ H.  ... 
doi:10.1016/j.entcs.2006.11.040 fatcat:lsl4yjyde5hk7ez6mq5qyaj3o4

Methodologies for Specification of Real-Time Systems Using Timed I/O Automata [chapter]

Alexandre David, Kim G. Larsen, Axel Legay, Ulrik Nyman, Andrzej Wąsowski
2010 Lecture Notes in Computer Science  
We present a real-time specification framework based on Timed I/O Automata and a comprehensive tool support for it.  ...  Additionally, our tool allows combining the component-oriented design process with verification of temporal logic properties increasing the flexibility of the process.  ...  In our framework we use Timed I/O Automata as a syntactic domain in which specifications and implementations are represented. Definition 2.  ... 
doi:10.1007/978-3-642-17071-3_15 fatcat:nyxkshi5nfhfxgdzcfx5euecvu

I/O Efficient Directed Model Checking [chapter]

Shahid Jabbar, Stefan Edelkamp
2005 Lecture Notes in Computer Science  
This problem can be circumvented by the use of secondary storage devices to store the state space.  ...  In the theoretical part of the paper, we extend the heuristic-based external searching algorithm to general weighted and directed graphs.  ...  Thousands thanks to Alberto Lluch-Lafuente at University of Pisa for many detailed discussions on his implementation of HSF-SPIN and its possible extension.  ... 
doi:10.1007/978-3-540-30579-8_21 fatcat:jeb3zphgn5cndlzy3vqkjbhyli

Timed Automata Patterns

Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, Wang Yi
2008 IEEE Transactions on Software Engineering  
Abstract-Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variables.  ...  A number of automated analyzers for Timed Automata have been developed. However, Timed Automata lack composable patterns for high-level system design.  ...  This research is partially supported by the research grant R-252-000-201-112 funded by National University of Singapore. Jun Sun is the corresponding author for this paper.  ... 
doi:10.1109/tse.2008.52 fatcat:snutny5k45ebfexanzrvokqaqm

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.  ...  In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time.  ...  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

From MITL to Timed Automata [chapter]

Oded Maler, Dejan Nickovic, Amir Pnueli
2006 Lecture Notes in Computer Science  
We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models.  ...  Acknowledgment We thank anonymous referees of several conferences for their remarks and suggestions.  ...  Definition 3 (I/O Composition).  ... 
doi:10.1007/11867340_20 fatcat:ao23ugrf6vbubg5v3wgmldqdxq

Stochastic Timed Automata

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Groesser, Marcin Jurdzinski, Prakash Panangaden
2014 Logical Methods in Computer Science  
Techniques employed in this article gather tools from real-time verification and probabilistic verification, as well as topological games played on timed automata.  ...  In this paper, we identify several classes of automata and of properties for which this can be decided.  ...  Quentin Menet was supported by a grant of FRIA.  ... 
doi:10.2168/lmcs-10(4:6)2014 fatcat:ddh7nveslvburdfhp7ldfuzkzm

Stochastic Timed Automata [chapter]

2008 Stochastic Discrete Event Systems  
Techniques employed in this article gather tools from real-time verification and probabilistic verification, as well as topological games played on timed automata. 2012 ACM CCS: [Theory of computation]  ...  Correctness of the abstraction holds when automata are almost-surely fair, which we show, is the case for two large classes of systems, singleclock automata and so-called weak-reactive automata.  ...  Quentin Menet was supported by a grant of FRIA.  ... 
doi:10.1007/978-3-540-74173-2_3 fatcat:nnec5crjqfa4baab6kbmuj5j34

Timed Pushdown Automata Revisited

Lorenzo Clemente, Slawomir Lasota
2015 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science  
This paper contains two results on timed extensions of pushdown automata (PDA).  ...  As our first result we prove that the model of dense-timed PDA of Abdulla et al. collapses: it is expressively equivalent to dense-timed PDA with timeless stack.  ...  Timed automata [1] are a popular model of time-dependent behavior.  ... 
doi:10.1109/lics.2015.73 dblp:conf/lics/ClementeL15 fatcat:ouvyt74aefaopf2cv2t2gzan74

Timed pushdown automata revisited [article]

Lorenzo Clemente, Sławomir Lasota
2015 arXiv   pre-print
This paper contains two results on timed extensions of pushdown automata (PDA).  ...  As our first result we prove that the model of dense-timed PDA of Abdulla et al. collapses: it is expressively equivalent to dense-timed PDA with timeless stack.  ...  Timed automata [1] are a popular model of time-dependent behavior.  ... 
arXiv:1503.02422v2 fatcat:bb4ty4pbobfx3auogilc5rlevy

Specification of Embedded Control Systems Behaviour Using Actor Interface Automata [chapter]

Christo Angelov, Feng Zhou, Krzysztof Sierszecki
2010 Lecture Notes in Computer Science  
Input and output signals are exchanged with the controlled plant at precisely specified time instants, which provides for a constant delay from sampling to actuation and the elimination of I/O jitter.  ...  Distributed Timed Multitasking (DTM) is a model of computation describing the operation of hard real-time embedded control systems.  ...  It has also implications for system verification, since interface automata are essentially timed automata that can be used as analysis models for verification tools like e.g., Uppaal or simulation environments  ... 
doi:10.1007/978-3-642-16256-5_17 fatcat:itrr2hzrizgv3lgeiqhux6eic4
« Previous Showing results 1 — 15 out of 1,403 results