Applications and Theory of Petri Nets [[electronic resource] ] : 29th International Conference, PETRI NETS 2008, Xi'an, China, June 23-27, 2008, Proceedings / / edited by Kees van Hee, Rüdiger Valk |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIII, 429 p.) |
Disciplina | 511.3/5 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer systems
Computer science Software engineering Computer science—Mathematics Discrete mathematics Computer networks Microprocessors Computer architecture Computer System Implementation Theory of Computation Software Engineering Discrete Mathematics in Computer Science Computer Communication Networks Processor Architectures |
ISBN | 3-540-68746-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Challenges and Opportunities for Formal Specifications in Service Oriented Architectures -- Modeling Interactions between Biochemical Reactions -- Transaction Calculus -- Stratifying Winning Positions in Parity Games -- On the Physical Basics of Information Flow -- Regular Papers -- Faster Unfolding of General Petri Nets Based on Token Flows -- Decomposition Theorems for Bounded Persistent Petri Nets -- Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study -- Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets -- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets -- Synthesis of Nets with Step Firing Policies -- Modelling and Analysis of the INVITE Transaction of the Session Initiation Protocol Using Coloured Petri Nets -- Modelling and Initial Validation of the DYMO Routing Protocol for Mobile Ad-Hoc Networks -- Formal Specification and Validation of Secure Connection Establishment in a Generic Access Network Scenario -- Parametric Language Analysis of the Class of Stop-and-Wait Protocols -- Hierarchical Set Decision Diagrams and Automatic Saturation -- Performance Evaluation of Workflows Using Continuous Petri Nets with Interval Firing Speeds -- Modelling Concurrency with Quotient Monoids -- Labeled Step Sequences in Petri Nets -- MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs -- Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper) -- A Practical Approach to Verification of Mobile Systems Using Net Unfoldings -- Cooperative Arrival Management in Air Traffic Control - A Coloured Petri Net Model of Sequence Planning -- Process Discovery Using Integer Linear Programming -- Tool Papers -- Synthesis of Petri Nets from Scenarios with VipTool -- A Monitoring Toolset for Paose -- Animated Graphical User Interface Generator Framework for Input-Output Place-Transition Petri Net Models -- HYPENS: A Matlab Tool for Timed Discrete, Continuous and Hybrid Petri Nets. |
Record Nr. | UNISA-996465284203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Foundations of Computer Science [[electronic resource] ] : Potential-Theory-Cognition / / edited by Christian Freksa, Matthias Jantzen, Rüdiger Valk |
Edizione | [1st ed. 1997.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
Descrizione fisica | 1 online resource (XII, 524 p.) |
Disciplina | 004 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Artificial intelligence Software engineering Computers and civilization Theory of Computation Artificial Intelligence Software Engineering/Programming and Operating Systems Computers and Society |
ISBN | 3-540-69640-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The might of formulas and their limits -- Hardware — Software -- Defining discipline -- Computer science as cultural development -- Towards adjusting informatics education to information era -- Informatics and society: A curriculum for distance education -- Syntactic and semantic aspects of parallelism -- Unique fixpoints in complete lattices with applications to formal languages and semantics -- On abstract families of languages, power series, and elements -- Are there formal languages complete for SymSPACE(log n)? -- On twist-closed trios: A new morphic characterization of r.e. sets -- An automata approach to some problems on context-free grammars -- On aperiodic sets of Wang tiles -- Closure under complementation of logspace complexity classes - A survey - -- A relation between sparse and printable sets in NSPACE(log n) -- A foundation for computable analysis -- A computer scientist's view of life, the universe, and everything -- Calendars and chronologies -- A uniform approach to Petri Nets -- Observing partial order runs of Petri Nets -- Representation theorems for Petri Nets -- A remark on trace equations -- Verification of distributed algorithms with algebraic Petri Nets -- A short story on action refinement -- Interactive and reactive systems: States, observations, experiments, input, output, nondeterminism, compositionality and all that -- Discrete time analysis of a state dependent tandem with different customer types -- How distributed algorithms play the token game -- The asynchronous stack revisited: Rounds set the twilight reeling -- Online scheduling of continuous media streams -- Contribution to Goodenough's and Gerhart's theory of software testing and verification: Relation between strong compiler test and compiler implementation verification -- On the arrangement complexity of uniform trees -- A relational-functional integration for declarative programming -- Inside and outside the Chinese room -- Abstract structures in spatial cognition -- Spatial and temporal structures in cognitive processes -- Qualitative vs. Fuzzy representations of spatial distance -- What's a part? On formalizing part-whole relations -- SPOCK: A feasibility study on the completeness of parts lists -- Decision support systems with adaptive reasoning strategies -- Knowledge discovery in databases — An inductive logic programming approach -- The composition heuristic -- The job assignment problem: A study in parallel and distributed machine learning -- Self-improving behavior arbitration -- Neural networks for manipulator path planning -- Path planning using a subgoal graph -- A nonlinear markovian characterization of time series using neural networks -- Feature-based perception of semantic concepts -- Automatic detection of thesaurus relations for information retrieval applications -- InfoSphere ? -V: a new approach to 3D-visualization of information. |
Record Nr. | UNINA-9910143472703321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Foundations of Computer Science [[electronic resource] ] : Potential-Theory-Cognition / / edited by Christian Freksa, Matthias Jantzen, Rüdiger Valk |
Edizione | [1st ed. 1997.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
Descrizione fisica | 1 online resource (XII, 524 p.) |
Disciplina | 004 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Artificial intelligence Software engineering Computers and civilization Theory of Computation Artificial Intelligence Software Engineering/Programming and Operating Systems Computers and Society |
ISBN | 3-540-69640-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The might of formulas and their limits -- Hardware — Software -- Defining discipline -- Computer science as cultural development -- Towards adjusting informatics education to information era -- Informatics and society: A curriculum for distance education -- Syntactic and semantic aspects of parallelism -- Unique fixpoints in complete lattices with applications to formal languages and semantics -- On abstract families of languages, power series, and elements -- Are there formal languages complete for SymSPACE(log n)? -- On twist-closed trios: A new morphic characterization of r.e. sets -- An automata approach to some problems on context-free grammars -- On aperiodic sets of Wang tiles -- Closure under complementation of logspace complexity classes - A survey - -- A relation between sparse and printable sets in NSPACE(log n) -- A foundation for computable analysis -- A computer scientist's view of life, the universe, and everything -- Calendars and chronologies -- A uniform approach to Petri Nets -- Observing partial order runs of Petri Nets -- Representation theorems for Petri Nets -- A remark on trace equations -- Verification of distributed algorithms with algebraic Petri Nets -- A short story on action refinement -- Interactive and reactive systems: States, observations, experiments, input, output, nondeterminism, compositionality and all that -- Discrete time analysis of a state dependent tandem with different customer types -- How distributed algorithms play the token game -- The asynchronous stack revisited: Rounds set the twilight reeling -- Online scheduling of continuous media streams -- Contribution to Goodenough's and Gerhart's theory of software testing and verification: Relation between strong compiler test and compiler implementation verification -- On the arrangement complexity of uniform trees -- A relational-functional integration for declarative programming -- Inside and outside the Chinese room -- Abstract structures in spatial cognition -- Spatial and temporal structures in cognitive processes -- Qualitative vs. Fuzzy representations of spatial distance -- What's a part? On formalizing part-whole relations -- SPOCK: A feasibility study on the completeness of parts lists -- Decision support systems with adaptive reasoning strategies -- Knowledge discovery in databases — An inductive logic programming approach -- The composition heuristic -- The job assignment problem: A study in parallel and distributed machine learning -- Self-improving behavior arbitration -- Neural networks for manipulator path planning -- Path planning using a subgoal graph -- A nonlinear markovian characterization of time series using neural networks -- Feature-based perception of semantic concepts -- Automatic detection of thesaurus relations for information retrieval applications -- InfoSphere ? -V: a new approach to 3D-visualization of information. |
Record Nr. | UNISA-996466095503316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|