Filters








22 Hits in 4.8 sec

Symbolic abstraction and deadlock-freeness verification of inter-enterprise processes

Kais Klai, Samir Tata, Jörg Desel
2011 Data & Knowledge Engineering  
The design of complex inter-enterprise business processes (IEBP) is generally performed in a modular way.  ...  to the problem rised in this paper: How can the symbolic observation graph technique be adapted and employed for process composition?  ...  The first one would be to implement a tool for the abstraction and the Deadlock-freeness verification of inter-organizational processes.  ... 
doi:10.1016/j.datak.2011.01.007 fatcat:cpijheeduralviym6udewikfbe

Symbolic Abstraction and Deadlock-Freeness Verification of Inter-enterprise Processes [chapter]

Kais Klai, Samir Tata, Jörg Desel
2009 Lecture Notes in Computer Science  
The design of complex inter-enterprise business processes (IEBP) is generally performed in a modular way.  ...  to the problem rised in this paper: How can the symbolic observation graph technique be adapted and employed for process composition?  ...  The first one would be to implement a tool for the abstraction and the Deadlock-freeness verification of inter-organizational processes.  ... 
doi:10.1007/978-3-642-03848-8_20 fatcat:3ih3z47wkvctjdvopvdrawwoxy

Checking Soundness of Business Processes Compositionally Using Symbolic Observation Graphs [chapter]

Kais Klai, Jörg Desel
2012 Lecture Notes in Computer Science  
The Symbolic Observation Graph (SOG) associated with a labelled transition system and a subset of its labels is an efficient BDDbased abstraction representing the behavior of a system.  ...  Thus, we show how the SOG can be adapted and used so that the verification of several variants of the soundness property can be performed modularly.  ...  Our immediate future works follow three directions: First, we are implementing a tool for the abstraction and the verification of inter-organizational business processes.  ... 
doi:10.1007/978-3-642-30793-5_5 fatcat:vh6yhwfawbho7dth5t3va6ioh4

Business Process Verification: The Application of Model Checking and Timed Automata

Luis E. Mendoza Morales
2014 CLEI Electronic Journal  
The most important result to standardize the notation for graphical representation of Business Processes (BPs) is the Business Process Model and Notation (BPMN).  ...  business needs, as is shown in an instance of an enterprise–project related to Customer Relationship Management.  ...  Acknowledgment This research was partially supported by National Fund of Science, Technology and Innovation, Venezuela, under contract G-2005000165 and conducted as part of the Information Systems Research  ... 
doi:10.19153/cleiej.17.2.2 fatcat:xfjfyzxug5dmba3wkxf2hiiuj4

Checking Compatibility of Web Services Behaviorally [chapter]

Kais Klai, Hanen Ochi
2013 Lecture Notes in Computer Science  
We propose to abstract the concrete behavior of a web service using a SOG and show how composition of web services as well as the compatibility check can be achieved through the composition of their abstractions  ...  This property guarantees the absence of anomalies (e.g. deadlock) that can appear after composition.  ...  Among other abstraction approaches, the Symbolic Observation Graph (SOG) based technique, initially introduced for model checking of concurrent systems [4] and then applied to the verification of inter  ... 
doi:10.1007/978-3-642-40213-5_17 fatcat:5w66bxhwuzag5j6xwjvymsxbem

Modular Verification of Inter-enterprise Business Processes

Kais Klai, Hanen Ochi
unpublished
In this paper, we propose to adapt the Symbolic Observation Graphs (SOG) based approach in order to abstract, to compose and to check Inter-Enterprise Business Processes (IEBP).  ...  We implemented our adaptation of the SOG construction and compared our abstraction and modular verification approach with the Operating Guidelines technique.  ...  In conclusion, to the best of our knowledge, none of the existing approaches combine symbolic (using BDDs) abstraction and modular verification to check the correctness of inter-organizational processes  ... 
fatcat:mwatgizprjbxlmqexig67baafe

Applying Formal Methods to Networking: Theory, Techniques, and Applications

Junaid Qadir, Osman Hasan
2015 IEEE Communications Surveys and Tutorials  
of architecture and abstractions.  ...  This has also led to a great resurgence in interest of applying formal methods to specification, verification, and synthesis of networking protocols and applications.  ...  There also has been work on formally verifying application layer protocols with work being done on modeling and verifying various properties of (boundedness, liveness, deadlock freeness) of trivial FTP  ... 
doi:10.1109/comst.2014.2345792 fatcat:oc6l6pn4tnddjbbr5v4gbbuycq

Rewriting Logic as a Unifying Framework for Petri Nets [chapter]

Mark-Oliver Stehr, José Meseguer, Peter Csaba Ölveczky
2001 Lecture Notes in Computer Science  
The soundness and completeness results we state relate the commutative process semantics of Petri nets proposed by Best and Devillers to the model-theoretic semantics of rewriting logic in the sense of  ...  On the practical side, a major application of the rewriting semantics is its use as a logical and operational representation of Petri net models for formal verification and for the efficient execution  ...  Part of this work is based on earlier work conducted by the first author at University of Hamburg, Germany and in the scope of the European Community project MATCH (CHRX-CT94-0452).  ... 
doi:10.1007/3-540-45541-8_9 fatcat:2o6l3kv5prer3lkebjev7viejy

Parallel Simulation and Virtual-Machine-Based Emulation of Software-Defined Networks

Dong Jin, David M. Nicol
2015 ACM Transactions on Modeling and Computer Simulation  
Parallel simulation and virtual-machine-based emulation of softwaredefined networks. ACM Trans. Model.  ...  Finally, we present a case study, using the testbed, to evaluate network verification applications in an SDN-based data center network. ACM Reference Format: Dong Jin and David M. Nicol. 2015.  ...  Matthew Caesar for their ideas on uncertaintyaware data plane verification in SDN-based networks and valuable discussions on running simulation/emulation experiments for the case study.  ... 
doi:10.1145/2834116 fatcat:7zuiinif4rfl3mh2laudth24se

A Unified Approach to Architecture Conformance Checking

Andrea Caracciolo, Mircea Filip Lungu, Oscar Nierstrasz
2015 2015 12th Working IEEE/IFIP Conference on Software Architecture  
(deadlock-freeness, availability).  ...  [105] found a statistical correlation between the verification of NFRs and project success.  ... 
doi:10.1109/wicsa.2015.11 dblp:conf/wicsa/CaraccioloLN15 fatcat:p7645eykmfgc3aopopwwmwplu4

A visual token-based formalization of BPMN 2.0 based on in-place transformations

Pieter Van Gorp, Remco Dijkman
2013 Information and Software Technology  
as deadlock-freeness and proper completion [58].  ...  In Proceedings of the 5th International Workshop on Mod- elling, Simulation, Verification and Validation of Enterprise Information Systems, pages 126–137.  ... 
doi:10.1016/j.infsof.2012.08.014 fatcat:hsx7ql23y5fpng3mk5a3sd4iqy

Figure 1 The Final Seminar Program

Tony Clark, Robert France, Martin Gogolla, Bran Selic, Tony Clark, Robert France, Martin Gogolla, Bran Selic, Tony Clark, Robert France, Martin Gogolla, Bran Selic (+8 others)
unpublished
., languages, methods, processes, tools). The wide range of development tasks that effective MBE approaches must support leads to two possible tooling scenarios.  ...  This avoids the inter-tool transformation and consistency problems, but the resulting multi-featured tool is a monolithic entity that is costly to develop and evolve.  ...  freeness, termination, confluence, correctness?  ... 
fatcat:gzw6bs2kfjdpvkqf7wavqdemiu

Aalborg Universitet Analysis and Verification of Service Contracts Analysis and Verification of Service Contracts Analysis and Verification of Service Contracts

Joseph Okika, Joseph Okika, Joseph Okika, Dissertation
2010 unpublished
semantics of BPEL based on Rewriting Logic and Maude; and a translation process that maps a BPEL process to UppAal timed automata for automatic verification.  ...  In the second contribution, we derive semantic models in the form of timed automata and check the absence of deadlock for WS-CDL and BPEL service contract specifications.  ...  Acknowledgements The authors thank Wang Xu and Siraj Shaikh at UNU-IIST for helpful suggestion on CSP and FDR, and the careful reviewers.  ... 
fatcat:cxmfbv2cnva4jk5thihbuzeque

Contract-based web service composition

Nikola Milanovic, Humboldt-Universität Zu Berlin, Humboldt-Universität Zu Berlin
2017
language including non-functional properties such as security, dependability, timeliness; 2) Verification of composition correctness by modeling services as abstract machines and developing a formal composition  ...  The main goal of SOA is transparent, flexible and dynamic interaction of services and their clients over multiple interconnected domains.  ...  Acknowledgements First and foremost I would like to thank Miroslaw Malek, for his continued support throughout my work at the Humboldt University. My thanks also go to all the friends and colleagues.  ... 
doi:10.18452/15490 fatcat:ohtrwlpbirawdj24bnrfvio2j4

Correct and Efficient Accelerator Programming (Dagstuhl Seminar 13142)

Bernadette Charron-Bost, Stepahn Merz, Andrey Rybalchenko, Josef Widder, Albert Cohen, Alastair Donaldson, Marieke Huisman, Joost-Pieter Katoen, Stephen Kobourov, Martin Nöllenburg, Monique, Sergiu Hart (+2 others)
2013 unpublished
I discuss the problem definition, the variations and different objectives, and the pitfalls. I also survey the classical algorithms of Douglas and Peucker; Imai and Iri; and of Chan and Chin.  ...  In the last part I also mention an algorithm of Drysdale, Rote, and Sturm [1] for smooth (tangent-continuous) approximation by biarcs.  ...  issues such as the distribution of processes, timing behavior, inter-process communication, and component faults.  ... 
fatcat:m7452gw4cvecbd2vi6w3uha5ai
« Previous Showing results 1 — 15 out of 22 results