Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Branching time and partial order in temporal logics
Time and logic
Handbook of logic in computer science (vol. 4)
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Modal and temporal properties of processes
Modal and temporal properties of processes
Alternating-time temporal logic
Journal of the ACM (JACM)
Games and logics for a noninterleaving bisimulation
Nordic Journal of Computing
Independence-friendly modal logic and true concurrency
Nordic Journal of Computing
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
On Plain and Hereditary History-Preserving Bisimulation
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Model-Checking of causality properties
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A completed hierarchy of true concurrent equivalences
Information Processing Letters
Extending separation logic with fixpoints and postponed substitution
Theoretical Computer Science - Algebraic methodology and software technology
Independence and Concurrent Separation Logic
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
A Calculus and logic of resources and processes
Formal Aspects of Computing
The decidability border of hereditary history preserving bisimilarity
Information Processing Letters
Model-Checking Games for Fixpoint Logics with Partial Order Models
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Model-checking games for fixpoint logics with partial order models
Information and Computation
Concurrent logic games on partial orders
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
| Hi-index | 0.00 |
Based on a simple axiomatization of concurrent behaviour we define two ways of observing parallel computations and show that in each case they are dual to conflict and causality, respectively. We give a logical characterization to those dualities and show that natural fixpoint modal logics can be extracted from such a characterization. We also study the equivalences induced by such logics and prove that they are decidable and can be related with well-known bisimulations for interleaving and noninterleaving concurrency. Moreover, by giving a game-theoretical characterization to the equivalence induced by the main logic, which is called Separation Fixpoint Logic (SFL), we show that the equivalence SFL induces is strictly stronger than a history-preserving bisimulation (hpb) and strictly weaker than a hereditary history-preserving bisimulation (hhpb). Our study considers branching-time models of concurrency based on transition systems and petri net structures.