SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "L773:1236 6064 "

Sökning: L773:1236 6064

  • Resultat 1-10 av 17
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Abdulla, Parosh Aziz, et al. (författare)
  • Using Forward Reachability Analysis for Verification of Timed Petri Nets
  • 2007
  • Ingår i: Nordic Journal of Computing. - 1236-6064. ; 14:1, s. 1-42
  • Tidskriftsartikel (refereegranskat)abstract
    • We consider verification of safety properties for concurrent real-timed systems modelled as timed Petri nets by performing symbolic forward reachability analysis. We introduce a formalism, called region generators, for representing sets of markings of timed Petri nets. Region generators characterize downward closed sets of regions and provide exact abstractions of sets of reachable states with respect to safety properties. We show that the standard operations needed for performing symbolic reachability analysis are computable for region generators. Since forward reachability analysis is necessarily incomplete, we introduce an acceleration technique to make the procedure terminate more often on practical examples. We have implemented a prototype for analyzing timed Petri nets and used it to verify a parameterized version of Fischer's protocol, Lynch and Shavit's mutual exclusion protocol and a producer-consumer protocol. We also used the tool to extract finite-state abstractions of these protocols.
  •  
2.
  • Amnell, Tobias, et al. (författare)
  • Code Synthesis for Timed Automata
  • 2002
  • Ingår i: Nordic Journal of Computing. - 1236-6064. ; 9:4, s. 269-300
  • Tidskriftsartikel (refereegranskat)
  •  
3.
  •  
4.
  •  
5.
  •  
6.
  • Bosch, Jan (författare)
  • Delegating Compiler Objects : Modularity and Resuability in Language Engineering
  • 1997
  • Ingår i: Nordic Journal of Computing. - Helsinki : Nordic Journal of Computing. - 1236-6064. ; 4:1, s. 66-92
  • Tidskriftsartikel (refereegranskat)abstract
    • The application domain of compiler techniques is changing. Whereas previously compiler techniques were primarily used for the construction of compilers for general-purpose languages, now these techniques are increasingly often used for the construction of application domain languages and extensible language models. However, the traditional compiler techniques suffer from problems of complexity, maintainability, reusability and extensibility, and new approaches are needed. In this paper, we describe the notion of delegating compiler objects (DCOs), a novel approach to compiler construction that provides structural decomposition and reusability of compiler specifications. Our extensible language, the layered object model, is used to illustrate the advantages of the DCO approach for compiler construction.
  •  
7.
  •  
8.
  •  
9.
  • Hammar, Mikael, et al. (författare)
  • Improved Exploration of Rectilinear Polygons
  • 2002
  • Ingår i: Nordic Journal of Computing. - 1236-6064. ; 9:1, s. 32-53
  • Tidskriftsartikel (refereegranskat)abstract
    • We prove a 5/3-competitive strategy for exploring a simple rectilinear polygon in the $L_1$ metric. This improves the previous factor two bound of Deng, Kameda and Papadimitriou.
  •  
10.
  • Jonsson B, Margaria T, Naeser G, Nyström J, Steffen B (författare)
  • Incremental Requirement Specification for Evolving Systems
  • 2001
  • Ingår i: Nordic Journal of Computing. - 1236-6064. ; 8:1, s. 65-87
  • Tidskriftsartikel (refereegranskat)abstract
    • We propose a technique for hierarchically structuring requirement specifications in a way that simplifies change management. Our technique decomposes the process of requirement specification and validation. Specifications, added or modified incrementally
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 17

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy