000 | 03141nam a22005175i 4500 | ||
---|---|---|---|
001 | 978-3-540-32870-4 | ||
003 | DE-He213 | ||
005 | 20161121231118.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2006 gw | s |||| 0|eng d | ||
020 |
_a9783540328704 _9978-3-540-32870-4 |
||
024 | 7 |
_a10.1007/978-3-540-32870-4 _2doi |
|
050 | 4 | _aTA1-2040 | |
072 | 7 |
_aTBC _2bicssc |
|
072 | 7 |
_aTEC000000 _2bisacsh |
|
082 | 0 | 4 |
_a620 _223 |
100 | 1 |
_aPenczek, Wojciech. _eauthor. |
|
245 | 1 | 0 |
_aAdvances in Verification of Time Petri Nets and Timed Automata _h[electronic resource] : _bA Temporal Logic Approach / _cby Wojciech Penczek, Agata Pólrola. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006. |
|
300 |
_aXXXII, 257 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aStudies in Computational Intelligence, _x1860-949X ; _v20 |
|
505 | 0 | _aSpecifying 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 | _aThis 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 | _aEngineering. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aMathematics. | |
650 | 0 | _aApplied mathematics. | |
650 | 0 | _aEngineering mathematics. | |
650 | 1 | 4 | _aEngineering. |
650 | 2 | 4 | _aEngineering, general. |
650 | 2 | 4 | _aMathematics, general. |
650 | 2 | 4 | _aAppl.Mathematics/Computational Methods of Engineering. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
700 | 1 |
_aPólrola, Agata. _eauthor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540328698 |
830 | 0 |
_aStudies in Computational Intelligence, _x1860-949X ; _v20 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-540-32870-4 |
912 | _aZDB-2-ENG | ||
950 | _aEngineering (Springer-11647) | ||
999 |
_c508763 _d508763 |