Results 1  10
of
29
Protocol Verification as a Hardware Design Aid
 IN IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN: VLSI IN COMPUTERS AND PROCESSORS
, 1992
"... The role of automatic formal protocol verification in hardware design is considered. Principles are identified that maximize the benefits of protocol verification while minimizing the labor and computation required. A new protocol description language and verifier (both called Mur') are descri ..."
Abstract

Cited by 240 (27 self)
 Add to MetaCart
The role of automatic formal protocol verification in hardware design is considered. Principles are identified that maximize the benefits of protocol verification while minimizing the labor and computation required. A new protocol description language and verifier (both called Mur') are described, along with experiences in applying them to two industrial protocols that were developed as part of hardware designs.
Priorities in process algebra
, 1999
"... This chapter surveys the semantic rami cations of extending traditional process algebras with notions of priority that allow for some transitions to be given precedence over others. The need for these enriched formalisms arises when one wishes to model system features such asinterrupts, prioritized ..."
Abstract

Cited by 106 (11 self)
 Add to MetaCart
This chapter surveys the semantic rami cations of extending traditional process algebras with notions of priority that allow for some transitions to be given precedence over others. The need for these enriched formalisms arises when one wishes to model system features such asinterrupts, prioritized choice, orrealtime behavior. Approaches to priority in process algebras can be classi ed according to whether the induced notion of preemption on transitions is global or local and whether priorities are static or dynamic. Early work in the area concentrated on global preemption and static priorities and led to formalisms for modeling interrupts and aspects of realtime, such as maximal progress, in centralized computing environments. More recent research has investigated localized notions of preemption in which the distribution of systems is taken into account, as well as dynamic priority approaches, i.e., those where priority values may change as systems evolve. The latter allows one to model behavioral phenomena such as scheduling algorithms and also enables the e cient encoding of realtime semantics. Technically, this chapter studies the di erent models of priorities by presenting extensions of Milner's Calculus of Communicating Systems (CCS) with static and dynamic priority as well as with notions of global and local preemption. In each case the operational semantics of CCS is modi ed appropriately, behavioral theories based on strong and weak bisimulation are given, and related approaches for di erent processalgebraic settings are discussed.
Compositional Reachability Analysis Using Process Algebra
 IN PROCEEDINGS OF THE SYMPOSIUM ON TESTING, ANALYSIS, AND VERIFICATION (TAV4
, 1991
"... State explosion is the primary obstacle to practical application of reachability analysis techniques for concurrent systems. State explosion can be substantially controlled by using process algebra to achieve compositional (divideandconquer) analysis. A prototype tool incorporating process algebra ..."
Abstract

Cited by 61 (3 self)
 Add to MetaCart
State explosion is the primary obstacle to practical application of reachability analysis techniques for concurrent systems. State explosion can be substantially controlled by using process algebra to achieve compositional (divideandconquer) analysis. A prototype tool incorporating process algebra is described. The promise and problems of the approach are illustrated by applying the tool to an example that incorporates the alternating bit protocol as a module.
Controlling State Explosion in Reachability Analysis
, 1993
"... : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : x 1. INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 2. BACKGROUND : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.1 Dynamic Analysis of Concurrent Systems : : : : : : : : : : : : ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : x 1. INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 2. BACKGROUND : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.1 Dynamic Analysis of Concurrent Systems : : : : : : : : : : : : : : : : 5 2.2 Static Analysis. : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.2.1 Theorem Proving : : : : : : : : : : : : : : : : : : : : : : : : : 6 2.2.2 Reachability Analysis : : : : : : : : : : : : : : : : : : : : : : : 7 2.2.3 Model Checking : : : : : : : : : : : : : : : : : : : : : : : : : : 9 2.3 Process Algebra : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 11 3. COMPOSITIONAL ANALYSIS USING PROCESS ALGEBRA : : : : : : 18 3.1 Background : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 18 3.1.1 Reachability Analysis : : : : : : : : : : : : : : : : : : : : : : : 18 3.1.2 Process Algebra : : : : : : : : : : : : : : : : : : : : : : : : : : 19...
On the axiomatizability of priority
 Proceedings of Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006
, 2006
"... Abstract. This paper studies the equational theory of bisimulation equivalence over the process algebra BCCSP extended with the priority operator of Baeten, Bergstra and Klop. It is proven that, in the presence of an infinite set of actions, bisimulation equivalence has no finite, sound, groundcomp ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
Abstract. This paper studies the equational theory of bisimulation equivalence over the process algebra BCCSP extended with the priority operator of Baeten, Bergstra and Klop. It is proven that, in the presence of an infinite set of actions, bisimulation equivalence has no finite, sound, groundcomplete equational axiomatization over that language. This negative result applies even if the syntax is extended with an arbitrary collection of auxiliary operators, and motivates the study of axiomatizations using conditional equations. In the presence of an infinite set of actions, it is shown that, in general, bisimulation equivalence has no finite, sound, groundcomplete axiomatization consisting of conditional equations over BCCSP. Sufficient conditions on the priority structure over actions are identified that lead to a finite, groundcomplete axiomatization of bisimulation equivalence using conditional equations. 1
An Overview of Manifold and its Implementation
 Concurrency: Practice and Experience
, 1993
"... this paper we introduce MANIFOLD: ..."
A Rule Format for Associativity
"... Abstract. We propose a rule format that guarantees associativity of binary operators with respect to all notions of behavioral equivalence that are defined in terms of (im)possibility of transitions, e.g., the notions below strong bisimilarity in van Glabbeek’s spectrum. The initial format is a subs ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
Abstract. We propose a rule format that guarantees associativity of binary operators with respect to all notions of behavioral equivalence that are defined in terms of (im)possibility of transitions, e.g., the notions below strong bisimilarity in van Glabbeek’s spectrum. The initial format is a subset of the De Simone format. We show that all trivial generalizations of our format are bound for failure. We further extend the format in a few directions and illustrate its application to several formalisms in the literature. A subset of the format is studied to obtain associativity with respect to graph isomorphism. 1
Rapid Prototyping of Microelectronic Systems
 Advances in Computers
, 1995
"... The need for reduced time to market of new designs has mandated the development of a new generation of computeraided design tools and design methodologies. The active pursuit of a substantial time reduction in the design process is encompassed in rapid system prototyping. This chapter introduces th ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The need for reduced time to market of new designs has mandated the development of a new generation of computeraided design tools and design methodologies. The active pursuit of a substantial time reduction in the design process is encompassed in rapid system prototyping. This chapter introduces the field and the disciplines it comprises, and presents extensive examples of research activities in many key disciplines. New technologies, such as field programmable gate arrays, and new methodologies, such as subsystem reusability, are presented. The directions in formalizing the process of system design from specifications through delivery of a functional system are also discussed. Advances in Computers, V. 40, M. V. Zelkowitz (ed.), Academic Press, In Press, 1995 Contents 1 Introduction 4 2 What Is RSP? 5 2.1 Elements of RSP : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.1.1 System Specifications, Verification, and Reusability : : : : : : ...
Action and predicate safety of hybrid processes
, 2004
"... Safety, put simply, means that a certain property, which is considered bad, does not hold at any time, during any of the possible executions of a system. The analysis of safety properties of a model of a system, is an important way to study correctness of a design or implementation. A famous example ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Safety, put simply, means that a certain property, which is considered bad, does not hold at any time, during any of the possible executions of a system. The analysis of safety properties of a model of a system, is an important way to study correctness of a design or implementation. A famous example is that, when studying a design of a nuclear plant, one might want to verify that