Filters








5,640 Hits in 2.4 sec

Timed Diagnostics for Reachability Properties [chapter]

Stavros Tripakis
1999 Lecture Notes in Computer Science  
We consider the problem of computing concrete diagnostics for timed automata and reachability properties.  ...  Our algorithm solves the problem in O(l · n 2 ) time, where l is the length of the diagnostic run and n the number of clocks.  ...  I would like also to thank him for his help in understanding the counter-example trace in Bang&Olufsens protocol.  ... 
doi:10.1007/3-540-49059-0_5 fatcat:ev45kw53ineblomwk72dsl2c5i

Time-Optimal Test Cases for Real-Time Systems [chapter]

Anders Hessel, Kim G. Larsen, Brian Nielsen, Paul Pettersson, Arne Skou
2004 Lecture Notes in Computer Science  
We demonstrate how to automatically generate real-time conformance test cases from timed automata specifications.  ...  Specifically we demonstrate how to efficiently generate real-time test cases with optimal execution time i.e test cases that are the fastest possible to execute.  ...  Consider a (concrete) diagnostic trace produced by Uppaal for a given reachability question on A.  ... 
doi:10.1007/978-3-540-40903-8_19 fatcat:vba5k4lagfdbzisd5dvigf3seq

Extended Directed Search for Probabilistic Timed Reachability [chapter]

Husain Aljazzar, Stefan Leue
2006 Lecture Notes in Computer Science  
Such diagnostic Markov chains are not just essential tools for diagnostics and debugging but, they also allow the solution of timed reachability probability to be approximated from below.  ...  In precursory work we proposed a method to select diagnostic traces, in the parlance of functional model checking commonly referred to as failure traces or counterexamples, for probabilistic timed reachability  ...  We thank Marta Kwiatkowska and Holger Hermanns for enlightening discussions on the subject of this paper. We thank also Dave Parker for his advice on choosing appropriate case studies.  ... 
doi:10.1007/11867340_4 fatcat:whdr3wodw5bkjf4uzayzwdygga

Uppaal: Status & developments [chapter]

Kim G. Larsen, Paul Pettersson, Wang Yi
1997 Lecture Notes in Computer Science  
Introduction Uppaal 3 is a t o o l box for validation via graphical simulation and veri cation via automatic model-checking of real-time systems, based on constraint solving and onthe-y techniques.  ...  It is appropriate for systems that can be modelled as networks of timed automata 3, 2 , i.e. a collection of non-deterministic processes with nite control structure and real-valued clocks, communicating  ...  In particular diagnostic traces generated by t h e v eri er may be loaded for examination.  ... 
doi:10.1007/3-540-63166-6_47 fatcat:2xg7royoorhkjbho4clqymoobq

Kronos: A model-checking tool for real-time systems [chapter]

Marius Bozga, Conrado Daws, Oded Maler, Alfredo Olivero, Stavros Tripakis, Sergio Yovine
1998 Lecture Notes in Computer Science  
One major objective of Kronos is to provide a veri cation engine to be integrated into design environments for real-time systems in a wide range of application areas.  ...  to measure time delays.  ...  Availability Kronos is freely available for universities or any other non-pro t organisms. It can be obtained through the web at:  ... 
doi:10.1007/bfb0028779 fatcat:gpoixmbvnzf2jniwj47jowci2y

Kronos: A model-checking tool for real-time systems [chapter]

Marius Bozga, Conrado Daws, Oded Maler, Alfredo Olivero, Stavros Tripakis, Sergio Yovine
1998 Lecture Notes in Computer Science  
One major objective of Kronos is to provide a veri cation engine to be integrated into design environments for real-time systems in a wide range of application areas.  ...  to measure time delays.  ...  Availability Kronos is freely available for universities or any other non-pro t organisms. It can be obtained through the web at:  ... 
doi:10.1007/bfb0055357 fatcat:frmzpvqymzhfbkhsgr4eol7hvy

Time-Optimal Real-Time Test Case Generation Using Uppaal [chapter]

Anders Hessel, Kim G. Larsen, Brian Nielsen, Paul Pettersson, Arne Skou
2004 Lecture Notes in Computer Science  
We demonstrate how to automatically generate real-time conformance test cases from timed automata specifications.  ...  Specifically we demonstrate how to efficiently generate realtime test cases with optimal execution time i.e test cases that are the fastest possible to execute.  ...  Because we use the diagnostic trace facility of a modelchecker based on reachability analysis, the test purpose must be formulated as a property that can be checked by reachability analysis of the combined  ... 
doi:10.1007/978-3-540-24617-6_9 fatcat:go56yr36xbhdfjdde4nzdzezwq

Reachability and error diagnosis in LR(1) parsers

François Pottier
2016 Proceedings of the 25th International Conference on Compiler Construction - CC 2016  
This allows building a collection of pairs of an erroneous input sentence and a (handwritten) diagnostic message, ensuring that this collection covers every error state, and maintaining this property as  ...  For each such "error state", what is a minimal input sentence that causes an error in this state? We propose an algorithm that answers these questions.  ...  Acknowledgments Gabriel Scherer provided motivation for this work. Jacques-Henri Jourdan explained several subtle aspects of the CompCert preparser.  ... 
doi:10.1145/2892208.2892224 dblp:conf/cc/Pottier16 fatcat:sshofm7langrpawyjxwsqporri

Uppaal in a nutshell

Kim G. Larsen, Paul Pettersson, Wang Yi
1997 International Journal on Software Tools for Technology Transfer (STTT)  
verify its safety and bounded liveness properties in terms of its model.  ...  It gives a detailed user guide which describes how to use the various tools of Uppaal version 2.02 to construct abstract models of a real-time system, to simulate its dynamical behavior, to specify and  ...  and then checking reachability properties.  ... 
doi:10.1007/s100090050010 fatcat:mpfnvmapkndjnmdeqdmltwzs2e

UPPAAL in 1995

Johan Bengtsson, Kim G. Larsen, Fredrik Larsson, Paul Pettersson, Wang Yi
1996 BRICS Report Series  
UPPAAL is a tool suite for automatic verification of safety and<br />bounded liveness properties of real-time systems modeled as networks of timed automata<br />[12, 9, 4], developed during the past two  ...  The current version of UPPAAL is able to check for invariant and reachability properties, in particular whether certain combinations of control-nodes of timed automata and constrains on variables are reachable  ...  Introduction UPPAAL is a tool suite for automatic verification of safety and bounded liveness properties of real-time systems modeled as networks of timed automata extended with data variables [12, 9,  ... 
doi:10.7146/brics.v3i60.18772 fatcat:zas3j5kdk5hx3odwqpigahntei

The FC2TOOLS set [chapter]

Amar Bouali, Annie Ressouche, Valérie Roy, Robert Simone
1996 Lecture Notes in Computer Science  
much wider types of properties, while keeping with the same algorithmic kernel, and with the renewed aim of not introducing an heterogeneous formalism for expression of correctness properties, like temporal  ...  Both FC2EXPLICIT and FC2IMPLICIT commands perform synchronised product and reachable state space search.  ...  Timing include synthesis of diagnostic paths or production of automata onto files.  ... 
doi:10.1007/3-540-61474-5_98 fatcat:a2skyrt7jrd5hew3542iy53mee

Verifying Progress in Timed Systems [chapter]

Stavros Tripakis
1999 Lecture Notes in Computer Science  
In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata.  ...  We clarify the requirements of discrete progress (absence of deadlocks) and time progress (absence of deadlocks and timelocks) and give static sufficient conditions for a model of TA to be deadlock-and  ...  the properties.  ... 
doi:10.1007/3-540-48778-6_18 fatcat:446bbk7tirda7ldrpb3lsa5coy

Uppaal in 1995 [chapter]

Johan Bengtsson, Kim G. Larsen, Fredrik Larsson, Paul Pettersson, Wang Yi
1996 Lecture Notes in Computer Science  
UPPAAL 1 is a tool suite for automatic verification of safety and bounded liveness properties of real-time systems modeled as networks of timed automata [12, 9, 4] , developed during the past two years  ...  The current version of UPPAAL is able to check for invariant and reachability properties, in particular whether certain combinations of control-nodes of timed automata and constrains on variables are reachable  ...  Introduction UPPAAL is a tool suite for automatic verification of safety and bounded liveness properties of real-time systems modeled as networks of timed automata extended with data variables [12, 9,  ... 
doi:10.1007/3-540-61042-1_66 fatcat:55oipbfjnve4fcncves6mhl52i

Page 4908 of Mathematical Reviews Vol. , Issue 95h [page]

1995 Mathematical Reviews  
(I-TRIN-IF; Turin); Portinale, Luigi (I-TRIN-IF; Turin) B-W analysis: a backward reachability analysis for diagnostic problem solving suitable to parallel implementation.  ...  This gives a form of recursion more general than the defining property for inductive types but with similar algebraic properties.  ... 

Analysis on demand: Instantaneous soundness checking of industrial business process models

Dirk Fahland, Cédric Favre, Jana Koehler, Niels Lohmann, Hagen Völzer, Karsten Wolf
2011 Data & Knowledge Engineering  
We also briefly compare the diagnostic information delivered by the different approaches and report some first insights from industrial applications.  ...  We investigated these models for soundness (absence of deadlock and lack of synchronization) using three different approaches: the business process verification tool Woflan, the Petri net model checker  ...  Acknowledgements We thank Eric Verbeek for his substantial support in providing a Woflan version for our experiments. Dirk Fahland is funded by the DFG-Graduiertenkolleg "METRIK" (1324).  ... 
doi:10.1016/j.datak.2011.01.004 fatcat:ayo5ajmnnrd5fctbqu3nonpmaq
« Previous Showing results 1 — 15 out of 5,640 results