Filters








227 Hits in 8.3 sec

The sweep-line state space exploration method

Kurt Jensen, Lars M. Kristensen, Thomas Mailund
2012 Theoretical Computer Science  
The sweep-line method exploits intrinsic progress in concurrent systems to alleviate the state explosion problem in explicit state model checking.  ...  The concept of progress makes it possible to delete states from the memory during state space exploration and thereby reduce peak memory usage. The contribution of this paper is twofold.  ...  Acknowledgements The sweep-line method has been influenced by several co-authors of papers. In particular, we acknowledge the contributions of Jonathan Billington, Søren Christensen, Guy E.  ... 
doi:10.1016/j.tcs.2011.12.036 fatcat:ajwaohtrgzffzkrngki7vcjgcm

Advanced State Space Methods [chapter]

Kurt Jensen, Lars M. Kristensen
2009 Coloured Petri Nets  
A conceptual sweep-line moves through the state space layer by layer: All states in the layer are "on" the sweep-line.  ...  State Space Partitioning The state explosion problem can be addressed by dividing the state space into partitions: Distributed model checking: State space exploration is conducted using a set of machines  ... 
doi:10.1007/b95112_8 fatcat:puynvaytqzb3rfwjac57fpvvii

ASAP: An Extensible Platform for State Space Analysis [chapter]

Michael Westergaard, Sami Evangelista, Lars Michael Kristensen
2009 Lecture Notes in Computer Science  
The ASCoVeCo State space Analysis Platform (ASAP) is a tool for performing explicit state space analysis of coloured Petri nets (CPNs) and other formalisms.  ...  to analyze protocols and/or experiment with different algorithms.  ...  Model : MODEL 3 structure Storage : STORAGE 4 val progressValue : Model . state −> int ) : EXPLORATION = 5 struct 6 fun explore initialStates = . . . 7 end ¦ ¥ (a) First of lines of the sweep-line search  ... 
doi:10.1007/978-3-642-02424-5_18 fatcat:dpwhcuxp3ravfapbvqhb4mby4q

A BSP algorithm for on-the-fly checking CTL* formulas on security protocols

Frédéric Gava, Franck Pommereau, Michaël Guedj
2014 Journal of Supercomputing  
This paper presents a distributed algorithm to compute on-the-fly whether a structured model of a security protocol satisfies or not a CTL* formula.  ...  The design of this simple and still efficient algorithm is possible by using the structured nature of security protocols. A prototype implementation has been developed, allowing to run benchmarks.  ...  The problem of checking a CTL* formula is that the generation of large discrete state spaces of security protocols is so a computationally intensive activity with extreme memory demands, highly irregular  ... 
doi:10.1007/s11227-014-1099-8 fatcat:dzkzdtkhtzf3fafvilwijyvqhe

Presentation of the 9th Edition of the Model Checking Contest [chapter]

Elvio Amparore, Bernard Berthomieu, Gianfranco Ciardo, Silvano Dal Zilio, Francesco Gallà, Lom Messan Hillah, Francis Hulin-Hubard, Peter Gjøl Jensen, Loïg Jezequel, Fabrice Kordon, Didier Le Botlan, Torsten Liebke (+7 others)
2019 Msphere  
The Model Checking Contest (MCC) is an annual competition of software tools for model checking.  ...  bounds in the model, evaluation of reachability formulas, evaluation of CTL formulas, and evaluation of LTL formulas.  ...  LoLA can apply several state space reduction methods, including partial order reduction (the stubborn set method), symmetry reduction, the sweep-line method, Karp/Miller graph construction, and bloom filtering  ... 
doi:10.1007/978-3-030-17502-3_4 fatcat:i63wf7m4fzggxpl54xxwpv3jei

Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method [chapter]

Thomas Mailund, Michael Westergaard
2004 Lecture Notes in Computer Science  
The technique maps each state vector onto a number between zero and the number of reachable states and uses the sweep-line method to delete the state vectors themselves.  ...  This paper is concerned with a memory-efficient representation of reachability graphs.  ...  With the algorithm presented here, the sweep-line method can be used for checking more general properties than just state properties as in [25] .  ... 
doi:10.1007/978-3-540-24730-2_16 fatcat:xjrwzyegybeltmfaofn2zbevwm

A BSP Algorithm for On-the-Fly Checking CTL* Formulas on Security Protocols

Frederic Gava, Michael Guedj, Franck Pommereau
2012 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies  
This paper presents a distributed algorithm to compute on-the-fly whether a structured model of a security protocol satisfies or not a CTL* formula.  ...  The design of this simple and still efficient algorithm is possible by using the structured nature of security protocols. A prototype implementation has been developed, allowing to run benchmarks.  ...  The problem of checking a CTL* formula is that the generation of large discrete state spaces of security protocols is so a computationally intensive activity with extreme memory demands, highly irregular  ... 
doi:10.1109/pdcat.2012.12 dblp:conf/pdcat/GavaGP12 fatcat:3sik76n6nfb6tgdtz7hhbw23fm

Formulating Robot Pursuit-Evasion Strategies by Model Checking

Hongyang Qu, Andreas Kolling, Sandor M. Veres
2014 IFAC Proceedings Volumes  
These strategies are computed by satisfying a temporal logic formula by model checking. We present theorems that show the connection between a strategy and a temporal logic formula.  ...  This paper presents an application of a model checking framework to robotic search, particularly search problems known as pursuit-evasion that assume a smart, fast and evading target.  ...  In addition, we discussed how the model checking methods proposed enable a comparison of algorithmic complexity of the different pursuit-evasion models.  ... 
doi:10.3182/20140824-6-za-1003.02476 fatcat:mjvp2rzonbbnrasw4hwaicmgra

Mechanised Verification of Distributed State-Space Algorithms for Security Protocols

Frederic Gava, Arthur Hidalgo, Jean Fortin
2012 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies  
But it is wellknown that for non trivial protocols, MC may enumerate statespaces of astronomical sizes -the famous state-space explosion problem.  ...  Distributed model checking is a solution but complex and subject to bugs: a MC can validate a model but miss an invalid state.  ...  In future works, we plan to check model-checking algorithms (in the sense of determining if a logical LTL/CTL* formula holds a model) as Tarjan like algorithms.  ... 
doi:10.1109/pdcat.2012.93 dblp:conf/pdcat/GavaHF12 fatcat:dhsylybaznhf5ondi2znwwjnqe

A BSP Algorithm for On-the-fly Checking LTL Formulas on Security Protocols

Frederic Gava, Michael Guedj, Franck Pommereau
2012 2012 11th International Symposium on Parallel and Distributed Computing  
Using the structured nature of the security protocols allows us to design a simple and efficient parallelisation of an algorithm which constructs the state-space under consideration in a need-driven fashion  ...  This paper presents a Bulk-Synchronous Parallel (BSP) algorithm to compute on-the-fly whether a structured model of a security protocol satisfies a LTL formula.  ...  due to the sweep-line progression  ... 
doi:10.1109/ispdc.2012.10 dblp:conf/ispdc/GavaGP12 fatcat:zx65px4cc5a3zods2hccg76vxy

Proactive Detection of Computer Worms Using Model Checking

Johannes Kinder, Stefan Katzenbeisser, Christian Schallhart, Helmut Veith
2010 IEEE Transactions on Dependable and Secure Computing  
To this end, we introduce the new specification language CTPL, which balances the high expressive power needed for malware signatures with efficient model checking algorithms.  ...  In this paper, we propose the use of model checking-a well established software verification technique-for proactive malware detection.  ...  ACKNOWLEDGMENTS We would like to thank Julia Lawall for pointing out an error in the algorithm in an earlier draft of this article.  ... 
doi:10.1109/tdsc.2008.74 fatcat:5hnl547bwbbw7b7t6bevdjlzyq

Application of Coloured Petri Nets in System Development [chapter]

Lars Michael Kristensen, Jens Bæk Jørgensen, Kurt Jensen
2004 Lecture Notes in Computer Science  
A revised CPN model of the lock management protocol is presented in Sect. 4, together with the application of the state space methods currently available in the CPN computer tools.  ...  Since then, a number of new state space methods have been developed and implemented in the CPN computer tools.  ...  similar to the sweep-line method, i.e., deleting information about states during the state space exploration.  ... 
doi:10.1007/978-3-540-27755-2_18 fatcat:6tdiwo2civar7al34pwcgh2hge

Interleaved Invariant Checking with Dynamic Abstraction [chapter]

Liang Zhang, Mukul R. Prasad, Michael S. Hsiao
2005 Lecture Notes in Computer Science  
The notion of dynamic abstraction was recently introduced as a means of abstracting a model during the process of model checking.  ...  In this paper we show, theoretically and practically, how dynamic abstraction can be used with different algorithms for invariant checking, namely forward, backward and interleaved state-space traversal  ...  However, the ideas can easily be applied to other model checking methods such as SAT-based state-space traversal or even SAT-BMC.  ... 
doi:10.1007/11560548_9 fatcat:mjulm5ckcfdjxoo3onmljfv234

Simulating Cut-to-Length Harvesting Operations in Appalachian Hardwoods

Jingxin Wang, Chris B. LeDoux, Yaoxiang Li
2005 International Journal of Forest Engineering  
Cut-to-length (CTL) harvesting systems involving small and large harvesters and a forwarder were simulated using a modular computer simulation model.  ...  The balanced John Deere 988 CTL system was 31% more productive and 8% more expensive than the balanced Timbco T425 CTL system in the 20 to 36 cm DBH range.  ...  Although we only evaluated two harvesters, five stands, and three harvest methods, the results and regression equations presented should be valuable to planners, managers, and loggers considering the use  ... 
doi:10.1080/14942119.2005.10702510 fatcat:atxqx5kpuvcm5priaex6x3kexe

Segmented State Space Traversal for Conformance Testing of Cyber-Physical Systems [chapter]

Matthias Woehrle, Kai Lampka, Lothar Thiele
2011 Lecture Notes in Computer Science  
It is demonstrated how this strategy together with domain-specific adaptations remedies state space explosion inherent to formal (state-based) verification.  ...  This paper presents the foundations of segmented state space traversal in the setting of quantitative conformance testing of a CPS.  ...  This work was supported by NCCR-MICS (SNSF grant 5005-67322) and the Nano-Tera.ch X-Sense project.  ... 
doi:10.1007/978-3-642-24310-3_14 fatcat:mks4gtrt5bbvxa75g7etbb6lzy
« Previous Showing results 1 — 15 out of 227 results