default search action
Formal Methods in System Design, Volume 29
Volume 29, Number 1, July 2006
- Wan J. Fokkink, Jun Pang, Jaco van de Pol:
Cones and foci: A mechanical framework for protocol verification. 1-31 - Marta Z. Kwiatkowska, Gethin Norman, David Parker, Jeremy Sproston:
Performance analysis of probabilistic timed automata using digital clocks. 33-78 - Nicolas Halbwachs, David Merchat, Laure Gonnord:
Some ways to reduce the space dimension in polyhedra computations. 79-95 - Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani:
On using priced timed automata to achieve optimal scheduling. 97-114
Volume 29, Number 2, September 2006
- Lubos Brim, Martin Leucker:
Foreword. 115-116 - Jiri Barnat, Ivana Cerná:
Distributed breadth-first search LTL model checking. 117-134 - Cornelia P. Inggs, Howard Barringer:
CTL* model checking on a shared-memory architecture. 135-155 - Orna Grumberg, Tamir Heyman, Assaf Schuster:
A work-efficient distributed algorithm for reachability analysis. 157-175 - Alexander Bell, Boudewijn R. Haverkort:
Distributed disk-based algorithms for model checking very large Markov chains. 177-196 - Víctor A. Braberman, Alfredo Olivero, Fernando Schapachnik:
Dealing with practical limitations of distributed timed model checking for timed automata. 197-214
Volume 29, Number 3, November 2006
- Lars Michael Kristensen, Karsten Schmidt, Antti Valmari:
Question-guided stubborn set methods for state properties. 215-251 - Peter Csaba Ölveczky, José Meseguer, Carolyn L. Talcott:
Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude. 253-293 - Marsha Chechik, Arie Gurfinkel, Benet Devereux, Albert Y. C. Lai, Steve M. Easterbrook:
Data structures for symbolic multi-valued model-checking. 295-344
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.