Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleAbstract cyclic communicating processes: A logical view
dc.contributor.authorThiagarajan, P.S.
dc.identifier.citationThiagarajan, P.S. (2002). Abstract cyclic communicating processes: A logical view. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2360 LNCS : 68-69. ScholarBank@NUS Repository.
dc.description.abstractTemporal logics have been very successful as tools for specifying and verifying dynamic properties of finite state distributed systems. An intriguing fact is that these logics, in order to be effective, must semantically filter out at least one of the two basic features of the behavior of distributed systems: indeterminacy and concurrency. To be precise, linear time temporal logics use as models the interleaved runs of a system in which both indeterminacy (i.e. the choices presented to the system) and concurrency (i.e. causally independent occurrences of actions) have been, in some sense, defined away. In branching time temporal logics, the (interleaved) runs glued together into a single object -usually called a computation treeserves as a model. Here, speaking again loosely, indeterminacy is present through the branching nature of the computation tree but information regarding concurrency has been filtered out. There are also families of linear time temporal logics which are interpreted over the partially ordered runs (often represented as Mazurkiewicz traces) of a system. In this setting, concurrency is in but indeterminacy is out. © Springer-Verlag Berlin Heidelberg 2002.
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume2360 LNCS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Oct 12, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.