Propositional dynamic logics for communicating concurrent programs with CCS's parallel operator

@article{Benevides2014PropositionalDL,
  title={Propositional dynamic logics for communicating concurrent programs with CCS's parallel operator},
  author={M. Benevides and L. Menasch{\'e} Schechter},
  journal={J. Log. Comput.},
  year={2014},
  volume={24},
  pages={919-951}
}
This work presents three increasingly expressive Dynamic Logics in which the programs are described in a language based on CCS. Our goal is to build dynamic logics that are suitable for the description and verification of properties of communicating concurrent systems, in a similar way as PDL is used for the sequential case. In order to accomplish that, CCS’s operators and constructions are added to a basic modal logic. Doing this, the semantics of CCS’s parallel operator allows us to build… 

Figures and Tables from this paper

Dynamic logic of parallel propositional assignments and its applications to planning

A dynamic logic with parallel composition and two kinds of nondeterministic composition, exclusive and inclusive is introduced and PSPACE completeness of both the model checking and the satisfiability problem is shown.

SymPaths: Symbolic Execution Meets Partial Order Reduction

This paper provides formal justifications for symbolic execution in a multithreaded setting by proving the correctness and completeness of symbolic execution for multith readed shared variable programs, with and without the use of partial order reduction.

Deductive Software Verification: Future Perspectives: Reflections on the Occasion of 20 Years of KeY

This paper describes the story of the first nine years of the KeY project, its original goals, the people involved, its setbacks, but also its occasional failures and blind alleys. It is deliberately

References

SHOWING 1-10 OF 31 REFERENCES

Parallel action: Concurrent dynamic logic with independent modalities

The logic defined by this modelling is finitely axiomatisable and has the finite model property, hence is decidable, and requires the development a new theory of canonical models and filtrations for “reachability” relations.

Concurrent dynamic logic

This paper investigates extensions of dynamic logic tailored towards handling concurrent programs, with or without communication, and finds that both respects are dominated by the extent to which the capabilities of synchronization and (unbounded) counting are enabled in the system.

The Complexity of PDL with Interleaving

Propositional dynamic logic with recursive programs

Modal Logics for Mobile Processes

Propositional Dynamic Logic of Regular Programs

Dynamic epistemic logic

A semantics and a deduction system for a multi-agent modal language extended with a repertoire of programs that describe information change, designed in such a way that everything that is expressible in the object language can be known or learned by each of the agents.

Deciding properties of nonregular programs

  • D. HarelD. Raz
  • Computer Science
    Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
  • 1990
It is shown that the emptiness problem for stack automata on infinite trees is decidable, a result of independent interest, and the result is combined with the construction of certain tree models for the corresponding formulas.

On the Decidability of Process Equivalences for the pi-calculus

We present general results for showing process equivalences applied to the finite control fragment of the pi-calculus decidable. Firstly a Finite Reachability Theorem states that up to finite name