Skip to main content
Conference Proceedings

Trace semantics for IPDL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9394 169-181
DOI: 10.1007/978-3-662-48561-3_14
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Other than relation semantics, IPDL, the extension of PDL with intersection of actions, has a natural trace semantics where the interpretation of an action is a set of sequences of states. IPDL in trace semantics can describe paced concurrent games very well. Surprisingly, IPDL can be reduced to a sublanguage of it in which intersection connects only atomic actions.

Author supplied keywords

Cite

CITATION STYLE

APA

Ju, F., Cui, N., & Li, S. (2015). Trace semantics for IPDL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9394, pp. 169–181). Springer Verlag. https://doi.org/10.1007/978-3-662-48561-3_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free