The power of the future perfect in program logics
Information and Control
Proof systems for satisfiability in Hennessy-Milner logic with recursion
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
Three logics for branching bisimulation
Journal of the ACM (JACM)
Translations between modal logics of reactive systems
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
Specification in CTL + Past for verification in CTL
Information and Computation - Special issue on EXPRESS 1997
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
CMC: A Tool for Compositional Model-Checking of Real-Time Systems
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
A Complete Compositional Model Proof System for a Subset of CCS
Proceedings of the 12th Colloquium on Automata, Languages and Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Compositional Model Checking of Real Time Systems
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Testing Hennessy-Milner Logic with Recursion
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Model-Checking for Hybrid Systems by Quotienting and Constraints Solving
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Proceedings of the Conference on Logic of Programs
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
The power of reachability testing for timed automata
Theoretical Computer Science
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
From Pre-Historic to Post-Modern Symbolic Model Checking
Formal Methods in System Design
Precongruence formats for decorated trace semantics
ACM Transactions on Computational Logic (TOCL)
Component Verification with Automatically Generated Assumptions
Automated Software Engineering
Compositionality of Hennessy-Milner logic by structural operational semantics
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Reactive Systems: Modelling, Specification and Verification
Reactive Systems: Modelling, Specification and Verification
Residual for Component Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Process Algebra: Equational Theories of Communicating Processes
Process Algebra: Equational Theories of Communicating Processes
Operational and epistemic approaches to protocol analysis: bridging the gap
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Testing systems of concurrent black-boxes—an automata-theoretic and decompositional approach
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Interpreted systems semantics for process algebra with identity annotations
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
| Hi-index | 0.00 |
This paper presents a decomposition technique for Hennessy-Milner logic with past and its extension with recursively defined formulae. In order to highlight the main ideas and technical tools, processes are described using a subset of CCS with parallel composition, nondeterministic choice, action prefixing and the inaction constant. The study focuses on developing decompositional reasoning techniques for parallel contexts in that language.