Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems
Work
Year: 2013
Type: article
Abstract: The model checking problem for propositional dynamic logic (PDL) over message sequence charts (MSCs) and communicating finite state machines (CFMs) asks, given a channel bound $B$, a PDL formula $\var... more
Author Roy Mennicke
Institution Technische Universität Ilmenau
Cites: 28
Cited by: 5
Related to: 10
FWCI: 0.285
Citation percentile (by year/subfield): 70.6
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond