Filters








24,714 Hits in 5.8 sec

Model Checking Synchronized Products of Infinite Transition Systems

Stefan Wöhrle, Wolfgang Thomas, Colin Stirling
2007 Logical Methods in Computer Science  
As models we consider products of infinite transition systems with different synchronization constraints.  ...  Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic has to be expressive enough  ...  Löding for pointing us to GTRS-graphs to prove Theorem 3.3 and the anonymous referees (both of the conference version and the journal version of this paper) for many helpful comments and pointers to related  ... 
doi:10.2168/lmcs-3(4:5)2007 fatcat:6ma577uwsjb6vjvqgb6ngxoqt4

Some Perspectives of Infinite-State Verification [chapter]

Wolfgang Thomas
2005 Lecture Notes in Computer Science  
We report on recent progress in the study of infinite transition systems for which interesting properties (like reachability of designated states) can be checked algorithmically.  ...  Two methods for the generation of such models are discussed: the construction from simpler models via operations like unfolding and synchronized product, and the internal representation of state spaces  ...  Products Products of transition graphs with different synchronization constraints are ubiquitous in system modelling, in particular for representing distributed systems.  ... 
doi:10.1007/11562948_3 fatcat:z6i5hzxbvndrvj3rq52gqym5ju

Net Reductions for LTL Model-Checking [chapter]

Javier Esparza, Claus Schröter
2001 Lecture Notes in Computer Science  
We present a set of reduction rules for LTL model-checking of 1-safe Petri nets.  ...  Finally, we present a number of experimental results and show that the model-checking time of a net system can be significantly decreased if it has been preprocessed with our reduction techniques.  ...  We would like to thank Keijo Heljanko for valuable comments and sending us an implementation of the LTL model-checker.  ... 
doi:10.1007/3-540-44798-9_25 fatcat:jw73b2pqqjcahkzr5z5obkn47m

Algorithmic metatheorems for decidable LTL model checking over infinite systems [article]

Anthony Widjaja To, Leonid Libkin
2009 arXiv   pre-print
We prove various algorithmic metatheorems for the problems of model checking LTL and its two common fragments LTL(Fs,Gs) and LTLdet over the expressive class of word/tree automatic transition systems,  ...  class of infinite systems, but over a large family of classes of infinite systems.  ...  Introduction The study of model checking over infinite-state systems is now an active research area.  ... 
arXiv:0910.4932v2 fatcat:zpg4jzxyk5cwxabhjd7ubxipnq

Extending Testing Automata to All LTL [chapter]

Ala Eddine Ben Salem
2015 Lecture Notes in Computer Science  
This allows to extend the model checking approach based on this new form of testing automata to check other kinds of properties and also other kinds of models (such as Timed models).  ...  Implementation and experimentation of this extended TGTA approach show that it is statistically more efficient than the Büchi Automata approaches (BA and TGBA), for the explicit model checking of LTL properties  ...  The formalization of the system produces a model M that formally describes all the possible executions of the system.  ... 
doi:10.1007/978-3-319-19195-9_13 fatcat:nsyxsxn2xfb6rk6y22sugytnxa

Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems [chapter]

Anthony Widjaja To, Leonid Libkin
2010 Lecture Notes in Computer Science  
We prove various algorithmic metatheorems for the problems of model checking LTL and its two common fragments LTL(Fs, Gs) and LTL det over the expressive class of word/tree automatic transition systems  ...  class of infinite systems, but over a large family of classes of infinite systems.  ...  Introduction The study of model checking over infinite-state systems is now an active research area.  ... 
doi:10.1007/978-3-642-12032-9_16 fatcat:qeltq5zo3ndyjkhceyksple6se

Automatic deployment of autonomous cars in a Robotic Urban-Like Environment (RULE)

M. Lahijanian, M. Kloetzer, S. Itani, C. Belta, S.B. Andersson
2009 2009 IEEE International Conference on Robotics and Automation  
We use transition systems to model the motion and sensing capabilities of the robots and the topology of the environment and use tools resembling model checking to generate robot control strategies and  ...  to verify the correctness of the solution.  ...  ACKNOWLEDGEMENTS We would like to thank Ben Heng, Greg Vulkih, and Boyan Yordanov (Boston University) for their help with the construction of the platform and software implementation, Kim Wheeler (Road  ... 
doi:10.1109/robot.2009.5152605 dblp:conf/icra/LahijanianKIBA09 fatcat:emzuuinqcff7lp5wj3s3wb5fwa

Bounded Analysis and Decomposition for Behavioural Descriptions of Components [chapter]

Pascal Poizat, Jean-Claude Royer, Gwen Salaün
2006 Lecture Notes in Computer Science  
Symbolic Transition Systems (STS) support the definition of component models which take into account control, concurrency, communication and data types.  ...  They can be used to test boundedness of systems and to generate finite simulations for them so that standard model-checking techniques may be applied for verification purposes.  ...  This proposition states that a composite system may be abstracted by checking the boundedness of one component and if bounded, the synchronous product of the bounded configuration graph with other components  ... 
doi:10.1007/11768869_5 fatcat:rcfsnbesqfgn7ajpi2t6i57bya

Correctness issues on MARTE/CCSL constraints

Frédéric Mallet, Robert de Simone
2015 Science of Computer Programming  
The UML Profile for Modeling and Analysis of Real-Time and Embedded systems promises a general modeling framework to design and analyze systems.  ...  Lots of works have been published on the modeling capabilities offered by MARTE, much less on available verification techniques.  ...  Building the synchronized product of a ccsl specification is key to conduct model-checking on properties.  ... 
doi:10.1016/j.scico.2015.03.001 fatcat:2lvkdcb4zvbmjor35zjeiutitm

Fluent model checking for event-based systems

Dimitra Giannakopoulou, Jeff Magee
2003 Proceedings of the 9th European software engineering conference held jointly with 10th ACM SIGSOFT international symposium on Foundations of software engineering - ESEC/FSE '03  
Model checking is an automated technique for verifying that a system satisfies a set of required properties.  ...  The paper describes an approach to model checking fluent-based linear-temporal logic properties, with its implementation and application in the LTSA tool.  ...  product As discussed, model checking involves computing the synchronous product of the system with a Büchi automaton.  ... 
doi:10.1145/940103.940106 fatcat:jrcwt7l5f5bhrfh3xosyxiydei

Fluent model checking for event-based systems

Dimitra Giannakopoulou, Jeff Magee
2003 Proceedings of the 9th European software engineering conference held jointly with 10th ACM SIGSOFT international symposium on Foundations of software engineering - ESEC/FSE '03  
Model checking is an automated technique for verifying that a system satisfies a set of required properties.  ...  The paper describes an approach to model checking fluent-based linear-temporal logic properties, with its implementation and application in the LTSA tool.  ...  product As discussed, model checking involves computing the synchronous product of the system with a Büchi automaton.  ... 
doi:10.1145/940071.940106 dblp:conf/sigsoft/GiannakopoulouM03 fatcat:73i53wyqbrajfcq74mflgacpvq

Fluent model checking for event-based systems

Dimitra Giannakopoulou, Jeff Magee
2003 Software engineering notes  
Model checking is an automated technique for verifying that a system satisfies a set of required properties.  ...  The paper describes an approach to model checking fluent-based linear-temporal logic properties, with its implementation and application in the LTSA tool.  ...  product As discussed, model checking involves computing the synchronous product of the system with a Büchi automaton.  ... 
doi:10.1145/949952.940106 fatcat:yaqfwzhxrfepljgxnzjcmkm6s4

Exploiting symmetry in linear time temporal logic model checking: One step beyond [chapter]

K. Ajami, S. Haddad, J. -M. Ilié
1998 Lecture Notes in Computer Science  
We define an appropriate quotient structure for the synchronized product of the Biichi automaton and the global state transition graph.  ...  Model checking is a useful technique to verify properties of dynamic systems but it has to cope with the state explosion problem.  ...  Then we prove that model checking over this quotient is equivalent to model checking over the synchronized product.  ... 
doi:10.1007/bfb0054164 fatcat:jixezmab7zgxfkd3xgpdlle2cm

Model Checking of Component Connectors

Mohammad Izadi, Ali Movaghar, Farhad Arbab
2007 Computer Software and Applications Conference (COMPSAC) Proceedings of the IEEE International  
Another disadvantages of model checking is that it does not work for infinite-state systems.  ...  (intersection) product of the two automata (system and property automata) is checked.  ... 
doi:10.1109/compsac.2007.153 dblp:conf/compsac/IzadiMA07 fatcat:lysriwrovfalxdsge5jm7xxuvi

A New Unfolding Approach to LTL Model Checking [chapter]

Javier Esparza, Keijo Heljanko
2000 Lecture Notes in Computer Science  
A new unfolding approach to LTL model checking is presented, in which the model checking problem can be solved by direct inspection of a certain finite prefix.  ...  We first make use of the automata-theoretic approach to model checking: a combined system is constructed as the product of the system itself and of an automaton for the negation of the property to be checked  ...  Total adequate orders for 1-safe Petri nets and for synchronous products of transition systems, have been presented in [5, 4] .  ... 
doi:10.1007/3-540-45022-x_40 fatcat:i7xdcsmxwjgntngv3f6x7dotna
« Previous Showing results 1 — 15 out of 24,714 results