Handbook of theoretical computer science (vol. B)
Verifying temporal properties of systems
Verifying temporal properties of systems
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
CTL and ECTL as fragments of the modal &mgr;-calculus
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Temporal reasoning over deontic specifications
Deontic logic in computer science
Modal and temporal logics for processes
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Agents that work in harmony by knowing and fulfilling their obligations
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A logical approach to the dynamics of commitments
Artificial Intelligence
First-Order Dynamic Logic
On the Expressivity of the Modal Mu-Calculus
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
µcke - Efficient µ-Calculus Model Checking
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
We define a deontic logic of regular action as a characterization within a modal μ-calculus of action. First a semantics of deontic notions for regular action is given in terms of conditions on modal action structures. Then modal μ-calculus formulas characterizing these conditions are constructed by closely following the structure of deterministic finite automatons for regular action.