Author:
Goltz Ursula,Kuiper Ruurd,Penczek Wojciech
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Boudol, G., Castellani, I., On the Semantics of Concurrency: Partial Orders and Transition Systems, Proc. of TAPSOFT 87, LNCS 249, 123–137, 1987.
2. Browne, M.C., Clarke, B.M., and Grumberg, O., Characterizing Finite Kripke Structures in Propositional Temporal Logic, TCS 59 (1,2), 115–131, 1988.
3. Clarke, E.M., Emerson, E.A., Sistla, A.P., Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach, Proc. 10th Annual ACM Symp. on Principles of Programming Languages, Austin, 117–126, 1983.
4. Emerson, E.A., Halpern, J.Y., Sometimes and “Not Never” Revisited: On Branching versus Linear Time Temporal Logic, Journal of the ACM 33 (1), 151–178, 1986.
5. Glabbeek, R. van. and Goltz, U.: Equivalence Notions for Concurrent Systems and Refinement of Actions, LNCS 379, pp. 237–248, 1989.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Hennessy-Milner Theorem for ATL with Imperfect Information;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
2. Simulations for Multi-Agent Systems with Imperfect Information;Formal Methods and Software Engineering;2019
3. Deriving Inverse Operators for Modal Logic;Theoretical Aspects of Computing – ICTAC 2016;2016
4. Event Identifier Logic;Mathematical Structures in Computer Science;2013-09-27
5. Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets;Transactions on Petri Nets and Other Models of Concurrency VIII;2013