Communicating sequential processes
Communicating sequential processes
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
Frames in the space of situations (research note)
Artificial Intelligence
Tableau-based model checking in the propositional mu-calculus
Acta Informatica
Handbook of theoretical computer science (vol. B)
Graphical versus logical specifications
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of logic in computer science (vol. 2)
Proving properties of states in the situation calculus
Artificial Intelligence
Characteristic formulae for processes with divergence
Information and Computation
Boosting the correspondence between description logics and propositional dynamic logics
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Handbook of Theoretical Computer Science
Handbook of Theoretical Computer Science
Communication and Concurrency
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The anchored version of the temporal framework
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Plan synthesis: a logical perspective
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Complexity results for planning
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
| Hi-index | 0.00 |
In this paper, we study reasoning about actions following a model checking approach in contrast to the usual validity checking one. Specifically, we model a dynamic system as a transition graph which represents all the possible system evolutions in terms of state changes caused by actions. Such a transition graph is defined by means of a suitable process algebra associated with an explicit global store. To reason about system properties we introduce an extension of modal µ-calculus. This setting, although directly applicable only when complete information on the system is available, has several interesting features for reasoning about actions. On one hand, it inherits from the vast literature on process algebras tools for dealing with complex systems, treating suitably important aspects like parallelism, communications, interruptions, coordinations among agents. On the other hand, reasoning by model checking is typically much easier than more general logical services such as validity checking.