|
|
|
|
| LEADER |
03158nam a22005175i 4500 |
| 001 |
978-3-540-32870-4 |
| 003 |
DE-He213 |
| 005 |
20151204145145.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540328704
|9 978-3-540-32870-4
|
| 024 |
7 |
|
|a 10.1007/978-3-540-32870-4
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a TA1-2040
|
| 072 |
|
7 |
|a TBC
|2 bicssc
|
| 072 |
|
7 |
|a TEC000000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 620
|2 23
|
| 100 |
1 |
|
|a Penczek, Wojciech.
|e author.
|
| 245 |
1 |
0 |
|a Advances in Verification of Time Petri Nets and Timed Automata
|h [electronic resource] :
|b A Temporal Logic Approach /
|c by Wojciech Penczek, Agata Pólrola.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2006.
|
| 300 |
|
|
|a XXXII, 257 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Studies in Computational Intelligence,
|x 1860-949X ;
|v 20
|
| 505 |
0 |
|
|a Specifying Timed Systems and Their Properties -- Petri Nets with Time -- Timed Automata -- From Time Petri Nets to Timed Automata -- Main Formalisms for Expressing Temporal Properties -- Model Generation and Verification -- Abstract Models -- Explicit Verification -- Verification Based on Satisfiability Checking.
|
| 520 |
|
|
|a This monograph presents a comprehensive introduction to timed automata (TA) and time Petri nets (TPNs) which belong to the most widely used models of real-time systems. Some of the existing methods of translating time Petri nets to timed automata are presented, with a focus on the translations that correspond to the semantics of time Petri nets, associating clocks with various components of the nets. "Advances in Verification of Time Petri Nets and Timed Automata – A Temporal Logic Approach" introduces timed and untimed temporal specification languages and gives model abstraction methods based on state class approaches for TPNs and on partition refinement for TA. Moreover, the monograph presents a recent progress in the development of two model checking methods, based on either exploiting abstract state spaces or on application of SAT-based symbolic techniques. The book addresses research scientists as well as graduate and PhD students in computer science, logics, and engineering of real time systems.
|
| 650 |
|
0 |
|a Engineering.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Mathematics.
|
| 650 |
|
0 |
|a Applied mathematics.
|
| 650 |
|
0 |
|a Engineering mathematics.
|
| 650 |
1 |
4 |
|a Engineering.
|
| 650 |
2 |
4 |
|a Engineering, general.
|
| 650 |
2 |
4 |
|a Mathematics, general.
|
| 650 |
2 |
4 |
|a Appl.Mathematics/Computational Methods of Engineering.
|
| 650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
| 700 |
1 |
|
|a Pólrola, Agata.
|e author.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540328698
|
| 830 |
|
0 |
|a Studies in Computational Intelligence,
|x 1860-949X ;
|v 20
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-540-32870-4
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-ENG
|
| 950 |
|
|
|a Engineering (Springer-11647)
|
