Results 11  20
of
1,219
Counter machines: decidable properties and applications to verification Problems
 MFCS'00, LNCS 1893
, 2000
"... Abstract. We study various generalizations of reversalbounded multicounter machines and show that they have decidable emptiness, infiniteness, disjointness, containment, and equivalence problems. The extensions include allowing the machines to perform linearrelation tests among the counters and pa ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
Abstract. We study various generalizations of reversalbounded multicounter machines and show that they have decidable emptiness, infiniteness, disjointness, containment, and equivalence problems. The extensions include allowing the machines to perform linearrelation tests among the counters
Bisimulation Equivalence is Decidable for all ContextFree Processes
 Information and Computation
, 1995
"... Introduction Over the past decade much attention has been devoted to the study of process calculi such as CCS, ACP and CSP [13]. Of particular interest has been the study of the behavioural semantics of these calculi as given by labelled transition graphs. One important question is when processes c ..."
Abstract

Cited by 97 (15 self)
 Add to MetaCart
to be wellestablished. There are many automatic verification tools for their analysis which incorporate equivalence checking. Sound and complete equational theories exist for the various known equivalences, an elegant example is [18]. One may be led to wonder what the results will look like for infinite
Verifying Programs with Unreliable Channels (Extended Abstract)
 Information and Computation
, 1992
"... The research on algorithmic verification methods for concurrent and parallel systems has mostly focussed on finitestate systems, with applications in e.g. communication protocols and hardware systems. For infinitestate systems, e.g. systems that operate on data from unbounded domains, algorithmic ..."
Abstract

Cited by 205 (40 self)
 Add to MetaCart
to model e.g. link protocols such as the Alternating Bit Protocol and HDLC. The unboundedness of the channels makes these systems infinitestate. For this class of systems, we show that several interesting verification problems are decidable by giving algorithms for verifying the following classes
Deciding linear inequalities by computing loop residues
 JOURNAL OF THE ACM
, 1981
"... V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe form x _< y + c can be decided quickly by examining the loops m certain graphs Pratt's method is generalized, first to real feaslbdlty of mequahues m two variables and arbitrary coefficients, and ult ..."
Abstract

Cited by 87 (0 self)
 Add to MetaCart
V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes ofthe form x _< y + c can be decided quickly by examining the loops m certain graphs Pratt's method is generalized, first to real feaslbdlty of mequahues m two variables and arbitrary coefficients
Logics and Automata for Verification: Expressiveness and Decidability Issues
, 2000
"... This dissertation investigates and extends the mathematical foundations of logics and automata for the interleaving and synchronous noninterleaving view of system computations with an emphasis on decision procedures and relative expressive powers, and introduces extensions of these foundations to th ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This dissertation investigates and extends the mathematical foundations of logics and automata for the interleaving and synchronous noninterleaving view of system computations with an emphasis on decision procedures and relative expressive powers, and introduces extensions of these foundations to the emerging domain of noninterleaving asynchronous computations. System computations are described as occurrences of system actions, and tractable collections of such computations can be naturally represented by finite automata upon which one can do formal analysis. Specifications of system properties are usually described in formal logics, and the question whether the system at hand satisfies its specification is then solved by means of automatatheoretic constructions.
Verification of artifactcentric systems: Decidability and modeling issues
 In Proc. of ICSOC, volume 8274 of LNCS
, 2013
"... Abstract. Artifactcentric business processes have recently emerged as an approach in which processes are centred around the evolution of business entities, called artifacts, giving equal importance to controlflow and data. The recent GuardStateMilestone (GSM) framework provides means for specif ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
problem by translating GSM into a wellstudied formal framework. We exploit this translation to isolate an interesting class of “statebounded ” GSM models for which verification of sophisticated temporal properties is decidable. We then introduce some guidelines to turn an arbitrary GSM model into a
On Decidable Verification of Nonterminating Golog Programs
"... The highlevel action programming language GOLOG has proven to be a useful means for the control of autonomous agents such as mobile robots. Usually, such agents perform openended tasks, and their control programs are hence nonterminating. Before deploying such a program to the robot, it is often ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, the verification of nonterminating GOLOG programs is indeed decidable, which is achieved by means of three restrictions. First, we use the ES variant of a decidable twovariable fragment of the Situation Calculus that was introduced by Gu and Soutchanski. Second, we have to restrict the GOLOG program
Decidable and Undecidable Problems in Systolic Circuit Verification
, 1991
"... We present a decision method for automatic verification of a nontrivial class of systolic circuits. A formal model for systolic circuits, and a formal definition of systolic circuit verification are provided. Using this model, we give a decision method for verification of a class of circuits, in whi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a decision method for automatic verification of a nontrivial class of systolic circuits. A formal model for systolic circuits, and a formal definition of systolic circuit verification are provided. Using this model, we give a decision method for verification of a class of circuits
Bounded Situation Calculus Action Theories and Decidable Verification
"... Abstract We define a notion of bounded action theory in the situation calculus, where the theory entails that in all situations, the number of ground fluent atoms is bounded by a constant. Such theories can still have an infinite domain and an infinite set of states. We argue that such theories are ..."
Abstract
 Add to MetaCart
are fairly common in applications, either because facts do not persist indefinitely or because one eventually forgets some facts, as one learns new ones. We discuss various ways of obtaining bounded action theories. The main result of the paper is that verification of an expressive class of firstorder µ
Deciding the Verification Problem for Abstract State Machines
"... 1 Introduction Abstract State Machines. Abstract State Machines (ASMs) provide a formal method for transparent design and specification of complex dynamic systems. They combine advantages of informal methods (understandability, executability) with the advantages of formal methods (precision and appl ..."
Abstract
 Add to MetaCart
1 Introduction Abstract State Machines. Abstract State Machines (ASMs) provide a formal method for transparent design and specification of complex dynamic systems. They combine advantages of informal methods (understandability, executability) with the advantages of formal methods (precision and applicability of mathematical methods and results). The executability of ASMspecifications yields the possibility to find already a part of the errors made in a specification via testing. However, the ASMmethod is a formal method. There is a well defined semantics and this allows the application of mathematical methods to analyze ASMs. In particular, these are often results from mathematical logic as ASMs are based on firstorder structures.
Results 11  20
of
1,219