Independence-friendly modal logic and true concurrency

Authors:
Julian C. Bradfield;Sibylle B. Fröschle
Affiliations:
Laboratory for Foundations of Computer Science, Division of Informatics King's Buildings, University of Edinburgh Edinburgh EH9 3JZ United Kingdom;Laboratory for Foundations of Computer Science, Division of Informatics King's Buildings, University of Edinburgh Edinburgh EH9 3JZ United Kingdom
Venue:
Nordic Journal of Computing
Year:
2002

Citing 3
Cited 5

Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)

MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Bisimulation, Games, and Logic

Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
Alternating-time Temporal Logic

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Equivalence Criteria for Compositional IF Modal Logics

Electronic Notes in Theoretical Computer Science (ENTCS)
Logics and Bisimulation Games for Concurrency, Causality and Conflict

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Hybrid Logic Meets IF Modal Logic

Journal of Logic, Language and Information
A logic for true concurrency

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
The complexity of independence-friendly fixpoint logic

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider modal analogues of Hintikka et al.'s 'independence-friendly first-order logic', and discuss their relationship to equivalences previously studied in concurrency theory.