Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
The use of static constructs in a modal process logic
Logic at Botik'89 Symposium on logical foundations of computer science
Bisimulation through probabilistic testing
Information and Computation
Reasoning about knowledge and probability
Journal of the ACM (JACM)
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating sequential processes
Communications of the ACM
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Bisimulation for Labelled Markov Processes
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A Logical Characterization of Bisimulation for Labeled Markov Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Process Algebras for Quantitative Analysis
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Stochastic Relations
Modular construction of complete coalgebraic logics
Theoretical Computer Science
Complete deductive systems for probability logic with application to harsanyi type spaces
Complete deductive systems for probability logic with application to harsanyi type spaces
A Complete Axiomatic System for a Process-Based Spatial Logic
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Labelled Markov Processes
The Measurable Space of Stochastic Processes
QEST '10 Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems
Decidability of modular logics for concurrency
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Decidability of modular logics for concurrency
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Taking it to the limit: approximate reasoning for markov processes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Compositionality of probabilistic Hennessy-Milner logic through structural operational semantics
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
A proof system for compositional verification of probabilistic concurrent processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Hi-index | 0.00 |
We introduce Modular Markovian Logic (MML) for compositional continuous-time and continuous-space Markov processes. MML combines operators specific to stochastic logics with operators reflecting the modular structure of the models, similar to those used by spatial and separation logics. We present a complete Hilbert-style axiomatization for MML, prove the small model property and analyze the relation between stochastic bisimulation and logical equivalence.