Petri Nets and Other Models of Concurrency - ICATPN 2007 [[electronic resource] ] : 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, Proceedings / / edited by Jetty Kleijn, Alex Yakovlev |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
Descrizione fisica | 1 online resource (524 p.) |
Disciplina | 511.35 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Computer science—Mathematics Discrete mathematics Computer networks Microprocessors Computer architecture Operating systems (Computers) Theory of Computation Software Engineering Discrete Mathematics in Computer Science Computer Communication Networks Processor Architectures Operating Systems |
ISBN | 3-540-73094-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Petri Nets, Discrete Physics, and Distributed Quantum Computation -- Autonomous Distributed System and Its Realization by Multi Agent Nets -- Petri Nets Without Tokens -- Toward Specifications for Reconfigurable Component Systems -- Generating Petri Net State Spaces -- Full Papers -- Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms -- Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets -- Improving Static Variable Orders Via Invariants -- Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems -- From Many Places to Few: Automatic Abstraction Refinement for Petri Nets -- A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms -- History-Dependent Petri Nets -- Complete Process Semantics for Inhibitor Nets -- Behaviour-Preserving Transition Insertions in Unfolding Prefixes -- Combining Decomposition and Unfolding for STG Synthesis -- Object Nets for Mobility -- Web Service Orchestration with Super-Dual Object Nets -- Synthesis of Elementary Net Systems with Context Arcs and Localities -- Nets with Tokens Which Carry Data -- Operating Guidelines for Finite-State Services -- Theory of Regions for the Synthesis of Inhibitor Nets from Scenarios -- Utilizing Fuzzy Petri Net for Choreography Based Semantic Web Services Discovery -- Formal Models for Multicast Traffic in Network on Chip Architectures with Compositional High-Level Petri Nets -- Name Creation vs. Replication in Petri Net Systems -- Modelling the Datagram Congestion Control Protocol’s Connection Management and Synchronization Procedures -- The ComBack Method – Extending Hash Compaction with Backtracking -- Computing Minimal Elements of Upward-Closed Sets for Petri Nets -- Tool Papers -- ProM 4.0: Comprehensive Support for Real Process Analysis -- dmcG: A Distributed Symbolic Model Checker Based on GreatSPN -- Workcraft: A Static Data Flow Structure Editing, Visualisation and Analysis Tool. |
Record Nr. | UNISA-996466264303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Petri Nets and Other Models of Concurrency - ICATPN 2007 [[electronic resource] ] : 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, Proceedings / / edited by Jetty Kleijn, Alex Yakovlev |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
Descrizione fisica | 1 online resource (524 p.) |
Disciplina | 511.35 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Computer science—Mathematics Discrete mathematics Computer networks Microprocessors Computer architecture Operating systems (Computers) Theory of Computation Software Engineering Discrete Mathematics in Computer Science Computer Communication Networks Processor Architectures Operating Systems |
ISBN | 3-540-73094-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Petri Nets, Discrete Physics, and Distributed Quantum Computation -- Autonomous Distributed System and Its Realization by Multi Agent Nets -- Petri Nets Without Tokens -- Toward Specifications for Reconfigurable Component Systems -- Generating Petri Net State Spaces -- Full Papers -- Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms -- Comparison of the Expressiveness of Arc, Place and Transition Time Petri Nets -- Improving Static Variable Orders Via Invariants -- Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems -- From Many Places to Few: Automatic Abstraction Refinement for Petri Nets -- A Compositional Method for the Synthesis of Asynchronous Communication Mechanisms -- History-Dependent Petri Nets -- Complete Process Semantics for Inhibitor Nets -- Behaviour-Preserving Transition Insertions in Unfolding Prefixes -- Combining Decomposition and Unfolding for STG Synthesis -- Object Nets for Mobility -- Web Service Orchestration with Super-Dual Object Nets -- Synthesis of Elementary Net Systems with Context Arcs and Localities -- Nets with Tokens Which Carry Data -- Operating Guidelines for Finite-State Services -- Theory of Regions for the Synthesis of Inhibitor Nets from Scenarios -- Utilizing Fuzzy Petri Net for Choreography Based Semantic Web Services Discovery -- Formal Models for Multicast Traffic in Network on Chip Architectures with Compositional High-Level Petri Nets -- Name Creation vs. Replication in Petri Net Systems -- Modelling the Datagram Congestion Control Protocol’s Connection Management and Synchronization Procedures -- The ComBack Method – Extending Hash Compaction with Backtracking -- Computing Minimal Elements of Upward-Closed Sets for Petri Nets -- Tool Papers -- ProM 4.0: Comprehensive Support for Real Process Analysis -- dmcG: A Distributed Symbolic Model Checker Based on GreatSPN -- Workcraft: A Static Data Flow Structure Editing, Visualisation and Analysis Tool. |
Record Nr. | UNINA-9910484838503321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Probabilistic Cellular Automata [[electronic resource] ] : Theory, Applications and Future Perspectives / / edited by Pierre-Yves Louis, Francesca R. Nardi |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (350 pages) : illustrations |
Disciplina | 511.35 |
Collana | Emergence, Complexity and Computation |
Soggetto topico |
Probabilities
Computational complexity Biomathematics Statistics Bioinformatics Computational biology Mathematical statistics Probability Theory and Stochastic Processes Complexity Mathematical and Computational Biology Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Sciences Computer Appl. in Life Sciences Probability and Statistics in Computer Science |
ISBN | 3-319-65558-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Preface -- Acknowledgements -- 1 Overview: PCA models and issues -- 2 Probabilistic Cellular Automata in Art.- Part I Probability and statistical mechanics -- 3 Basic ideas to approach metastability in Probabilistic Cellular Automata -- 4 Strategic Interaction in Interacting Particle Systems -- 5 Scaling and inverse scaling in anisotropic bootstrap percolation -- 6 The sandpile cellular automaton -- 7 Ising Model on the Torus and PCA Dynamics: reversibility, irreversibility, and fast tunneling -- 8 Synchronization in Interacting Reinforced Stochastic Processes -- 9 Nonequilibrium physics aspects of Probabilistic Cellular Automata.- Part II Computer science and discrete dynamical systems -- 10 An example of computation of the density of ones in Probabilistic Cellular Automata by direct recursion -- 11 Statistical equilibrium in deterministic Cellular Automata -- 12 Epidemic automaton and the Eden model: various aspects of robustness -- 13 Convergence time of Probabilistic Cellular Automata on the torus -- 14 Percolation operators and related models -- 15 Phase transitions of Cellular Automata.- Part III Applications to natural sciences and computational (cell) biology -- 16 A trade-off between simplicity and robustness? Illustration on a lattice-gas model of swarming -- 17 PCA modelling of multi-species cell clusters: ganglion development in the gastrointestinal nervous system -- 18 Cellular Potts model: applications to vasculogenesis and angiogenesis -- 19 Cellular Potts Models for interacting cell populations: mathematical foundation, challenges and future prospects -- 20 Cellular Automata for clouds and convection.- Participants of the 2013 Eindhoven meeting. |
Record Nr. | UNINA-9910299959303321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Quantum cellular automata [[electronic resource] ] : theory, experimentation and prospects / / Massimo Macucci, editor |
Pubbl/distr/stampa | London, : Imperial College Press, c2006 |
Descrizione fisica | 1 online resource (xiii, 284 p. ) : ill |
Disciplina | 511.35 |
Altri autori (Persone) | MacucciMassimo |
Soggetto topico |
Cellular automata
Sequential machine theory |
Soggetto genere / forma | Electronic books. |
ISBN |
1-281-86720-9
9786611867201 1-86094-906-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 1. The concept of quantum-dot cellular automata / C. S. Lent -- 2. QCA simulation with the occupation-number Hamiltonian / M. Macucci and M. Governale -- 3. Realistic time-independent models of a QCA cell / J. Martorell ... [et al.] -- 4. Time-independent simulation of QCA circuits / L. Bonci ... [et al.] -- 5. Simulation of the time-dependent behavior of QCA circuits with the occupation-number Hamiltonian / I. Yakimenko and K.-F. Berggren -- 6. Time-dependent analysis of QCA circuits with the Monte Carlo method / L. Bonci ... [et al.] -- 7. Implementation of QCA cells with SOI technology / F. E. Prins ... [et al.] -- 8. Implementation of QCA cells in GaAs technology / Y. Jin ... [et al.] -- 9. Non-invasive charge detectors / G. Iannaccone ... [et al.] -- 10. Metal dot QCA / G. L. Snider, A. O. Orlov, and R. K. Kummamuru -- 11. Molecular QCA / C. S. Lent -- 12. Magnetic quantum-dot cellular automata (MQCA) / A. Imre ... [et al.] -- 13. Final remarks and future perspectives / M. Macucci. |
Record Nr. | UNINA-9910451544103321 |
London, : Imperial College Press, c2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Quantum cellular automata : theory, experimentation and prospects / Massimo Macucci (ed.) |
Pubbl/distr/stampa | London : Imperial College Press |
Descrizione fisica | xiii, 284 : ill. ; 24 cm |
Disciplina | 511.35 |
Altri autori (Persone) | Macucci, Massimoauthor |
Soggetto topico | Cellular automata |
ISBN | 1860946321 |
Classificazione |
LC QA267.5.C45
53.1.4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISALENTO-991002060629707536 |
London : Imperial College Press | ||
Materiale a stampa | ||
Lo trovi qui: Univ. del Salento | ||
|
Quantum cellular automata [[electronic resource] ] : theory, experimentation and prospects / / Massimo Macucci, editor |
Pubbl/distr/stampa | London, : Imperial College Press, c2006 |
Descrizione fisica | 1 online resource (xiii, 284 p. ) : ill |
Disciplina | 511.35 |
Altri autori (Persone) | MacucciMassimo |
Soggetto topico |
Cellular automata
Sequential machine theory |
ISBN |
1-281-86720-9
9786611867201 1-86094-906-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 1. The concept of quantum-dot cellular automata / C. S. Lent -- 2. QCA simulation with the occupation-number Hamiltonian / M. Macucci and M. Governale -- 3. Realistic time-independent models of a QCA cell / J. Martorell ... [et al.] -- 4. Time-independent simulation of QCA circuits / L. Bonci ... [et al.] -- 5. Simulation of the time-dependent behavior of QCA circuits with the occupation-number Hamiltonian / I. Yakimenko and K.-F. Berggren -- 6. Time-dependent analysis of QCA circuits with the Monte Carlo method / L. Bonci ... [et al.] -- 7. Implementation of QCA cells with SOI technology / F. E. Prins ... [et al.] -- 8. Implementation of QCA cells in GaAs technology / Y. Jin ... [et al.] -- 9. Non-invasive charge detectors / G. Iannaccone ... [et al.] -- 10. Metal dot QCA / G. L. Snider, A. O. Orlov, and R. K. Kummamuru -- 11. Molecular QCA / C. S. Lent -- 12. Magnetic quantum-dot cellular automata (MQCA) / A. Imre ... [et al.] -- 13. Final remarks and future perspectives / M. Macucci. |
Record Nr. | UNINA-9910784974203321 |
London, : Imperial College Press, c2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Quantum cellular automata [[electronic resource] ] : theory, experimentation and prospects / / Massimo Macucci, editor |
Pubbl/distr/stampa | London, : Imperial College Press, c2006 |
Descrizione fisica | 1 online resource (xiii, 284 p. ) : ill |
Disciplina | 511.35 |
Altri autori (Persone) | MacucciMassimo |
Soggetto topico |
Cellular automata
Sequential machine theory |
ISBN |
1-281-86720-9
9786611867201 1-86094-906-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 1. The concept of quantum-dot cellular automata / C. S. Lent -- 2. QCA simulation with the occupation-number Hamiltonian / M. Macucci and M. Governale -- 3. Realistic time-independent models of a QCA cell / J. Martorell ... [et al.] -- 4. Time-independent simulation of QCA circuits / L. Bonci ... [et al.] -- 5. Simulation of the time-dependent behavior of QCA circuits with the occupation-number Hamiltonian / I. Yakimenko and K.-F. Berggren -- 6. Time-dependent analysis of QCA circuits with the Monte Carlo method / L. Bonci ... [et al.] -- 7. Implementation of QCA cells with SOI technology / F. E. Prins ... [et al.] -- 8. Implementation of QCA cells in GaAs technology / Y. Jin ... [et al.] -- 9. Non-invasive charge detectors / G. Iannaccone ... [et al.] -- 10. Metal dot QCA / G. L. Snider, A. O. Orlov, and R. K. Kummamuru -- 11. Molecular QCA / C. S. Lent -- 12. Magnetic quantum-dot cellular automata (MQCA) / A. Imre ... [et al.] -- 13. Final remarks and future perspectives / M. Macucci. |
Record Nr. | UNINA-9910823754803321 |
London, : Imperial College Press, c2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Reachability Problems [[electronic resource] ] : 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings / / edited by Antonin Kucera, Igor Potapov |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (X, 199 p. 42 illus.) |
Disciplina | 511.35 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Software engineering Compilers (Computer programs) Computer science Machine theory Programming Techniques Software Engineering Compilers and Interpreters Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
ISBN |
1-280-38851-X
9786613566430 3-642-15349-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata -- Symbolic and Compositional Reachability for Timed Automata -- Temporal Logics over Linear Time Domains Are in PSPACE -- Lossy Counter Machines Decidability Cheat Sheet -- Behavioral Cartography of Timed Automata -- On the Joint Spectral Radius for Bounded Matrix Languages -- Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P -- Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata -- Rewriting Systems for Reachability in Vector Addition Systems with Pairs -- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions -- Depth Boundedness in Multiset Rewriting Systems with Name Binding -- Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA -- Efficient Graph Reachability Query Answering Using Tree Decomposition. |
Record Nr. | UNISA-996466303003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Reachability Problems [[electronic resource] ] : 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings / / edited by Antonin Kucera, Igor Potapov |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (X, 199 p. 42 illus.) |
Disciplina | 511.35 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Software engineering Compilers (Computer programs) Computer science Machine theory Programming Techniques Software Engineering Compilers and Interpreters Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
ISBN |
1-280-38851-X
9786613566430 3-642-15349-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata -- Symbolic and Compositional Reachability for Timed Automata -- Temporal Logics over Linear Time Domains Are in PSPACE -- Lossy Counter Machines Decidability Cheat Sheet -- Behavioral Cartography of Timed Automata -- On the Joint Spectral Radius for Bounded Matrix Languages -- Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P -- Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata -- Rewriting Systems for Reachability in Vector Addition Systems with Pairs -- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions -- Depth Boundedness in Multiset Rewriting Systems with Name Binding -- Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA -- Efficient Graph Reachability Query Answering Using Tree Decomposition. |
Record Nr. | UNINA-9910483845703321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Recursion on the countable functionals / / D. Normann |
Autore | Normann Dag <1947-> |
Edizione | [1st ed. 1980.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [1980] |
Descrizione fisica | 1 online resource (X, 198 p.) |
Disciplina | 511.35 |
Collana | Lecture Notes in Mathematics |
Soggetto topico |
Computable functions
Recursion theory Logic, Symbolic and mathematical |
ISBN | 3-540-38170-8 |
Classificazione | 03D20 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The maximal type structure -- The countable functionals -- Ct(n) as a topological space -- Computability vs recursion -- The computable structure on Ct(k) -- Sections -- Some further results and topics. |
Record Nr. | UNISA-996466576903316 |
Normann Dag <1947-> | ||
Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [1980] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|