Model construction for implicit specifications in modal logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 715 LNCS, Issue , 1993, Pages 247-261

  Jensen, Ole Hgh ^a   Jeppesen, Christian ^a   Lang, Jarl Tuxen ^a   Larsen, Kim Guldstrand ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS;

HENNESSY-MILNER LOGICS; LABELLED TRANSITION SYSTEMS; MODEL CONSTRUCTION; PROCESS ALGEBRAS; PROTOTYPE TOOLS; REACTIVE SYSTEM; SEMI-AUTOMATICS; TOP DOWN DESIGN;

COMPUTER CIRCUITS;

EID: 85028067549     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57208-2_18     Document Type: Conference Paper

References (23)

1. H. R. Andersen and G. Winskel. Compositional Checking of Satisfaction. In CAV ‘91, Springer LNCS 575, 1991.
2. E. M. Clarke and E. A. Emerson. Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. In Logics of Programs, Springer LNCS 131, 1981.
3. R. Cleaveland. Tableau-Based Model Checking in the Prepositional μ-Calculus. Acta Informatica, 27, 1990.
4. R. Cleaveland and B. Steffen. Computing Behavioural Relations, Logically. In ICALP ‘91, Springer LNCS 510, 1991.
5. E. A. Emerson and C.-L. Lei. Efficient Model Checking in Fragments of the Prepositional μ-Calculus. In LICS ‘86, 1986.
6. M. Hennessy and R. Milner. Algebraic Laws for Nondeterminism and Concurrency. J. ACM, 1985.
7. O. H. Jensen, C. Jeppesen, and J. T. Lang. Model Construction for Hybrid Implicit Specifications. Master's thesis, Aalborg University, Denmark, 1993. To be available as tech. report.
8. B. Jonsson and K. G. Larsen. On the Complexity of Equation Solving in Process Algebra. In TAPSOFT ‘91, Springer LNCS 494, 1991.
9. D. Kozen. Results on the Prepositional μ-Calculus. In ICALP ‘82, Springer LNCS 140, 1982.
10. K. G. Larsen. Context-Dependent Bisimulation Between Processes. PhD thesis, University of Edinburgh, Scotland, 1986.
11. K. G. Larsen. Proof Systems for Satisfiability in Hennesy-Milner Logic With Recursion. Theoretical Comput. Sci., 72, 1990.
12. K. G. Larsen and X. Liu. Equation Solving Using Modal Transition Systems. In LICS ‘90, 1990.
13. K. G. Larsen and X. Liu. Compositionality Through an Operational Semantics of Contexts. J. Logic Computat., 1(6), 1991.
14. R. Milner. Communication and Concurrency. Prentice-Hall Int., 1989.
15. Z. Manna and P. Wolper. Synthesis of Communicationg Processes from Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 6(1), 1984.
16. R. D. Nicola and F. Vaandrager. Three Logics for Branching Bisimulation. In LICS ‘90, 1990.
17. D. Park. Concurrency and Automata on Infinite Sequences. Springer LNCS 104, 1981.
18. J. Parrow. Submodule Construction as Equation Solving in CCS. Theoretical Comput. Sci., 68, 1989.
19. H. Qin and P. Lewis. Factorization of Finite State Machines under Observational Equivalence. In CONCUR ‘90, Springer LNCS 458, 1990.
20. M. W. Shields. Implicit System Specification and the Interface Equation. The Computer Journal, 32(5), 1989.
21. B. Steffen. Characteristic Formulae. In ICALP ‘89, Springer LNCS 372, 1989.
22. C. Stirling and D. Walker. Local Model Checking in the Modal μ-Calculus. Theoretical Comput. Sci., 89, 1991.
23. G. Winskel. A Note on Model Checking the Modal ν-Calculus. In ICALP ‘89, Springer LNCS 372, 1989.