14,388 Hits in 3.5 sec

Characteristic Formulae for Timed Automata

Luca Aceto, Anna Ingólfsdóttir, Mikkel Lykke Pedersen, Jan Poulsen
2000 RAIRO - Theoretical Informatics and Applications  
This paper offers characteristic formula constructions in the realtime logic L ν for several behavioural relations between (states of) timed automata.  ...  This also applies to the characteristic formula for timed bisimulation equivalence, for which an exponential space construction was previously offered by Laroussinie, Larsen and Weise.  ...  Laroussine, Larsen and Weise [19] have proposed a characteristic formula construction for timed automata up to timed bisimilarity.  ... 
doi:10.1051/ita:2000131 fatcat:ld3hgzf3hjdcpl5zwrpbv4eplq

From Timed Automata to Logic - and Back

Francois Laroussinie, Kim G. Larsen, Carsten Weise
1995 BRICS Report Series  
In particular, a timed logic L is put forward, which is sufficiently expressive that we for any timed automaton may construct a single characteristic L formula uniquely characterizing the automaton up  ...  For finite automata there exist since long extremely<br />efficient model-checking algorithms, and in the last few years these algorithms have been made applicable to the verification of real-time automata  ...  For timed automata the characteristic formula construction must necessarily take account of the time assignment in addition to the actual node.  ... 
doi:10.7146/brics.v2i2.19504 fatcat:bxkf7vizqbhtncwsirmre3afr4

From timed automata to logic — and back [chapter]

François Laroussinie, Kim G. Larsen, Carsten Weise
1995 Lecture Notes in Computer Science  
In particular, a timed logic L ν is put forward, which is sufficiently expressive that we for any timed automaton may construct a single characteristic L ν formula uniquely characterizing the automaton  ...  For finite automata there exist since long extremely efficient model-checking algorithms, and in the last few years these algorithms have been made applicable to the verification of real-time automata  ...  For timed automata the characteristic formula construction must necessarily take account of the time assignment in addition to the actual node.  ... 
doi:10.1007/3-540-60246-1_158 fatcat:nll34xdcdzdcvo2pzkeciija2a

Characteristic Formulae: From Automata to Logic

Luca Aceto, Anna Ingólfsdóttir
2007 BRICS Report Series  
Moreover, characteristic formulae for timed automata with respect to timed bisimilarity and the faster-than preorder of Moller and Tofts are offered in terms of the logic L_nu of Laroussinie, Larsen and  ...  This paper discusses the classic notion of characteristic formulae for processes using variations on Hennessy-Milner logic as the underlying logical specification language.  ...  In the setting of modelling and verification for real-time systems, a characteristic formula construction for timed bisimulation equivalence over timed automata [4] has been offered in [29] .  ... 
doi:10.7146/brics.v14i2.21925 fatcat:vqjt3zcvqrf6noxi4s7axtfbqa

Model Checking via Reachability Testing for Timed Automata

Luca Aceto, Augusto Burgueno, Kim G. Larsen
1997 BRICS Report Series  
In this paper we develop an approach to model-checking for timed automata via reachability testing. As our specification formalism, we consider a dense-time logic with clocks.  ...  of deterministic, tau-free timed automata.  ...  We thank Patricia Bouyer for her help in the implementation of the tool, and Kåre Jelling Kristoffersen for his proofreading.  ... 
doi:10.7146/brics.v4i29.18955 fatcat:4iaidosfz5b4bf53wpkbhcrk5e

On characteristic formulae for Event-Recording Automata

Omer Landry Nguena Timo, Pierre-Alain Reynier
2013 RAIRO - Theoretical Informatics and Applications  
A standard bridge between automata theory and logic is provided by the notion of characteristic formula. This paper investigates this problem for the class of event-recording automata.  ...  An attempt to express in Event-recording logic (ERL) characteristic formula for timed simulation and bisimulation can be found in Sorea's thesis, but appears to be erroneous.  ...  Characteristic Formulae for Timed Bisimulation A characteristic formula characterising a location of an ERA up to timed bisimilarity should offer a description of: all the actions from the alphabet that  ... 
doi:10.1051/ita/2012029 fatcat:75tb7yx7zbb3fafyn7gmhbtgse

Page 1244 of Mathematical Reviews Vol. , Issue 82c [page]

1982 Mathematical Reviews  
For certain subclasses of automata we find analytic formulas for calculating these characteristics.  ...  Authors’ summary: “We propose an algorithm, easily realized on a computer, for the numerical determination of characteristics of the behavior (probability of change of action, mean time to change of action  ... 

On the Relationship between -automata and Temporal Logic Normal Forms

A. Bolotov
2002 Journal of Logic and Computation  
We consider the relationship between -automata and a specific logical formulation based on a normal form for temporal logic formulae.  ...  While this normal form was developed for use with execution and clausal resolution in temporal logics, we here show how it can represent, syntactically, -automata in a high-level way.  ...  Acknowledgements The authors would like to thank Damian Niwinsky, Igor Walukiewicz and Giacomo Lenzi for useful discussions, and anonymous referees for useful comments and suggestions.  ... 
doi:10.1093/logcom/12.4.561 fatcat:6ayccmxb5na7zmo2jjw3loys7i

A Multi-encoding Approach for LTL Symbolic Satisfiability Checking [chapter]

Kristin Y. Rozier, Moshe Y. Vardi
2011 Lecture Notes in Computer Science  
We also define novel BDD variable orders based on tree decomposition of formula parse trees.  ...  We introduce a novel encoding of symbolic transition-based Büchi automata and a novel, "sloppy," transition encoding, both of which result in improved scalability.  ...  median model analysis time for the same formulas grows exponentially.  ... 
doi:10.1007/978-3-642-21437-0_31 fatcat:43leuwof2vbjnnqs3xjaqtkpxi

An Encryption Method for QR Code Image Based on ECA

Xiaoyang Yu, Yang Song, Yang Yu, Shuchun Yu, Hao Cheng, Yanxia Guan
2013 International Journal of Security and Its Applications  
Cellular Automata can simulate complex phenomenon just using simple dynamical system.  ...  In addition, Cellular Automata and cryptography have a lot of similarities such as diffusivity and integrated chaos.  ...  For the size of 16*16 image, if the exhaustive method is used and seed is 32, the number of operation time is 2 256 .  ... 
doi:10.14257/ijsia.2013.7.5.36 fatcat:ltvse2726za6tbhroctxtzkl44

On Improving Backwards Verification of Timed Automata (Extended Abstract)

Victor Braberman, Carlos López Pombo, Alfredo Olivero
2002 Electronical Notes in Theoretical Computer Science  
Verification techniques for Timed Automata [2] built in tools like Kronos [7] are based on the fixpoint calculus of an appropriate operator.  ...  For instance, to verify logics like TCTL [1] over Timed Automata, it is usually required to obtain the set of states from which the system can evolve and reach a set of states satisfying a formula φ  ...  ✷ In many applications, it is not necessary to calculate the entire characteristic set of a formula like ∃✸φ.  ... 
doi:10.1016/s1571-0661(04)80469-9 fatcat:ugffuym5kjcdhprszhjpyrgkb4

Real-Time Languages, Timed Alternating Automata, and Timed Temporal Logics: Relationships and Specifications

Abdelaziz Fellah
2015 Procedia Computer Science  
Furthermore, we present timed event alternating automata which do not only describe a theoretical model framework for formal languages but establishes strong relationships and foundations to timed propositional  ...  temporal logic through two embedded powerful metaphors -alternation and time.  ...  Furthermore, timed automata have particularly emerged as a practical tool for verifying programs' correctness and as a light-weight version of formal methods for software development.  ... 
doi:10.1016/j.procs.2015.08.409 fatcat:j3dkp4nryzg23kjexwn7bdvile

Limit Deterministic and Probabilistic Automata for LTL ∖ GU [chapter]

Dileep Kini, Mahesh Viswanathan
2015 Lecture Notes in Computer Science  
One consequence of our construction is a new, improved EX-PTIME model checking algorithm (as opposed to the previously known doubly exponential time) for Markov Decision Processes and LTL\GU formulae.  ...  Next, we observe that the automaton for ϕ ∈ LTL\GU can be seen as the composition of two limit deterministic automata: one automata for the formula ψ, where all the until-free subformulae of ϕ are replaced  ...  a set of LTL(F ,G) formula which accepts a relation that is not the characteristic relation but is "subsumed" by the characteristic relation of the set.  ... 
doi:10.1007/978-3-662-46681-0_57 fatcat:2742664tdjcwzbx7lq5vgg54yy

Is there a best büchi automaton for explicit model checking?

František Blahoudek, Alexandre Duret-Lutz, Mojmír Křetínský, Jan Strejček
2014 Proceedings of the 2014 International SPIN Symposium on Model Checking of Software - SPIN 2014  
In this paper, we search for properties of Büchi automata that really influence the performance of explicit model checkers.  ...  As a result of these experiences, we gain a better insight into the characteristics of automata that work well with Spin.  ...  Column n indicates how many translations are successful within the allocated time. The automata columns show accumulated values of standard automata characteristics for all successful translations.  ... 
doi:10.1145/2632362.2632377 dblp:conf/spin/BlahoudekDKS14 fatcat:lcjk32o465bg3ch7dg3hse6uoi

A Unifying Approach to Decide Relations for Timed Automata and their Game Characterization

Shibashis Guha, Shankara Narayanan Krishna, Chinmay Narayan, S. Arun-Kumar
2013 Electronic Proceedings in Theoretical Computer Science  
Such distinguishing formulae can also be generated for many relations other than timed bisimilarity.  ...  In this paper we present a unifying approach for deciding various bisimulations, simulation equivalences and preorders between two timed automata states.  ...  In [14] , a characteristic formula for timed automata has been defined using a certain fragment of the µ-calculus presented in [12] .  ... 
doi:10.4204/eptcs.120.5 fatcat:bvg76wxiwnctngqzykjkw7qdtq
« Previous Showing results 1 — 15 out of 14,388 results