1,247 research outputs found
Model Checking Dynamic-Epistemic Spatial Logic
In this paper we focus on Dynamic Spatial Logic, the extension of Hennessy-Milner logic with the parallel operator. We develop a sound complete Hilbert-style axiomatic system for it comprehending the behavior of spatial operators in relation with dynamic/temporal ones. Underpining on a new congruence we define over the class of processes - the structural bisimulation - we prove the finite model property for this logic that provides the decidability for satisfiability, validity and model checking against process semantics. Eventualy we propose algorithms for validity, satisfiability and model checking
Modal logics are coalgebraic
Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts. Coalgebraic semantics, on the other hand, provides a uniform and encompassing view on the large variety of specific logics used in particular domains. The coalgebraic approach is generic and compositional: tools and techniques simultaneously apply to a large class of application areas and can moreover be combined in a modular way. In particular, this facilitates a pick-and-choose approach to domain specific formalisms, applicable across the entire scope of application areas, leading to generic software tools that are easier to design, to implement, and to maintain. This paper substantiates the authors' firm belief that the systematic exploitation of the coalgebraic nature of modal logic will not only have impact on the field of modal logic itself but also lead to significant progress in a number of areas within computer science, such as knowledge representation and concurrency/mobility
On Completeness of Cost Metrics and Meta-Search Algorithms in \$-Calculus
In the paper we define three new complexity classes for Turing Machine
undecidable problems inspired by the famous Cook/Levin's NP-complete complexity
class for intractable problems. These are U-complete (Universal complete),
D-complete (Diagonalization complete) and H-complete (Hypercomputation
complete) classes. We started the population process of these new classes. We
justify that some super-Turing models of computation, i.e., models going beyond
Turing machines, are tremendously expressive and they allow to accept arbitrary
languages over a given alphabet including those undecidable ones. We prove also
that one of such super-Turing models of computation -- the \$-Calculus,
designed as a tool for automatic problem solving and automatic programming, has
also such tremendous expressiveness. We investigate also completeness of cost
metrics and meta-search algorithms in \$-calculus
Session Communication and Integration
The scenario-based specification of a large distributed system is usually
naturally decomposed into various modules. The integration of specification
modules contrasts to the parallel composition of program components, and
includes various ways such as scenario concatenation, choice, and nesting. The
recent development of multiparty session types for process calculi provides
useful techniques to accommodate the protocol modularisation, by encoding
fragments of communication protocols in the usage of private channels for a
class of agents. In this paper, we extend forgoing session type theories by
enhancing the session integration mechanism. More specifically, we propose a
novel synchronous multiparty session type theory, in which sessions are
separated into the communicating and integrating levels. Communicating sessions
record the message-based communications between multiple agents, whilst
integrating sessions describe the integration of communicating ones. A
two-level session type system is developed for pi-calculus with syntactic
primitives for session establishment, and several key properties of the type
system are studied. Applying the theory to system description, we show that a
channel safety property and a session conformance property can be analysed.
Also, to improve the utility of the theory, a process slicing method is used to
help identify the violated sessions in the type checking.Comment: A short version of this paper is submitted for revie
Causal Dynamics of Discrete Surfaces
We formalize the intuitive idea of a labelled discrete surface which evolves
in time, subject to two natural constraints: the evolution does not propagate
information too fast; and it acts everywhere the same.Comment: In Proceedings DCM 2013, arXiv:1403.768
Towards a Notion of Distributed Time for Petri Nets
We set the ground for research on a timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. The novelty is that, rather than a single global clock, we use a set of unrelated clocks --- possibly one per place --- allowing a local timing as well as distributed time synchronisation. We give a formal definition of the model and investigate properties of local versus global timing, including decidability issues and notions of processes of the respective models
Some Notes on (Mem)Brane Computation
Membrane Computing and Brane Calculi are two recent computational
paradigms in the framework of Natural Computing. They are
based on the study of the structure and functioning of living cells as living
organisms able to process and generate information. In this paper we give
a short introduction to both areas and point out some open research lines.Ministerio de Educación y Ciencia TIN2005-09345-C04-01Junta de Andalucía TIC-58
- …