|
|
|
|
| LEADER |
04263nmm a2200409 u 4500 |
| 001 |
EB000390022 |
| 003 |
EBX01000000000000000243075 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9783642323324
|
| 100 |
1 |
|
|a Furia, Carlo A.
|
| 245 |
0 |
0 |
|a Modeling Time in Computing
|h Elektronische Ressource
|c by Carlo A. Furia, Dino Mandrioli, Angelo Morzenti, Matteo Rossi
|
| 250 |
|
|
|a 1st ed. 2012
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2012, 2012
|
| 300 |
|
|
|a XVI, 424 p
|b online resource
|
| 505 |
0 |
|
|a Chap. 1 It's About Time -- Chap. 2 Languages and Interpretations -- Chap. 3 Dimensions of the Time Modeling Problem -- Chap. 4 Dynamical Systems -- Chap. 5 Time in Hardware Modeling and Design -- Chap. 6 Time in the Analysis of Algorithms -- Chap. 7 Synchronous Abstract Machines -- Chap. 8 Asynchronous Abstract Machines: Petri Nets -- Chap. 9 Logic-Based Formalisms -- Chap. 10 Algebraic Formalisms -- Chap. 11 Dual-Language Approaches -- Chap. 12 Time Is up -- References -- Index
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Mathematics of Computing
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Computers
|
| 653 |
|
|
|a Computer Hardware
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Mandrioli, Dino
|e [author]
|
| 700 |
1 |
|
|a Morzenti, Angelo
|e [author]
|
| 700 |
1 |
|
|a Rossi, Matteo
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Monographs in Theoretical Computer Science. An EATCS Series
|
| 028 |
5 |
0 |
|a 10.1007/978-3-642-32332-4
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-32332-4?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a Part I is a summary of the models that are traditional in engineering and the natural sciences, including fundamental computer science: dynamical systems and control theory; hardware design; and software algorithmic and complexity analysis. Part II covers advanced and specialized formalisms dealing with time modeling in heterogeneous software-intensive systems: formalisms that share finite state machines as common “ancestors”; Petri nets in many variants; notations based on mathematical logic, such as temporal logic; process algebras; and “dual-language approaches” combining two notations with different characteristics to model and verify complex systems, e.g., model-checking frameworks. Finally, the book concludes with summarizing remarks and hints towards future developments and open challenges.
|
| 520 |
|
|
|a Models that include a notion of time are ubiquitous in disciplines such as the natural sciences, engineering, philosophy, and linguistics, but in computing the abstractions provided by the traditional models are problematic and the discipline has spawned many novel models. This book is a systematic thorough presentation of the results of several decades of research on developing, analyzing, and applying time models to computing and engineering. After an opening motivation introducing the topics, structure and goals, the authors introduce the notions of formalism and model in general terms along with some of their fundamental classification criteria. In doing so they present the fundamentals of propositional and predicate logic, and essential issues that arise when modeling time across all types of system.
|
| 520 |
|
|
|a The presentation uses a rigorous, yet not overly technical, style, appropriate for readers with heterogeneous backgrounds, and each chapter is supplemented with detailed bibliographic remarks and carefully chosen exercises of varying difficulty and scope. The book is aimed at graduate students and researchers in computer science, whileresearchers and practitioners in other scientific and engineering disciplines interested in time modeling with a computational flavor will also find the book of value, and the comparative and conceptual approach makes this a valuable introduction for non-experts. The authors assume a basic knowledge of calculus, probability theory, algorithms, and programming, while a more advanced knowledge of automata, formal languages, and mathematical logic is useful
|