A logical characterization of well branching event structures

DOI10.1016/0304-3975(92)90181-EzbMath0761.68058OpenAlexW1972083914MaRDI QIDQ1190487

P. S. Thiagarajan, Madhavan Mukund

Publication date: 26 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90181-e

zbMATH Keywords

causalitydistributed systemconcurrencyconflictreasoning about the occurrences of events

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Behavioural characterizations of partial order logics, Event Identifier Logic, Models and logics for true concurrency., Context-free event domains are recognizable, Context-free event domains are recognizable, Verification of reactive systems using temporal logic with clocks

Cites Work

• Decidability for branching time
• Unnamed Item
• Unnamed Item
• Unnamed Item