Results 1 - 10 of 3,116

Verification procedures for modified numeral quantifiers

by Jorie Koster-moeller, Jason Varvoutis, Martin Hackl - Proceedings of the 27th West Coast Conference on Formal Linguistics , 1986
"... This paper presents two experimental studies of verification procedures for the modified numeral quantifiers more than k, at least k, at most k, and fewer than k in order to investigate to what extent the form of a particular quantifier determines its associated verification strategies. We show that ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
This paper presents two experimental studies of verification procedures for the modified numeral quantifiers more than k, at least k, at most k, and fewer than k in order to investigate to what extent the form of a particular quantifier determines its associated verification strategies. We show

2006), “Timing of Verification Procedures: Monitoring Versus Auditing

by Roland Strausz - Journal of Economic Behavior and Organization
"... In an agency model this paper studies the strategic effect of differences in the timing of verification when there is no contractual commitment to verification. A principal may choose between two equally efficient verification procedures: monitoring and auditing. Under auditing the principal receive ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
In an agency model this paper studies the strategic effect of differences in the timing of verification when there is no contractual commitment to verification. A principal may choose between two equally efficient verification procedures: monitoring and auditing. Under auditing the principal

Automatic verification of finite-state concurrent systems using temporal logic specifications

by E. M. Clarke, E. A. Emerson, A. P. Sistla - ACM Transactions on Programming Languages and Systems , 1986
"... We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract - Cited by 1388 (62 self) - Add to MetaCart
We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent

Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

by Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger, Pei-Hsin Ho , 1992
"... We introduce the framework of hybrid automata as a model and specification language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior of variables is governed in each state by a set of differential equations. We show that many of the examp ..."
Abstract - Cited by 460 (20 self) - Add to MetaCart
of the examples considered in the workshop can be defined by hybrid automata. While the reachability problem is undecidable even for very restricted classes of hybrid automata, we present two semidecision procedures for verifying safety properties of piecewise-linear hybrid automata, in which all variables change

Symbolic Model Checking without BDDs

by Armin Biere , Alessandro Cimatti, Edmund Clarke, Yunshan Zhu , 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract - Cited by 917 (75 self) - Add to MetaCart
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis

The algorithmic analysis of hybrid systems

by R. Alur, C. Courcoubetis, N. Halbwachs , T. A. Henzinger, P.-H. Ho, X. Nicollin , A. Olivero , J. Sifakis , S. Yovine - THEORETICAL COMPUTER SCIENCE , 1995
"... We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamica ..."
Abstract - Cited by 778 (71 self) - Add to MetaCart
to dynamical laws. For verification purposes, we restrict ourselves to linear hybrid systems, where all variables follow piecewise-linear trajectories. We provide decidability and undecidability results for classes of linear hybrid systems, and we show that standard program-analysis techniques can be adapted

Conversion and verification procedure for goal-based control programs

by Julia M B Braman , Richard M Murray , 2007
"... Abstract Fault tolerance and safety verification of control systems are essential for the success of autonomous robotic systems. A control architecture called Mission Data System, developed at the Jet Propulsion Laboratory, takes a goal-based control approach. In this paper, a method for converting ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract Fault tolerance and safety verification of control systems are essential for the success of autonomous robotic systems. A control architecture called Mission Data System, developed at the Jet Propulsion Laboratory, takes a goal-based control approach. In this paper, a method

Verification Procedures in a Medical Imaging Application

by Neil Muller, Evan De Kock, Ruby Van Rooyen
"... At iThemba Labs, we are constructing a patient position-ing system for proton therapy. This system will use stereo vision techniques to accurately position the patient rel-ative to the beam line. To do this, we need to be sure that the vision system is functioning correctly. In addi-tion to various ..."
Abstract - Add to MetaCart
procedural checks, we implement a vari-ety of software tests to try and detect errors in the vision system. 1.

Verification procedure for isocentric alignment of proton beams

by George Ciangaru, A James N. Yang, Patrick J. Oliver, Martin Bues, Mengping Zhu, Fumio Nakagawa, Hitoshi Chiba, Shin Nakamura, Hirofumi Yoshino, Mosumi Umezawa, Alfred R. Smith , 2007
"... stereotactic linear accelerator radiosurgery—for verifying whether proton beams are being delivered within the required spatial coincidence with the gantry mechanical isocenter. Our procedure uses a proton beam that is collimated by a circular aperture at its central axis and is then intercepted by ..."
Abstract - Add to MetaCart
stereotactic linear accelerator radiosurgery—for verifying whether proton beams are being delivered within the required spatial coincidence with the gantry mechanical isocenter. Our procedure uses a proton beam that is collimated by a circular aperture at its central axis and is then intercepted

The Application of Petri Nets to Workflow Management

by W.M.P. Van Der Aalst , 1998
"... Workflow management promises a new solution to an age-old problem: controlling, monitoring, optimizing and supporting business processes. What is new about workflow management is the explicit representation of the business process logic which allows for computerized support. This paper discusses the ..."
Abstract - Cited by 533 (64 self) - Add to MetaCart
techniques which can be used to verify the correctness of workflow procedures. This paper introduces workflow management as an application domain for Petri nets, presents state-of-the-art results with respect to the verification of workflows, and highlights some Petri-net-based workflow tools.
Results 1 - 10 of 3,116