Results 1  10
of
557,028
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) 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 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) 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
PartialOrder Methods for the Verification of Concurrent Systems  An Approach to the StateExplosion Problem
, 1995
"... Statespace exploration techniques are increasingly being used for debugging and proving correct finitestate concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy to ..."
Abstract

Cited by 362 (11 self)
 Add to MetaCart
Statespace exploration techniques are increasingly being used for debugging and proving correct finitestate concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy
On optimistic methods for concurrency control
 ACM Transactions on Database Systems
, 1981
"... Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic ” in the sense that they rely mainly on transaction backup as a co ..."
Abstract

Cited by 547 (1 self)
 Add to MetaCart
Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic ” in the sense that they rely mainly on transaction backup as a
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing
Preemption in Concurrent Systems
, 1993
"... Process preemption deals with controlling the life and death of concurrent processes. Welldefined preemption mechanisms are essential in controldominated reactive and realtime programming, and accurate handling of preemption requires a timedependent model. We first informally discuss what pre ..."
Abstract

Cited by 73 (0 self)
 Add to MetaCart
. 1 Introduction In concurrent systems, one deals with concurrent processes that coordinate with each other. Coordination can result from information exchange, using for example messages circulating on channels with possibly some implied synchronization. It can also result from process preemption
Detecting Deadlocks In Concurrent Systems
 IN CONCUR’98: CONCURRENCY THEORY (NICE
, 1998
"... We study deadlocks using geometric methods based on generalized process graphs [11], i.e., cubical complexes or HigherDimensional Automata (HDA) [23, 24, 30, 35], describing the semantics of the concurrent system of interest. A new algorithm is described and fully assessed, both theoretically a ..."
Abstract

Cited by 52 (12 self)
 Add to MetaCart
We study deadlocks using geometric methods based on generalized process graphs [11], i.e., cubical complexes or HigherDimensional Automata (HDA) [23, 24, 30, 35], describing the semantics of the concurrent system of interest. A new algorithm is described and fully assessed, both theoretically
OF RANDOM BEHAVIOURS OF CONCURRENT SYSTEMS
, 2012
"... The paper presents a theoretical basis for describing and analysing random behaviours of concurrent systems of a broad class. ..."
Abstract
 Add to MetaCart
The paper presents a theoretical basis for describing and analysing random behaviours of concurrent systems of a broad class.
Verification Tools for FiniteState Concurrent Systems
"... Temporal logic model checking is an automatic technique for verifying finitestate concurrent systems. Specifications are expressed in a propositional temporal logic, and the concurrent system is modeled as a statetransition graph. An efficient search procedure is used to determine whether or not t ..."
Abstract

Cited by 129 (3 self)
 Add to MetaCart
Temporal logic model checking is an automatic technique for verifying finitestate concurrent systems. Specifications are expressed in a propositional temporal logic, and the concurrent system is modeled as a statetransition graph. An efficient search procedure is used to determine whether
Specifying Objects of Concurrent Systems
, 1991
"... Formal specification can play an important role in the design, development, and maintenance of concurrent systems. However, existing languages for specifying concurrent systems lack the same maturity as those for sequential programs. In this dissertation, we define a formal language, the Generic Con ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Formal specification can play an important role in the design, development, and maintenance of concurrent systems. However, existing languages for specifying concurrent systems lack the same maturity as those for sequential programs. In this dissertation, we define a formal language, the Generic
A Probabilistic Approach to Concurrent Mapping and Localization for Mobile Robots
 Machine Learning
, 1998
"... . This paper addresses the problem of building largescale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximumlikelihood estimation problem. It then devises a practical algorithm for generating the most likely map from ..."
Abstract

Cited by 487 (47 self)
 Add to MetaCart
. This paper addresses the problem of building largescale geometric maps of indoor environments with mobile robots. It poses the map building problem as a constrained, probabilistic maximumlikelihood estimation problem. It then devises a practical algorithm for generating the most likely map from data, alog with the most likely path taken by the robot. Experimental results in cyclic environments of size up to 80 by 25 meter illustrate the appropriateness of the approach. Keywords: Bayes rule, expectation maximization, mobile robots, navigation, localization, mapping, maximum likelihood estimation, positioning, probabilistic reasoning 1. Introduction Over the last two decades or so, the problem of acquiring maps in indoor environments has received considerable attention in the mobile robotics community. The problem of map building is the problem of determining the location of entitiesofinterest (such as: landmarks, obstacles), often relative to a global frame of reference (such as ...
Results 1  10
of
557,028