Branching versus linear logics yet again

DOI10.1007/BF01888216MaRDI QIDQ911747zbMATH OpenOpenAlexFDO

Authors José Carmo, Amílcar Sernadas

Publication date 1990

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01888216

zbMATH Keywords

completenessaxiomatisationstemporal logicssafety and livenessframe change operatorsinformation systems specification and verificationlinear and branching modelsstate and path formulas

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• “Sometimes” and “not never” revisited
• scientific article; zbMATH DE number 1705164
• Publication:3028984
• The temporal logic of branching time
• scientific article; zbMATH DE number 3878351

Cites work

• scientific article; zbMATH DE number 4014675 (Why is no real title available?)
• scientific article; zbMATH DE number 3839297 (Why is no real title available?)
• scientific article; zbMATH DE number 3940713 (Why is no real title available?)
• scientific article; zbMATH DE number 4112056 (Why is no real title available?)
• scientific article; zbMATH DE number 3670430 (Why is no real title available?)
• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 3624762 (Why is no real title available?)
• scientific article; zbMATH DE number 3635994 (Why is no real title available?)
• scientific article; zbMATH DE number 4128366 (Why is no real title available?)
• scientific article; zbMATH DE number 3271460 (Why is no real title available?)
• scientific article; zbMATH DE number 3325547 (Why is no real title available?)
• scientific article; zbMATH DE number 3363520 (Why is no real title available?)
• A complete deductive-system for since-until branching-time logic
• Alternative semantics for temporal logics
• An axiomatic basis for computer programming
• Axiomatising the logic of computer programming
• First-order dynamic logic
• Guarded commands, nondeterminacy and formal derivation of programs
• Indeterminist time and truth‐value gaps¹
• Maintaining knowledge about temporal intervals
• Modeling concurrency with partial orders
• Petri nets, event structures and domains. I
• Process logic: Expressiveness, decidability, completeness
• Propositional dynamic logic of regular programs
• Proving Liveness Properties of Concurrent Programs
• Reasoning with time and chance
• Specification and verification of database dynamics
• Temporal aspects of logical procedure definition
• Tense systems with discrete moments of time. I
• The INFOLOG linear tense propositional logic of events and transactions
• The temporal logic of branching time
• The unreal future
• Transformation of dynamic integrity constraints into transaction specifications
• “Sometimes” and “not never” revisited

Cited in

(6)

• “Sometimes” and “not never” revisited
• scientific article; zbMATH DE number 4101144 (Why is no real title available?)
• Branching time logics with multiagent temporal accessibility relations
• Branching vs. Linear Time: Semantical Perspective
• Temporal logic and fair discrete systems
• A Branching Time Logical System for Open Distributed Systems Development

This page was built for publication: Branching versus linear logics yet again

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911747)