Filters








474 Hits in 5.5 sec

Model-checking CSP-Z [chapter]

Alexandre Mota, Augusto Sampaio
1998 Lecture Notes in Computer Science  
In this paper we describe a formal strategy for deadlock analysis of specifications in CSP-Z (a language which integrates CSP and Z).  ...  We also show how FDR (a modelchecker originally developed for CSP) can be adapted for CSP-Z.  ...  Based on this technique we develop a deadlock analysis strategy for CSP-Z specifications and show how to adapt FDR to work for CSP-Z; this is presented in Section 4.  ... 
doi:10.1007/bfb0053592 fatcat:le7i7fosdrhspdeiqxf7a3ukky

A Pattern-based deadlock-freedom analysis strategy for concurrent systems [article]

Pedro Antonino and Augusto Sampaio and Jim Woodcock
2022 arXiv   pre-print
In this work, we propose a method that systematises the use of local analysis in the verification of deadlock freedom for concurrent and distributed systems.  ...  At the core of our work, we have a number of CSP refinement expressions that allows the user of our method to automatically verify all the behavioural restrictions that we impose.  ...  This proposed method is based on prior works that explored local analysis for the verification of deadlock freedom for concurrent and distributed systems.  ... 
arXiv:2207.08854v1 fatcat:ntqfvqhazfanfa3kpoy6nadujy

A Pervasive Design Strategy for Distributed Health Care Systems

Oliver Faust
2008 Open Medical Informatics Journal  
With the pervasive concept of communicating sequential processes we have a formal method to create a model of the complete system.  ...  Distributed health care systems require a pervasive design strategy to ensure security, stability and functionality of the system.  ...  Therefore, the CSP based design strategy is truly pervasive: it opens the door for future projects on a secure, stable and functional basis. Fig . (1) .  ... 
doi:10.2174/1874431100802010058 fatcat:vk4webxhgjbefmjk7cjj4ljwny

Embedding the Stable Failures Model of CSP in PVS [chapter]

Kun Wei, James Heather
2005 Lecture Notes in Computer Science  
, and that an industrial-scale example, a 'virtual network ' [22], with any number of dimensions, is deadlock-free.  ...  Our work, extending a previous embedding of the traces model of CSP in [6], provides a platform for the formal verification not only of safety specifications, but also of liveness specifications of concurrent  ...  In this paper, we choose the CSP stable failures model since this provides a rich enough framework for analysis of deadlock freedom and determinism (for processes known to be non-divergent).  ... 
doi:10.1007/11589976_15 fatcat:2iiajjdpzffadi4tf4462ppomi

A framework for verifying deadlock and nondeterminism in UML activity diagrams based on CSP [article]

Lucas Lima, Amaury Tavares, Sidney C. Nogueira
2019 arXiv   pre-print
These specifications are the input for the automatic verification of deadlock and nondeterministic behavior using the FDR refinement checker.  ...  This work proposes a framework for the automatic verification of deadlock and nondeterminism in UML activity diagrams.  ...  Cloud computing has emerged as a model for deploying systems and services on the Internet or private networks instead of local environments.  ... 
arXiv:1910.13638v1 fatcat:bypw3sblxffjrhbeatijtqb6m4

Applied Formal Methods – From CSP to Executable Hybrid Specifications [chapter]

Jan Peleska
2005 Lecture Notes in Computer Science  
In each of these projects, CSP served as the underlying formalism for specification, verification and testing.  ...  Since 1985, CSP has been applied by the author, his research team at Bremen University and verification engineers at Verified Systems International to a variety of "real-world" projects.  ...  I would like to express my gratitude to the organisers and speakers of the 25 Years of CSP event at the London South Bank University, for creating a stimulating conference with numerous interesting -sometimes  ... 
doi:10.1007/11423348_19 fatcat:g23jjlstjvhgnk7fkiek3yefe4

Local Analysis of Determinism for CSP [chapter]

Rodrigo Otoni, Ana Cavalcanti, Augusto Sampaio
2017 Lecture Notes in Computer Science  
CSP is a well established process algebra; the main tool for practical use of CSP, the model checker FDR, checks determinism using a global analysis.  ...  We propose a local analysis, in order to improve performance and scalability.  ...  We thank Madiel Conserva Filho and Joabe Jesus Júnior for the helpful discussions.  ... 
doi:10.1007/978-3-319-70848-5_8 fatcat:ixrgmokwqbdfffgtw54k4osigu

A Verified Protocol to Implement Multi-way Synchronisation and Interleaving in CSP [chapter]

Marcel Vinicius Medeiros Oliveira, Ivan Soares De Medeiros Júnior, Jim Woodcock
2013 Lecture Notes in Computer Science  
We provide a performance analysis of our code.  ...  The complexity of concurrent systems can turn their development into a very complex and error-prone task. The use of formal methods like CSP considerably simplifies this task.  ...  The strategy is based on the synchronisation information described in Section 3.1 and makes use of CSP renaming.  ... 
doi:10.1007/978-3-642-40561-7_4 fatcat:ihyyn7tzprgm3gavw2yidtt5ra

Local Livelock Analysis of Component-Based Models [chapter]

Madiel S. Conserva Filho, Marcel Vinicius Medeiros Oliveira, Augusto Sampaio, Ana Cavalcanti
2016 Lecture Notes in Computer Science  
Our method is based solely on the local analysis of the minimum sequences that lead the CSP model back to its initial state.  ...  In this case, we carry out livelock analysis in the context of a component model, BR I C , whose behaviour of the components is described as a CSP process.  ...  our local and compositional analysis in CSP-based models.  ... 
doi:10.1007/978-3-319-47846-3_18 fatcat:mdrjldtqcvhw5i6zfxidi5vaxu

Formal Specification and Verification of Communication in Network-On-Chip: An Overview

Fateh Boutekkouk
2018 International Journal of Recent Contributions from Engineering, Science & IT  
Network-On-Chip (NOC) is an emerging paradigm to surmount traditional bus based Systems-On-Chip (SOC) limits especially scalability and communication performances.  ...  A NOC includes many applications that can execute concurrently. This situation may show some undesirable behaviors such as deadlock, livelock, starvation, etc.  ...  FSP (Finite State Processes) is a process specification language based closely on the CSP. The authors proposed a set of rules that should be followed for modeling a NOC concurrent system.  ... 
doi:10.3991/ijes.v6i4.9416 fatcat:7fljmcayfvdgpd7v3d4vt7lkvu

A refinement checking based strategy for component-based systems evolution

José Dihego, Augusto Sampaio, Marcel Oliveira
2020 Journal of Systems and Software  
We propose inheritance and refinement relations for a CSP-based component model (BRIC), which supports a constructive design based on composition rules that preserve classical concurrency properties such  ...  as deadlock freedom.  ...  For instance, FDR4 [23] provides an automatic analysis of model refinement and of properties like deadlock, livelock and determinism.  ... 
doi:10.1016/j.jss.2020.110598 fatcat:ou2argy5vrh4nkhkak7sl5snsy

An Analytical and Experimental Comparison of CSP Extensions and Tools [chapter]

Ling Shi, Yang Liu, Jun Sun, Jin Song Dong, Gustavo Carvalho
2012 Lecture Notes in Computer Science  
Our comparison can be used to guide users to choose the appropriate CSP extension and verification tool based on the system characteristics. PAT (Process Analysis Toolkit) [23] for CSP#.  ...  For instance, CSPM combines CSP with a functional programming language whereas CSP# integrates high-level CSP-like process operators with low-level procedure code.  ...  Dias for the valuable comments.  ... 
doi:10.1007/978-3-642-34281-3_27 fatcat:plle7hcumfc6pogznq5h7p3anq

Compositional State Space Reduction Using Untangled Actions

Xu Wang, Marta Kwiatkowska
2007 Electronical Notes in Theoretical Computer Science  
We propose a compositional technique for efficient verification of networks of parallel processes.  ...  For networks of processes, using global untangled actions derived from local ones, efficient reduction algorithms have been devised for systems with a large number of small processes running in parallel  ...  Roscoe for reading an earlier draft of this paper and giving valuable suggestions. The research is funded by EPSRC projects GR/S11091/01 & GR/S11084/01.  ... 
doi:10.1016/j.entcs.2006.10.052 fatcat:p2b7ettuqfdqveebzzk6tbscmu

Safety Verification of Driving Resource Occupancy Rules Based on Functional Language

Zhixi Hu, Yi Zhu, Xiaoying Chen, Yu Zhao
2022 Future Internet  
Firstly, the modeling and verification framework of an autopilot model based on CSPM is given. Secondly, the process algebra definition of CSPM is given.  ...  In view of the lack of safety verification of environmental resource occupation rules in autonomous driving, this paper proposes a verification method of automatic driving model based on functional language  ...  CSP M is an inert functional programming language based on CSP, which can be executed by machines. Failure Divergence Refinement (FDR) is an analysis program tool based on CSP M description [17] .  ... 
doi:10.3390/fi14020060 fatcat:vann5t2zqbaabl24s2767wy76m

Automated formal analysis of networks: FDR models of arbitrary topologies and flow-control mechanisms [chapter]

JN Reed, DM Jackson, B Deianov, GM Reed
1998 Lecture Notes in Computer Science  
A novel induction technique suitable for process algebraic, finite-state machine techniques is described which can be used to verify end-to-end properties of certain arbitrarily configured networks.  ...  We also present a formal model of an algorithm for regulating burstiness of network traffic, which incorporates discrete timing constraints.  ...  The theory of refinement in CSP allows a wide range of correctness conditions to be encoded as refinement checks between processes.  ... 
doi:10.1007/bfb0053594 fatcat:ciehstyjfnccrft7ppfek3bfby
« Previous Showing results 1 — 15 out of 474 results