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
29
views
16
references
 Top references
cited by
16
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,075
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Computer Aided Verification 

      Using partial orders for the efficient verification of deadlock freedom and safety properties

      other
      Author(s): ,
      Publication date (Online):
      Publisher: Springer Berlin Heidelberg

      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 references16

          • Record: found
          • Abstract: not found
          • Conference Proceedings: not found

          Checking that finite state concurrent programs satisfy their linear specification

          Amir Pnueli, Orna Lichtenstein (1985)
          Article 0 comments Cited 78 times – based on 0 reviews
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            The complementation problem for Büchi automata with applications to temporal logic

            A. Sistla, Moshe Vardi, Pierre Wolper (1987)
            Article 0 comments Cited 64 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Proving Liveness Properties of Concurrent Programs

              Leslie Lamport, Susan Owicki (1982)
              Article 0 comments Cited 51 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 1992
                Publication date (Online): May 29 2005
                Pages: 332-342
                DOI: 10.1007/3-540-55179-4_32
                SO-VID: 12285807-107f-448a-9adc-728ef3a7f711
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content2,075

                See all similar

                Cited by16

                See all cited by