Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
20
views
20
references
 Top references
cited by
1
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      1,710
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Is Open Access
      Security Protocols : 7th International Workshop, Cambridge, UK, April 19-21, 1999. Proceedings 

      Computing the Expected Execution Time of Probabilistic Workflow Nets

      other
      Author(s): , ,
      Publication date (Online):
      Publisher: Springer International Publishing

      Read this book at

      Publisher
      Buy book
      Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references20

          • Record: found
          • Abstract: not found
          • Article: not found

          The complexity of computing the permanent

          L.G. Valiant (1979)
          Article 0 comments Cited 450 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            THE APPLICATION OF PETRI NETS TO WORKFLOW MANAGEMENT

            W. VAN DER AALST (1998)
            Article 0 comments Cited 214 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

              J Provan, Michael Ball (1983)
              Article 0 comments Cited 77 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Contributors
                Philipp J. Meyer: (View ORCID Profile)
                Javier Esparza: (View ORCID Profile)
                Philip Offtermatt: (View ORCID Profile)
                Book Chapter
                Publication date (Print): 2019
                Publication date (Online): April 03 2019
                Pages: 154-171
                DOI: 10.1007/978-3-030-17465-1_9
                SO-VID: 9b12b1d3-6a0e-4901-a46e-3f3db4e2171e
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content1,710

                See all similar

                Cited by1

                See all cited by