SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "LAR1:uu ;srt2:(1975-1999)"

Sökning: LAR1:uu > (1975-1999)

  • Resultat 51-60 av 40053
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
51.
  • Abdulla, Parosh Aziz, et al. (författare)
  • On-the-fly analysis of systems with unbounded, lossy FIFO channels
  • 1998
  • Ingår i: Computer Aided Verification. - 9783540646082 - 9783540693390 ; , s. 305-318
  • Konferensbidrag (refereegranskat)abstract
    • We consider symbolic on-the-fly verification methods for systems of finite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels. We show that the class of languages representable by SREs is exactly the class of downward closed languages that arise in the analysis of such protocols. We give methods for (i) computing inclusion between SREs, (ii) an SRE representing the set of states reachable by executing a single transition in a system, and (iii) an SRE representing the set of states reachable by an arbitrary number of executions of a control loop of a program. All these operations are rather simple and can be carried out in polynomial time. With these techniques, one can construct a semi-algorithm which explores the set of reachable states of a protocol, in order to check various safety properties.
  •  
52.
  • Abdulla, Parosh Aziz, et al. (författare)
  • Simulation is decidable for one-counter nets
  • 1998
  • Ingår i: CONCUR'98 Concurrency Theory. - 9783540648963 - 9783540684558 ; , s. 253-268
  • Konferensbidrag (refereegranskat)abstract
    • We prove that the simulation preorder is decidable for the class of one-counter nets. A one-counter net consists of a finite-state machine operating on a variable (counter) which ranges over the natural numbers. Each transition can increase or decrease the value of the counter. A transition may not be performed if this implies that the value of the counter becomes negative. The class of one-counter nets is computationally equivalent to the class of Petri nets with one unbounded place, and to the class of pushdown automata where the stack alphabet is restricted to one symbol. To our knowledge, this is the first result in the literature which gives a positive answer to the decidability of simulation preorder between pairs of processes in a class whose elements are neither finite-state nor allow finite partitioning of their state spaces.
  •  
53.
  • Abdulla, Parosh Aziz, et al. (författare)
  • Symbolic verification of lossy channel systems : Application to the bounded retransmission protocol
  • 1999
  • Ingår i: Tools and Algorithms for the Construction and Analysis of Systems. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783540657033 - 9783540490593 ; , s. 208-222
  • Konferensbidrag (refereegranskat)abstract
    • We consider the problem of verifying automatically infinite- state systems that are systems of finite machines that communicate by exchanging messages through unbounded lossy fifo channels. In a previous work [1], we proposed an algorithmic approach based on constructing a symbolic representation of the set of reachable configurations of a system by means of a class of regular expressions (SREs). The construction of such a representation consists of an iterative computation with an acceleration technique which enhances the chance of convergence. This technique is based on the analysis of the effect of iterating control loops. In the work we present here, we experiment our approach and show how it can be effectively applied. For that, we developed a tool prototype based on the results in [1]. Using this tool, we provide an automatic verification of (the parameterized version of) the Bounded Retransmission Protocol.
  •  
54.
  • Abdulla, Parosh Aziz, et al. (författare)
  • Undecidable verification problems for programs with unreliable channels
  • 1996
  • Ingår i: Automata, Languages and Programming. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783540582014 - 9783540485667 ; , s. 71-90
  • Konferensbidrag (refereegranskat)abstract
    • We consider the verification of a particular class of infinite-state systems, namely systems consisting of finite-state processes that communicate via unbounded lossy FIFO channels. This class is able to model e.g. link protocols such as the Alternating Bit Protocol and HDLC. In an earlier paper, we showed that several interesting verification problems are decidable for this class of systems, namely (1) the reachability problem: is a set of states reachable from some other state of the system, (2) safety property over traces formulated as regular sets of allowed finite traces, and (3) eventuality properties: do all computations of a system eventually reach a given set of states. In this paper, we show that the following problems are undecidable, namelyThe model checking problem in propositional temporal logics such as Propositional Linear Time Logic (PTL) and Computation Tree Logic (CTL).The problem of deciding eventuality properties with fair channels: do all computations eventually reach a given set of states if the unreliable channels are fair in the sense that they deliver infinitely many messages if infinitely many messages are transmitted. This problem can model the question of whether a link protocol, such as HDLC, will eventually reliably transfer messages across a medium that is not permanently broken.The results are obtained through a reduction from a variant of Post's Correspondence Problem.
  •  
55.
  • Abdulla, Parosh Aziz, et al. (författare)
  • Verifying networks of timed processes
  • 1998
  • Ingår i: Tools and Algorithms for the Construction and Analysis of Systems. - 9783540643562 - 9783540697534 ; , s. 298-312
  • Konferensbidrag (refereegranskat)abstract
    • Over the last years there has been an increasing research effort directed towards the automatic verification of infinite state systems, such as timed automata, hybrid automata, data-independent systems, relational automata, Petri nets, and lossy channel systems. We present a method for deciding reachability properties of networks of timed processes. Such a network consists of an arbitrary set of identical timed automata, each with a single real-valued clock. Using a standard reduction from safety properties to reachability properties, we can use our algorithm to decide general safety properties of timed networks. To our knowledge, this is the first decidability result concerning verification of systems that are infinite-state in “two dimensions”: they contain an arbitrary set of (identical) processes, and they use infinite data-structures, viz. real-valued clocks. We illustrate our method by showing how it can be used to automatically verify Fischer's protocol, a timer-based protocol for enforcing mutual exclusion among an arbitrary number of processes.
  •  
56.
  •  
57.
  •  
58.
  • Abdulla, PA, et al. (författare)
  • Verifying programs with unreliable channels
  • 1996
  • Ingår i: Information and Computation. - : Elsevier BV. - 0890-5401. ; 127:2, s. 91-101
  • Tidskriftsartikel (refereegranskat)abstract
    • We consider the verification of a particular class of infinite-state systems, namely systems consisting of finite-state processes that communicate via unbounded lossy FIFO channels. This class is able to model, e.g., link protocols such as the Alternating
  •  
59.
  •  
60.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 51-60 av 40053
Typ av publikation
tidskriftsartikel (21046)
doktorsavhandling (4157)
bokkapitel (3626)
recension (2352)
annan publikation (2230)
konferensbidrag (1978)
visa fler...
bok (1858)
rapport (1589)
samlingsverk (redaktörskap) (722)
licentiatavhandling (249)
proceedings (redaktörskap) (143)
forskningsöversikt (88)
patent (15)
konstnärligt arbete (1)
visa färre...
Typ av innehåll
övrigt vetenskapligt/konstnärligt (22524)
refereegranskat (15989)
populärvet., debatt m.m. (1536)
Författare/redaktör
Smedby, B (169)
Johansson, B (159)
Berg, Sören (159)
Gerdin, Bengt, 1947- (144)
Bergqvist, David (143)
Nordblad, P (143)
visa fler...
Engwall, Lars (138)
Wittrock, Ulf (126)
Adam, W. (119)
Andreazza, A. (118)
Adye, T. (117)
Amaldi, U. (117)
Antilogus, P. (117)
Allport, PP (117)
Apel, WD (117)
Alekseev, GD (117)
Almehed, S (116)
Karlsson, Thomas (115)
Abreu, P. (111)
Amato, S. (111)
Asman, B. (109)
Frängsmyr, Tore (109)
Nilsson, S. (105)
Arnoud, Y. (102)
Tornstam, Lars (101)
Augustin, JE (99)
Bäckström, Anders, 1 ... (99)
Stenström, Thure, 19 ... (99)
Augustinus, A. (97)
Langstrom, B (97)
Schalk, Peter (96)
Baillon, P. (95)
Bambade, P. (91)
Saldeen, T. (90)
Ajinenko, I (88)
Ekström, Anders, 196 ... (87)
Stoica, P (87)
Eriksson, O (87)
Alemany, R (86)
Bergstrom, R (85)
Glimelius, B (85)
Åkerström, Göran (84)
Tove, PA (80)
Wittrock, Björn (79)
Stepinski, T (78)
Burns, Tom R. (77)
Svedlindh, P (76)
Larsson, A (75)
Johanson, Jan (74)
Pahlman, L (74)
visa färre...
Lärosäte
Uppsala universitet (40053)
Karolinska Institutet (792)
Linköpings universitet (98)
Stockholms universitet (82)
Luleå tekniska universitet (66)
Umeå universitet (65)
visa fler...
Lunds universitet (62)
Mittuniversitetet (51)
Kungliga Tekniska Högskolan (47)
Karlstads universitet (45)
Linnéuniversitetet (43)
Högskolan i Gävle (38)
Södertörns högskola (38)
Göteborgs universitet (31)
Högskolan Dalarna (27)
Mälardalens universitet (25)
Jönköping University (24)
Örebro universitet (23)
Chalmers tekniska högskola (10)
Riksantikvarieämbetet (9)
Nordiska Afrikainstitutet (7)
Marie Cederschiöld högskola (6)
RISE (5)
VTI - Statens väg- och transportforskningsinstitut (3)
Institutet för språk och folkminnen (3)
Högskolan i Skövde (2)
Försvarshögskolan (2)
Nationalmuseum (1)
Högskolan i Halmstad (1)
Högskolan Väst (1)
Handelshögskolan i Stockholm (1)
Gymnastik- och idrottshögskolan (1)
Högskolan i Borås (1)
Röda Korsets Högskola (1)
Enskilda Högskolan Stockholm (1)
visa färre...
Språk
Engelska (33014)
Svenska (6201)
Odefinierat språk (214)
Tyska (205)
Franska (117)
Danska (58)
visa fler...
Ryska (41)
Polska (32)
Norska (31)
Nederländska (30)
Spanska (26)
Italienska (15)
Latin (8)
Estniska (8)
Bulgariska (8)
Esperanto (7)
Isländska (6)
Slovakiska (5)
Finska (4)
Kinesiska (4)
Arabiska (3)
Portugisiska (2)
Persiska (2)
Kurdiska (2)
Ukrainska (2)
Tjeckiska (1)
Ungerska (1)
Rumänska (1)
Japanska (1)
Lettiska (1)
Serbiska (1)
Katalanska (1)
Bokmål (1)
visa färre...
Forskningsämne (UKÄ/SCB)
Humaniora (6093)
Samhällsvetenskap (3194)
Naturvetenskap (2852)
Medicin och hälsovetenskap (1477)
Teknik (353)
Lantbruksvetenskap (94)

År

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