LEADER 04014nam  22007215  450 
001 996465868103316
005 20200703042944.0
010   $a3-540-49675-0
024 7 $a10.1007/3-540-60915-6
035   $a(CKB)1000000000234414
035   $a(SSID)ssj0000324541
035   $a(PQKBManifestationID)11273779
035   $a(PQKBTitleCode)TC0000324541
035   $a(PQKBWorkID)10313004
035   $a(PQKB)10279735
035   $a(DE-He213)978-3-540-49675-5
035   $a(PPN)155189247
035   $a(EXLCZ)991000000000234414
100   $a20121227d1996      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aLogics for Concurrency$b[electronic resource] $eStructure versus Automata /$fedited by Faron Moller, Graham Birtwistle
205   $a1st ed. 1996.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996.
215   $a1 online resource (XIII, 268 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1043
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-60915-6 
327   $aSpecification Structures and propositions-as-types for concurrency -- Automated temporal reasoning about reactive systems -- Decidability results in automata and process theory -- Modal and temporal logics for processes -- An automata-theoretic approach to linear temporal logic.
330   $aThis book presents five tutorial-style lectures on various approaches to the problem of verifying distributed systems: three chapters concentrate on linear-time or branching-time temporal logics; one addresses process equivalence with an emphasis on infinite-state systems; and the final one presents a novel category-theoretic approach to verification. The various formalisms for expressing properties of concurrent systems, based on automata-theoretic techniques or structural properties, are studied in detail. Much attention is paid to the style of writing and complementary coverage of the relevant issues. Thus these lecture notes are ideally suited for advanced courses on logics for concurrent systems. Equally, they are indispensable reading for anyone researching the area of distributed computing.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v1043
606   $aArchitecture, Computer
606   $aComputers
606   $aComputer logic
606   $aMathematical logic
606   $aAlgorithms
606   $aComputer System Implementation$3https://scigraph.springernature.com/ontologies/product-market-codes/I13057
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
615  0$aArchitecture, Computer.
615  0$aComputers.
615  0$aComputer logic.
615  0$aMathematical logic.
615  0$aAlgorithms.
615 14$aComputer System Implementation.
615 24$aTheory of Computation.
615 24$aLogics and Meanings of Programs.
615 24$aMathematical Logic and Formal Languages.
615 24$aComputation by Abstract Devices.
615 24$aAlgorithm Analysis and Problem Complexity.
676   $a004/.36/015113
702   $aMoller$b Faron$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aBirtwistle$b Graham$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465868103316
996   $aLogics for concurrency$91501965
997   $aUNISA