Results 1 
9 of
9
Analysis of Timed Systems Based on TimeAbstracting Bisimulations
 Formal Methods in System Design
, 1996
"... . We adapt a generic minimal model generation algorithm to compute the coarsest finite model of the underlying infinite transition system of a timed automaton. This model is minimal modulo a timeabstracting bisimulation. Our algorithm uses a refinement method that avoids set complementation, and is ..."
Abstract

Cited by 29 (6 self)
 Add to MetaCart
(Show Context)
. We adapt a generic minimal model generation algorithm to compute the coarsest finite model of the underlying infinite transition system of a timed automaton. This model is minimal modulo a timeabstracting bisimulation. Our algorithm uses a refinement method that avoids set complementation, and is considerably more efficient than previous ones. We use the constructed minimal model for verification purposes by defining abstraction criteria that allow to further reduce the model and to compare it to a specification. 1 Introduction Behavioral equivalences based on bisimulation relations have proven useful for verifying the correctness of concurrent systems. They allow comparing an implementation to a usually more abstract specification both represented as labeled transition systems. This approach also allows reducing the size of the system by identifying equivalent states which is crucial to avoid the explosion of the statespace. Since the introduction of strong bisimulation in [Mil80]...
The Mobility Workbench  A Tool for the piCalculus
 PROC. OF CAV'94
, 1994
"... In this paper we describe the first prototype version of the Mobility Workbench (MWB), an automated tool for manipulating and analyzing mobile concurrent systems (those with evolving connectivity structures) described in the picalculus. The main feature of this version of the MWB is checking ope ..."
Abstract

Cited by 29 (0 self)
 Add to MetaCart
In this paper we describe the first prototype version of the Mobility Workbench (MWB), an automated tool for manipulating and analyzing mobile concurrent systems (those with evolving connectivity structures) described in the picalculus. The main feature of this version of the MWB is checking open bisimulation equivalences. We illustrate the MWB with an example automated analysis of a handover protocol for a mobile telephone system.
Model checking for nominal calculi
 IN FOSSACS, VOLUME 3441 OF LNCS
, 2005
"... Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model checking a difficult task. In this note we survey some of the approaches for model checking nominal calculi. Then, we f ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
(Show Context)
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model checking a difficult task. In this note we survey some of the approaches for model checking nominal calculi. Then, we focus on HistoryDependent automata, a syntaxfree automatonbased model of mobility. HistoryDependent automata have provided the formal basis to design and implement some existing verification toolkits. We then introduce a novel syntaxfree setting to model the symbolic semantics of a nominal calculus. Our approach relies on the notions of reactive systems and observed borrowed contexts introduced by Leifer and Milner, and further developed by Sassone, Lack and Sobocinski. We argue that the symbolic semantics model based on borrowed contexts can be conveniently applied to web service discovery and binding.
A Partition Refinement Algorithm for the picalculus
 Proceedings of CAV'96, volume 1102 of Lecture Notes in Computer Science
, 1996
"... . The partition refinement algorithm [10, 6] is the basis for most of the tools for checking bisimulation equivalences and for computing minimal realisations of CCSlike finite state processes. In this paper, we present a partition refinement algorithm for the ß calculus [7], a development of CCS ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
. The partition refinement algorithm [10, 6] is the basis for most of the tools for checking bisimulation equivalences and for computing minimal realisations of CCSlike finite state processes. In this paper, we present a partition refinement algorithm for the ß calculus [7], a development of CCS where channel names can be communicated. It can be used to check bisimilarity and to compute minimal realisations of finite control processes  the ßcalculus counterpart of CCS finite state processes. The algorithm is developed for strong open bisimulation, and can be adapted to late and early bisimulations, as well as to weak bisimulations. To arrive at the algorithm, a few laws and four characterisations of open bisimulation are proved. 1 Introduction Bisimulation is widely used for defining behavioural equivalences on terms of process description languages. It has been extensively studied in CCS, where efficient algorithms and tools for bisimulation checking have been devised. A promi...
Framework and Tool Support for Formal Verification of High Speed Transfer Protocol Designs
 Telecommunication Systems
, 2002
"... Abstract. Formal description techniques, verification methods, and their toolbased automated application meanwhile provide valuable support for the formal analysis of communication protocol designs. Nevertheless the practical analysis of modern protocols still requires relatively great efforts and ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. Formal description techniques, verification methods, and their toolbased automated application meanwhile provide valuable support for the formal analysis of communication protocol designs. Nevertheless the practical analysis of modern protocols still requires relatively great efforts and therefore many protocol developments do not employ formal methods. In that context the transfer protocol framework aims to complementary support. It supplies a rich collection of specification modules and guides their efficient composition to service and protocol specifications. Moreover the functional relations between service properties and implementing protocol mechanisms have been investigated systematically. The framework provides a collection of corresponding theorems to be applied to protocol correctness proofs. In result protocol verification can be reduced to the selection, instantiation, and proper arrangement of framework theorems. The verification process can further be supported by special toolassistance. The tool COAST identifies the compositional structure of a protocol specification mechanically and selects according framework theorems. It splits service property proofs into arrangements of subproofs where the subproofs can mainly be accomplished by application of the selected framework theorems. After outlining the general transfer protocol framework approach we concentrate on the introduction of the tool COAST. We describe its functions and clarify its application by means of the verification of the complex reallife highspeed data transfer protocol XTP.
Minimization of Timed Systems
, 1998
"... this report is organized as follows : in chapter 2 we introduce TA as a model of timed systems. Chapter 3 reviews the theoretical basis of our work, and presents the basic results of [BFH ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
this report is organized as follows : in chapter 2 we introduce TA as a model of timed systems. Chapter 3 reviews the theoretical basis of our work, and presents the basic results of [BFH
S.: From OWLS descriptions to Petri nets
 ICSOC 2007 workshop, LNCS (to appear), Springer (2008) Paper available at http://www.di.unipi.it/ ∼ corfini/paper/WESOA07.pdf
"... Abstract. While OWLS advertisements provide a rich (ontological and behavioural) description of Web services, there are no tools that support formal analyses of OWLS services. In this paper we present a translator from OWLS descriptions to Petri nets which makes such analyses possible thanks to t ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract. While OWLS advertisements provide a rich (ontological and behavioural) description of Web services, there are no tools that support formal analyses of OWLS services. In this paper we present a translator from OWLS descriptions to Petri nets which makes such analyses possible thanks to the many tools available for Petri nets. 1
An open bisimilarity based automated verification tool for picalculus family of process calculi
 Scalable Computing: Practice and Experience, an International Journal
, 2011
"... The complexity of designing concurrent and highlyevolving interactive systems has grown to a point where system verification has become a hurdle. Fortunately, formal verification methods have arrived at the right time. They detect errors, inconsistencies and incompleteness at early development stag ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
The complexity of designing concurrent and highlyevolving interactive systems has grown to a point where system verification has become a hurdle. Fortunately, formal verification methods have arrived at the right time. They detect errors, inconsistencies and incompleteness at early development stages of a system formally modeled using a formal specification language. πcalculus (Milner, 1999) is one such formal language which provides strong mathematical base that can be used for verifying system specifications. But manually verifying the specifications of concurrent systems is a very tedious and errorprone work, especially if the specifications are large. Consequently, an automated verification tool would be essential for efficient system design and development. In addition, formal verification tools are vital ingredient to fully harness the potential of componentbased software composition. The authors developed such an automated verification tool which is highly portable and seamlessly integrates with the visualization, reduction and performance evaluation tools introduced (Ahmad & Rahimi, 2008; Rahimi, 2006; Rahimi et al., 2001, 2008) to provide a comprehensive tool for designing and analyzing multi process/agent systems. OpenBisimulation (Sangiorgi, 1996) concept is utilized as the theoretical base for the design and implementation of the tool which incorporates an expert system implemented in Java Expert System Shell (JESS) (FriedmanHill, 2003).
A Partition Refinement Algorithm for the ssCalculus
"... Abstract The partition refinement algorithm [11, 7] is the basis for most of the tools for checking bisimulation equivalences and for computing minimal realisations of CCSlike finite state processes. In this paper, we present a partition refinement algorithm for the sscalculus [8], a development o ..."
Abstract
 Add to MetaCart
Abstract The partition refinement algorithm [11, 7] is the basis for most of the tools for checking bisimulation equivalences and for computing minimal realisations of CCSlike finite state processes. In this paper, we present a partition refinement algorithm for the sscalculus [8], a development of CCS where channel names can be communicated. It can be used to check bisimilarity and to compute minimal realisations of finite control processes the sscalculus counterpart of CCS finite state processes. The algorithm is developed for strong open bisimulation, and can be adapted to late and early bisimulations, as well as to weak bisimulations. To arrive at the algorithm, a few laws, proof techniques, and four characterizations of open bisimulation are proved.