Filters








282,631 Hits in 2.6 sec

A classification of symbolic transition systems

Thomas A. Henzinger, Rupak Majumdar, Jean-François Raskin
2005 ACM Transactions on Computational Logic  
Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining  ...  Distance equivalence is coarser than trace equivalence 3.4 Example: Rectangular Hybrid Automata For every rectangular automaton, the time-abstract trace-equivalence relation has nite index HKPV98  ...  3A. =3 trace equivalence.  ... 
doi:10.1145/1042038.1042039 fatcat:dblsc35eyfc57lny2n652zat4y

A Classification of Symbolic Transition Systems [chapter]

Thomas A. Henzinger, Rupak Majumdar
2000 Lecture Notes in Computer Science  
Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining  ...  Distance equivalence is coarser than trace equivalence 3.4 Example: Rectangular Hybrid Automata For every rectangular automaton, the time-abstract trace-equivalence relation has nite index HKPV98  ...  3A. =3 trace equivalence.  ... 
doi:10.1007/3-540-46541-3_2 fatcat:pj2pwbwrlffxlkxkoa2bnplgqy

Towards scalable compositional analysis

James C. Corbett, George S. Avrunin
1994 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering - SIGSOFT '94  
(For deterministic systems, essentially all the standard notions of process equivalence collapse to trace equivalence, so this technique also establishes failures equivalence, observational equivalence  ...  Our approach is to generate necessary conditions for the existence of a trace of one system that is not a trace of the other; if the necessary conditions cannot be satisfied the systems are equivalent.  ...  Specifically, we require that, for each communication symbol, the processes whose alphabets contain that symbol agree on the number of times that they accepted the symbol.  ... 
doi:10.1145/193173.195294 dblp:conf/sigsoft/CorbettA94 fatcat:zus7jehf4zdupbftwpbtfxblca

On the Verification of a WiMax Design Using Symbolic Simulation

Salim Ismail Al-Akhras, Sofiène Tahar, Gabriela Nicolescu, Michel Langevin, Pierre Paulin
2013 Electronic Proceedings in Theoretical Computer Science  
We then use symbolic simulation together with equivalence checking and property checking techniques for design verification.  ...  Unfortunately, with computer simulations it is not possible to completely check that a design transformation is correct in a reasonable amount of time, as the number of test patterns required to do so  ...  for the complete equivalence checking process (i.e. symbolic trace computation and pattern matching). 6: Equivalence Checking Experiments Control Experiment Run Time Memory Result Scenario (sec)  ... 
doi:10.4204/eptcs.122.3 fatcat:5lu7oucvrra3tn3bgzuyoxvh3m

Symbolic Model Checking for Rectangular Hybrid Systems [chapter]

Thomas A. Henzinger, Rupak Majumdar
2000 Lecture Notes in Computer Science  
We do so by proving that our method for symbolic Ltl model checking terminates on an infinite-state transition system if the trace-equivalence relation of the system has finite index, which is the case  ...  We remedy this unsatisfactory situation: we present a symbolic method for Ltl model checking which can be performed by HyTech and is guaranteed to terminate on all rectangular automata.  ...  Symbolic Model Checking for Rectangular Hybrid Systems  ... 
doi:10.1007/3-540-46419-0_11 fatcat:ltrqlnogh5gs7h6tqzgkiggfxe

APTE: An Algorithm for Proving Trace Equivalence [chapter]

Vincent Cheval
2014 Lecture Notes in Computer Science  
Moreover, APTE is the only tool that extends the usual notion of trace equivalence by considering "side-channel" information leaked to the attacker such as the length of messages and the execution times  ...  It focuses on proving trace equivalence between processes, which is crucial for specifying privacy type properties such as anonymity and unlinkability.  ...  Observe that execution times for the trace equivalence and length trace equivalence are very similar. However, depending on how many sessions you consider, the execution time varies greatly.  ... 
doi:10.1007/978-3-642-54862-8_50 fatcat:rl37acbh6jaatfbhux6uphwd4e

A Classification of Symbolic Transition Systems [article]

Thomas A. Henzinger, Rupak Majumdar, Jean-Francois Raskin
2001 arXiv   pre-print
Example: Rectangular Hybrid Automata For every rectangular automaton, the (time-abstract) trace-equivalence relation has finite index [HKPV98] .  ...  The state equivalence ∼ =3f is called finite trace equivalence. ⊓ ⊔ Definition: Class STS3 A symbolic transition system S belongs to the class STS3 if the trace-equivalence relation ∼ = S 3 has finite  ... 
arXiv:cs/0101013v1 fatcat:btr3my5fnrhohbumlwzkkxny2e

Page 474 of Mathematical Reviews Vol. , Issue 96a [page]

1996 Mathematical Reviews  
Section 3 introduces trace equivalence. Unfortunately, trace equivalence is not substitutive.  ...  (D-OLD; Oldenburg) Linking visual formalisms: a compositional proof system for statecharts based on symbolic timing diagrams.  ... 

The Observational Power of Clocks [chapter]

Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger
1994 Lecture Notes in Computer Science  
First, our decision procedure for k-clock bisimulation congruence leads to a new, symbolic, decision procedure for timed bisimilarity. Second, timed trace equivalence is known to be undecidable.  ...  Both k-clock bisimulation congruence and k-clock trace congruence form strict decidable hierarchies that converge towards the corresponding timed equivalences.  ...  That is, two states are timed trace equivalent i they generate the same timed words|i.e., sequences of input symbols and time increments.  ... 
doi:10.1007/978-3-540-48654-1_16 fatcat:cp5vw4zwxvap7kuzz6aakjjvmm

Symbolic Algorithms for Infinite-State Games [chapter]

Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar
2001 Lecture Notes in Computer Science  
We give a structural characterization for each class, using equivalence relations on the state spaces of games which range from game versions of trace equivalence to a game version of bisimilarity.  ...  This settles, in particular, the symbolic controller synthesis problem for rectangular hybrid systems. ?  ...  An example of in nite-state game structures with symbolic theories and nite 1-bounded-reach equivalences are networks of timed games, a two-player version of networks of timed automata 1]. u t Game calculus  ... 
doi:10.1007/3-540-44685-0_36 fatcat:67bq5vr2rfbdhah4mfdpukca74

Symbolic Timed Observational Equivalence [article]

Vivek Nigam, Carolyn Talcott, Abrãao Aires Urquiza
2018 arXiv   pre-print
Moreover, efficient symbolic methods have been developed for automating the check of observational equivalence of systems.  ...  Moreover, as our definition uses symbolic time constraints, it can be automated by using SMT-solvers.  ...  That is, for any trace starting from C I there is an equivalent trace starting from C I .  ... 
arXiv:1801.04066v2 fatcat:htwe3vebnjfddpamsskpqbvlvi

Automated Test Generation from Timed Automata [chapter]

Brian Nielsen, Arne Skou
2001 Lecture Notes in Computer Science  
To analyze the specification, to synthesize the timed tests, and to guarantee coverage with respect to a coverage criterion, we use the efficient symbolic techniques recently developed for model checking  ...  In contrast to other attempts, our tests are generated using a coarse equivalence class partitioning of the specification.  ...  be converted into a deterministic (trace) equivalent timed automaton, and 2) trace (language) inclusion between two non-deterministic timed automata is undecidable [2] .  ... 
doi:10.1007/3-540-45319-9_24 fatcat:nfqxjup7sjf7vgri55yrstez2a

Automated test generation from timed automata

Brian Nielsen, Arne Skou
2003 International Journal on Software Tools for Technology Transfer (STTT)  
To analyze the specification, to synthesize the timed tests, and to guarantee coverage with respect to a coverage criterion, we use the efficient symbolic techniques recently developed for model checking  ...  In contrast to other attempts, our tests are generated using a coarse equivalence class partitioning of the specification.  ...  be converted into a deterministic (trace) equivalent timed automaton, and 2) trace (language) inclusion between two non-deterministic timed automata is undecidable [2] .  ... 
doi:10.1007/s10009-002-0094-1 fatcat:epwi5dju4fgrvmiwtx3k24fkqe

8 Test Derivation from Timed Automata [chapter]

Laura Brandán Briones, Mathias Röhl
2005 Lecture Notes in Computer Science  
A real-time system is a discrete system whose state changes occur in realnumbered time [AH97].  ...  These simplify reasoning about time by recording the timing of events with finite precision only and thereby approximate precise timing of activities.  ...  The choice of the next state of a timed automaton depends, in addition to the kind of an input symbol, on the occurrence time of the input symbol relative to the occurrence of previously read symbols.  ... 
doi:10.1007/11498490_10 fatcat:lr6ysy24vjef5k2x7e3ctfjj74

A Method for Proving Observational Equivalence

Véronique Cortier, Stéphanie Delaune
2009 2009 22nd IEEE Computer Security Foundations Symposium  
Then, for simple processes without replication nor else branch, we reduce the decidability of trace equivalence to deciding an equivalence relation introduced by M. Baudet.  ...  In this paper, we consider the applied pi calculus and we show that for determinate processes, observational equivalence actually coincides with trace equivalence, a notion simpler to reason with.  ...  Then the NP-TIME decision procedure for non observational equivalence works as follows: • Guess a symbolic (annotated) trace tr; • Compute (in polynomial time) Σ and Σ such that (tr, Σ) ∈ trace s (A) and  ... 
doi:10.1109/csf.2009.9 dblp:conf/csfw/CortierD09 fatcat:kbq5ofom2najpg4keuqmoam3fq
« Previous Showing results 1 — 15 out of 282,631 results