Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Automatic theorem proving --- Logic, symbolic and mathematical --- Logic, Symbolic and mathematical --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Automated theorem proving --- Theorem proving, Automated --- Theorem proving, Automatic --- Artificial intelligence --- Proof theory --- Automatic theorem proving. --- Logic, Symbolic and mathematical. --- Computer science --- Informatique --- Théorèmes --- Démonstration automatique --- Logic Computation --- Symbolic Computation --- Mathematical Logic

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This monograph presents a well written and clearly organized introduction in the standard methods of discrete, continuous and hybrid Petri Nets. Starting from the basics of Petri nets the book imparts an accurate understanding of continuous and hybrid Petri Nets. Preserving the consistency of basic concepts throughout the text it introduces a unified framework for all the models presented. The book is a scientific monograph as well as a didactic tutorial which is easy to understand due to many exercises with solutions, detailed figures and several case studies. It demonstrates that Petri nets are a deep, practical and alive field important for researchers, engineers and graduate students in engineering and computer science.

Petri nets. --- Nets (Mathematics) --- Moore-Smith convergence --- Net equations --- Net methods (Mathematics) --- Convergence --- Set theory --- Topology --- Graph theory --- Information Technology --- Artificial Intelligence --- Réseaux de Pétri --- EPUB-LIV-FT SPRINGER-B LIVINGEN --- Artificial intelligence. --- Engineering mathematics. --- Computer science. --- Systems theory. --- Mathematics. --- Control, Robotics, Mechatronics. --- Artificial Intelligence. --- Mathematical and Computational Engineering. --- Mathematical Logic and Formal Languages. --- Systems Theory, Control. --- Applications of Mathematics. --- System theory. --- Math --- Science --- Informatics --- Engineering --- Engineering analysis --- Mathematical analysis --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Systems, Theory of --- Systems science --- Mathematics --- Philosophy --- Petri nets --- Control engineering. --- Robotics. --- Mechatronics. --- Applied mathematics. --- Mathematical logic. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Syllogism --- Mechanical engineering --- Microelectronics --- Microelectromechanical systems --- Automation --- Control engineering --- Control equipment --- Control theory --- Engineering instruments --- Programmable controllers

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Programming --- Mathematical logic --- Programming languages (Electronic computers) --- Logic, symbolic and mathematical --- Logic, Symbolic and mathematical --- 681.3*D3 --- 681.3*F31 --- 681.3*F41 --- 681.3*I2 --- Algebra of logic --- Logic, Universal --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Electronic data processing --- Languages, Artificial --- Programming languages --- Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Artificial intelligence. AI --- Logic, Symbolic and mathematical. --- Programming languages (Electronic computers). --- 681.3*I2 Artificial intelligence. AI --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F31 Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 681.3*D3 Programming languages --- Logic programming --- Specification --- proof --- Learning