A multiprocess network logic with temporal and spatial modalities
Journal of Computer and System Sciences
The stable marriage problem: structure and algorithms
The stable marriage problem: structure and algorithms
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic Logic
Monodic fragments of first-order temporal logics: 2000-2001 A.D
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Static Analysis Technique for Graph Transformation Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Model Checking Birth and Death
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
TQL: a query language for semistructured data based on the ambient logic
Mathematical Structures in Computer Science
Structured coalgebras and minimal HD-automata for the π-calculus
Theoretical Computer Science - Mathematical foundations of computer science 2000
Expressiveness and complexity of graph logic
Information and Computation
The Temporal Logic of Rewriting: A Gentle Introduction
Concurrency, Graphs and Models
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Propositional Dynamic Logic with Program Quantifiers
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewriting Logic Semantics and Verification of Model Transformations
FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
A Logic for Application Level QoS
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Manipulating trees with hidden labels
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
A temporal graph logic for verification of graph transformation systems
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Towards model checking spatial properties with SPIN
Proceedings of the 14th international SPIN conference on Model checking software
Graphical encoding of a spatial logic for the π-calculus
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
The linear temporal logic of rewriting Maude model checker
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
A dynamic logic for termgraph rewriting
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Counterpart semantics for a second-order µ-calculus
ICGT'10 Proceedings of the 5th international conference on Graph transformations
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Model checking quantified computation tree logic
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Static BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Exploiting over- and under-approximations for infinite-state counterpart models
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Specification and verification of modal properties for structured systems
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
Quantified μ-calculi combine the fix-point and modal operators of temporal logics with (existential and universal) quantifiers, and they allow for reasoning about the possible behaviour of individual components within a software system. In this paper we introduce a novel approach to the semantics of such calculi: we consider a sort of labeled transition systems called counterpart models as semantic domain, where states are algebras and transitions are defined by counterpart relations (a family of partial homomorphisms) between states. Then, formulae are interpreted over sets of state assignments (families of partial substitutions, associating formula variables to state components). Our proposal allows us to model and reason about the creation and deletion of components, as well as the merging of components. Moreover, it avoids the limitations of existing approaches, usually enforcing restrictions of the transition relation: the resulting semantics is a streamlined and intuitively appealing one, yet it is general enough to cover most of the alternative proposals we are aware of. The paper is rounded up with some considerations about expressiveness and decidability aspects.