27,655 Hits in 4.4 sec

"Sometime" is sometimes "not never"

Leslie Lamport
1980 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '80  
Process logic is a form of branching time temporal logic. 4.3.2.  ...  (A similar definition can be made for a branching time temporal logic.)  ... 
doi:10.1145/567446.567463 dblp:conf/popl/Lamport80 fatcat:mdaovluwbjfpln4j73m4ff4uzy

Forthcoming Papers

2002 Journal of Logic and Computation  
Axioms for Branching Time M. Reynolds Logics of general branching time, or historical necessity, have long been studied but important axiomatization questions remain open.  ...  We consider the relationship between -automata and a specific logical formulation based on a normal form for temporal logic formulae.  ...  Stirling This paper defines and examines model checking games for the branching time temporal logic CTL £ .  ... 
doi:10.1093/logcom/12.3.545 fatcat:76u554iwwrbanemi5acreoed6e

Page 49 of Journal of Research and Practice in Information Technology Vol. 26, Issue 2 [page]

1994 Journal of Research and Practice in Information Technology  
In Linear Time, Branch- ing Time and Partial Order in Logics and Models for Concurrency, LNCS 354. Springer Verlag. von WRIGHT, J. and LANGBACKA, T. (1992).  ...  In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, pages 50-122. Springer Verlag. BRADFIELD, J. and STIRLING, C. (1990).  ... 

Strategic directions in concurrency research

Rance Cleaveland, Scott A. Smolka
1996 ACM Computing Surveys  
Similarly, certain correctness properties (e.g., of the form "from any state is it possible to get to a state satisfying proposition p") are expressible in branching-time temporal logic but not in linear-time  ...  Numerous variants of linear-time and branching-time temporal logic have been proposed, as researchers have investigated operators that ease the formulation of properties in different settings [Manna and  ... 
doi:10.1145/242223.242252 fatcat:4gu2wurduveqdhqqrhr27yaqjq

Limits for automatic verification of finite-state concurrent systems

Krzysztof R. Apt, Dexter C. Kozen
1986 Information Processing Letters  
Indeed, for the case of deterministic programs, linear and branching time temporal logics coincide.  ...  (Clarke et al. (1, 2, 4] use branching time logic, but the Theorem holds for any temporal logic for which this validity problem is decidable.) Thus, QR is in rr?. To show that QR is rr?  ... 
doi:10.1016/0020-0190(86)90071-2 fatcat:2a62wkz7ovfs7asptqbwky4cge

Page 4895 of Mathematical Reviews Vol. , Issue 95h [page]

1995 Mathematical Reviews  
The authors continue the development of the temporal logic ISTL* (Interleaving Sets Temporal Logic), which combines syn- tactic and semantic features of both linear-time and branching- time logics.  ...  Manna and Pnueli to branching-time logics [see in Tenth Annual ACM Symposium on Principles of Programming Languages (Austin, TX, 1983), 141- 154, ACM, New York, 1983].  ... 

Page 5367 of Mathematical Reviews Vol. , Issue 90I [page]

1990 Mathematical Reviews  
Allen Emerson and Jai Srinivasan, Branching time temporal logic (pp. 123-172); M.  ...  {The papers that appear to be in final form are being reviewed individually. } 90i1:68009 68-06 03-06 * Linear time, branching time and partial order in logics and models for concurrency.  ... 

Page 6638 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
ISBN 3-540-51803-7 Contents: Colin Stirling, Comparing linear and branching time temporal logics (pp. 1-20); Shmuel Katz and Doron Peled, Inter- leaving set temporal logic (pp. 21-43); Susanne Graf and  ...  Meyer, A remark on bisimulation between probabilistic processes (pp. 26- 40); José Carmo and Amilcar Sernadas, Inevitability in branching time (pp. 41-62); Ludmila A. Cherkasova [L. A.  ... 

A Model-Theoretic Approach to the Verification of Situated Reasoning Systems

Anand S. Rao, Michael P. Georgeff
1993 International Joint Conference on Artificial Intelligence  
We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the practical use of such logics for verifying agent-oriented  ...  In this paper, we present three propositional variants of such logics, with different expressive power, and analyze the computational complexity of verifying if a given property is satisfied by a given  ...  Theorem 2 Solving the model checking problem for committed branching temporal BDI logic, CCTLBDI will take time to run.  ... 
dblp:conf/ijcai/RaoG93 fatcat:kqwieqc4jvcadcox45ypi5kmtq

Modular Model Checking [chapter]

Orna Kupferman, Moshe Y. Vardi
1998 Lecture Notes in Computer Science  
In the rst approach, the assumption is speci ed by branching temporal formulas. In the second approach, the assumption is speci ed by linear temporal logic. We consider guarantees in 8CTL and 8CTL ?  ...  In this paper we consider assume-guarantee speci cations in which the guarantee is speci ed by branching temporal formulas. We distinguish between two approaches.  ...  This observation provides a justi cation to the approach taken in CLM89] to avoid the assume-guarantee paradigm.  ... 
doi:10.1007/3-540-49213-5_14 fatcat:7minku4asbaavlqjdyfivy6cfy

Analyzing Artifact Anomalies in a Temporal Structural Workflow for SBS

Feng-Jian Wang, Parameswaramma Mandalapu
2014 2014 IEEE 38th International Computer Software and Applications Conference Workshops  
A service-based system (SBS) defined with minimum and maximum execution time can be easily transferred into a temporal structured workflow.  ...  In other word, they are less effective in a temporal structural workflow (TS workflow). Neither for SBS. Besides, the time complexity of these methods are NP, not efficient either.  ...  Detection of Concurrency Anomalies in a Temporal Workflow As defined in Section 2, each process has its execution time interval (Min, Max) in a temporal workflow.  ... 
doi:10.1109/compsacw.2014.81 dblp:conf/compsac/WangM14 fatcat:d5iiiydypnahvdclgud2fqegxq

Why so Many Temporal Logics Climb up the Trees? [chapter]

Alexander Rabinovich, Shahar Maoz
2000 Lecture Notes in Computer Science  
Yet, unlike the case for linear time logics, no canonical temporal logic of branching time was agreed upon.  ...  Many temporal logics were suggested as branching time speci cation formalisms during the last 20 years.  ...  Hence, the situation for temporal logics over trees (branching time models), is completely di erent than the situation for temporal logics of linear time, where the temporal logic based on the single modality  ... 
doi:10.1007/3-540-44612-5_58 fatcat:ns7vw4onx5axzihxxye4h3pzva

"Sometimes" and "not never" revisited: on branching versus linear time temporal logic

E. Allen Emerson, Joseph Y. Halpern
1986 Journal of the ACM  
The differences between and appropriateness of branching versus linear time temporal logic for reasoning about concurrent programs are studied.  ...  The paper concludes with a comparison of the utility of branching and linear time temporal logics. * Roughly speaking, when X is fusion closed, if xs is a prefix of some execution of the program and sy  ...  [29] ) a system of temporal logic as either a linear time logic in which the semantics of the time structure is linear, or a system of branching time logic based on the semantics corresponding to a branching  ... 
doi:10.1145/4904.4999 fatcat:idsbqx5ybffv5fibcedxupatg4

Automated Compliance Verification of Business Processes in Apromore

Heerko Groefsema, Nick van Beest, Abel Armas-Cervantes
2017 International Conference on Business Process Management  
The generator can extract a set of formal specifications that declaratively describe a set of business process variants; whereas the verifier can check whether temporal properties over business process  ...  This paper presents the integration of two plugins, a declarative process specification generator and a compliance verifier, into the Apromore advanced business process analytics platform.  ...  In addition, the approach allows for the evaluation of globally and locally in a branch next activity executions without the need for new or extended temporal logics.  ... 
dblp:conf/bpm/GroefsemaBA17 fatcat:r6tixpuvpjgvbk2aaztfnp22qa

Page 7115 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
Summary: “We determine the complexity of testing whether a finite state, sequential or concurrent probabilistic program satis- fies its specification expressed in linear-time temporal logic.  ...  An EXPSPACE- complete temporal logic (MITL—metric interval temporal logic) is introduced.  ... 
« Previous Showing results 1 — 15 out of 27,655 results