A multiprocess network logic with temporal and spatial modalities

DOI10.1016/0022-0000(85)90003-0zbMath0565.68031OpenAlexW2019539243MaRDI QIDQ1058846

A. P. Sistla, John H. Reif

Publication date: 1985

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(85)90003-0

zbMATH Keywords

complexitydistributed systemsdecidabilitysemanticssyntaxcomputations on networks with complex connectionsfiring squad problem for a linear arraymultidimensional temporal logicrouting on a shuffle-exchange networkspatial modalitiessystolic arithmetic computationstemporal modalities

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65)

Related Items (15)

Time-extraction for temporal logic -- logic programming and local process time ⋮ Non-finitely axiomatisable two-dimensional modal logics ⋮ Axiomatisation and decidability of multi-dimensional Duration Calculus ⋮ Synthesis of communicating process skeletons from temporal-spatial logic specifications ⋮ The complexity of reasoning about knowledge and time. I: Lower bounds ⋮ A decidable temporal logic of parallelism ⋮ A Spatial Logic for Simplicial Models ⋮ Reasoning about networks with many identical finite state processes ⋮ Formal timing analysis of distributed systems ⋮ On the axiomatizability of some first-order spatio-temporal theories ⋮ Products of ‘transitive” modal logics ⋮ Unnamed Item ⋮ Non-primitive recursive decidability of products of modal logics with expanding domains ⋮ Functional systems in the context of temporal×modal logics with indexed flows ⋮ Analyzing completeness of axiomatic functional systems for temporal × modal logics

Cites Work

• The temporal logic of branching time
• The propositional dynamic logic of deterministic, well-structured programs
• Propositional dynamic logic of regular programs
• Relationships between nondeterministic and deterministic tape complexities
• The complexity of propositional linear temporal logics
• Ultracomputers
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Formalization of Properties of Functional Programs
• Parallel Processing with the Perfect Shuffle
• Unnamed Item
• Unnamed Item

This page was built for publication: A multiprocess network logic with temporal and spatial modalities