Filters








2,105 Hits in 5.2 sec

Type-checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion

Søren Debois, Thomas Hildebrandt, Tijs Slaats, Nobuko Yoshida, Erika Abraham
2016 Logical Methods in Computer Science  
We provide a type system for a process calculus similar to a subset of collaborative BPMN processes with internal (data-based) and external (event-based) branching, message passing, bounded and unbounded  ...  We prove that this type system is sound, i.e., it guarantees request-response liveness for dead-lock free processes.  ...  Acknowledgement We gratefully acknowledge helpful comments from anonymous reviews at LMCS and various conferences.  ... 
doi:10.2168/lmcs-12(1:1)2016 fatcat:d6zxvvqyanfyzg4fhlprkxfmra

Type Checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion [chapter]

Søren Debois, Thomas Hildebrandt, Tijs Slaats, Nobuko Yoshida
2014 Lecture Notes in Computer Science  
We provide a type system for a process calculus similar to a subset of collaborative BPMN processes with internal (data-based) and external (event-based) branching, message passing, bounded and unbounded  ...  We prove that this type system is sound, i.e., it guarantees request-response liveness for dead-lock free processes.  ...  We provided a typing system for a process calculus similar to a non-trivial subset of collaborative BPMN processes with possibly infinite loops and bounded iteration and proved that lock-free, well typed  ... 
doi:10.1007/978-3-662-43613-4_1 fatcat:pi3l2exyvbc3bmw4bsn4g2ewqi

Property specifications for workflow modelling

Peter Y.H. Wong, Jeremy Gibbons
2011 Science of Computer Programming  
checking.  ...  The different types of scope are Global, Before Q, After Q, Between Q and R and After Q until R, where Q and R are states.  ...  Acknowledgements We would like to thank the anonymous referees for useful suggestions and comments. This work is supported by a grant from Microsoft Research.  ... 
doi:10.1016/j.scico.2010.09.007 fatcat:wpbaxtms4bd3dl4eddc362qb5q

Explicit Connection Actions in Multiparty Session Types [chapter]

Raymond Hu, Nobuko Yoshida
2017 Lecture Notes in Computer Science  
This work extends asynchronous multiparty session types (MPST) with explicit connection actions to support protocols with optional and dynamic participants.  ...  Instead, we develop a modelling-based approach to validate MPST safety and progress for these enriched protocols.  ...  We thank Gary Brown and Steve Ross-Talbot for collaborations, and Rumyana Neykova for comments.  ... 
doi:10.1007/978-3-662-54494-5_7 fatcat:cgjqdckbbrawjfjpyu63urpvae

Choreographing Web Services

Adam Barker, Christopher D. Walton, David Robertson
2009 IEEE Transactions on Services Computing  
Furthermore, MAP is based on a formal foundation, this allows model checking of the choreography definition prior to live distribution and enactment.  ...  This paper introduces the Multiagent Protocols (MAP) Web service choreography language and demonstrates how service choreographies can be specified, verified, and enacted with a comparatively simple process  ...  Orchestrations can span multiple applications and/or organizations and result in long-lived, transactional processes.  ... 
doi:10.1109/tsc.2009.8 fatcat:z74v6tig3fac7pqfjiegw47fti

Exploiting practical limitations of UML diagrams for model validation and execution

Friedrich Steimann, Heribert Vollmer
2005 Journal of Software and Systems Modeling  
The framework employs a simple modelling object language (called MOL) for which we present formal syntax and semantics.  ...  The insight that the formal parameter and return types of methods are just special pre-and post-conditions is based on the same considerations.  ...  Because of the weak typing of collaboration diagrams and their connection to class diagrams, we assume it suffices that a correctly typed object diagram exists; no additional type checks are performed  ... 
doi:10.1007/s10270-005-0097-y fatcat:6mdkxrxdrnggddhwwqiurai5mu

Design for verification for asynchronously communicating Web services

Aysu Betin-Can, Tevfik Bultan, Xiang Fu
2005 Proceedings of the 14th international conference on World Wide Web - WWW '05  
Assuming that the participating peers behave according to their interfaces, we verify safety and liveness properties about the global behavior of the composite web service during behavior verification.  ...  During interface verification, we check that each peer implementation conforms to its interface.  ...  There are 5 message types: request with an amount field, approval with an accept field, check with an amount field, nocheck with no fields, and risk with a level field.  ... 
doi:10.1145/1060745.1060853 dblp:conf/www/Betin-CanBF05 fatcat:mwbdjnxsjnhaxhg3jmifye2uhm

Diagnosing Workflow Processes using Woflan

H. M. W. Verbeek
2001 Computer journal  
Workflow management technology promises a flexible solution for business-process support facilitating the easy creation of new business processes and modification of existing processes.  ...  Unfortunately, today's workflow products have no support for workflow verification. Errors made at design-time are not detected and result in very costly failures at run-time.  ...  Furthermore, we are obliged to Edmar Kok of Staffware Benelux for providing us with the Staffware case and helping us out with it.  ... 
doi:10.1093/comjnl/44.4.246 fatcat:dyd7ndpnrrarzj6mhzyx2o7tz4

Recursive Petri nets

Serge Haddad, Denis Poitrenaud
2007 Acta Informatica  
In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural property checking.  ...  Here we present and develop the theory of such a model, the recursive Petri nets.  ...  We thank the anonymous referees for their helpful comments.  ... 
doi:10.1007/s00236-007-0055-y fatcat:ekrl3z2juzdijdlg26xjif2bma

A verification tool for ERLANG

Lars–Åke Fredlund, Dilian Gurov, Thomas Noll, Mads Dam, Thomas Arts, Gennady Chugunov
2003 International Journal on Software Tools for Technology Transfer (STTT)  
recursion.  ...  We give a summary of the verification framework as supported by EVT, discuss reasoning principles essential for successful proofs such as inductive and compositional reasoning, and an efficient treatment  ...  Verifying recursive temporal properties of systems with dynamically evolving process structures and unbounded data is known to be hard.  ... 
doi:10.1007/s100090100071 fatcat:2p62i2rsdzb5jjs3f4j66znykq

Finding Non-terminating Executions in Distributed Asynchronous Programs [chapter]

Michael Emmi, Akash Lal
2012 Lecture Notes in Computer Science  
As K is increased, more possibly divergent behaviors of P are considered, and in the limit as K approaches infinity, our reduction is complete for programs with finite data domains.  ...  Following Emmi et al. [8]'s delay-bounding approach, P (K) encodes a subset of P 's, and thus of P 's, behaviors by limiting scheduling nondeterminism.  ...  Fig. 5 .Fig. 6 . 56 Experimental results with Alive.Here K indicates the delay-bound, and N the recursion-depth bound.  ... 
doi:10.1007/978-3-642-33125-1_29 fatcat:72gnqgvwyjamzli3byge5smupy

Statistical Model Checking of Black-Box Probabilistic Systems [chapter]

Koushik Sen, Mahesh Viswanathan, Gul Agha
2004 Lecture Notes in Computer Science  
We implemented our algorithm in a Java-based prototype tool called VeStA, and experimented with the tool using case studies analyzed in [15] .  ...  Given a set of executions (obtained by Monte Carlo simulation) and a property, our algorithm checks, based on statistical hypothesis testing, whether the sample provides evidence to conclude the satisfaction  ...  Our work has benefitted considerably from stimulating discussions with him and from our many years of collaboration on probabilistic rewriting theories.  ... 
doi:10.1007/978-3-540-27813-9_16 fatcat:3niuzltntjbnpfk6xdwmbbu77m

Realizability of Choreographies Using Process Algebra Encodings

Gwen Salan, Tevfik Bultan, Nima Roohi
2012 IEEE Transactions on Services Computing  
the realizability of choreographies for both synchronous communication and bounded asynchronous communication, and (iii) automate the peer generation process.  ...  In this article, we present an encoding of collaboration diagrams into the LOTOS process algebra for choreography analysis.  ...  The authors thank Javier Cámara and José Antonio Martín for fruitful discussions and interesting comments on a former version of this article.  ... 
doi:10.1109/tsc.2011.9 fatcat:3trnoyeiive4hih2tyadkzup5q

Realizability of Choreographies Using Process Algebra Encodings [chapter]

Gwen Salaün, Tevfik Bultan
2009 Lecture Notes in Computer Science  
the realizability of choreographies for both synchronous communication and bounded asynchronous communication, and (iii) automate the peer generation process.  ...  In this article, we present an encoding of collaboration diagrams into the LOTOS process algebra for choreography analysis.  ...  The authors thank Javier Cámara and José Antonio Martín for fruitful discussions and interesting comments on a former version of this article.  ... 
doi:10.1007/978-3-642-00255-7_12 fatcat:vlnvbwacxnbnde5xkciyz464pq

The Localization Reduction and Counterexample-Guided Abstraction Refinement [chapter]

Edmund M. Clarke, Robert P. Kurshan, Helmut Veith
2010 Lecture Notes in Computer Science  
Automated abstraction is widely recognized as a key method for computer-aided verification of hardware and software.  ...  In this paper, we describe the evolution of counterexample-guided refinement and other iterative abstraction refinement techniques.  ...  We are thankful to Yuan Lu for comments on Section 3.  ... 
doi:10.1007/978-3-642-13754-9_4 fatcat:lh4bngmxzzh65h4oi5rz5vuabu
« Previous Showing results 1 — 15 out of 2,105 results