|
|
|
|
LEADER |
04791nam a2200601 4500 |
001 |
978-3-540-48320-5 |
003 |
DE-He213 |
005 |
20191021211551.0 |
007 |
cr nn 008mamaa |
008 |
121227s1999 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540483205
|9 978-3-540-48320-5
|
024 |
7 |
|
|a 10.1007/3-540-48320-9
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a T57-57.97
|
072 |
|
7 |
|a PBW
|2 bicssc
|
072 |
|
7 |
|a MAT003000
|2 bisacsh
|
072 |
|
7 |
|a PBW
|2 thema
|
082 |
0 |
4 |
|a 519
|2 23
|
245 |
1 |
0 |
|a CONCUR'99. Concurrency Theory
|h [electronic resource] :
|b 10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings /
|c edited by Jos C.M. Baeten, Sjouke Mauw.
|
250 |
|
|
|a 1st ed. 1999.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 1999.
|
300 |
|
|
|a XII, 584 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 1664
|
505 |
0 |
|
|a Invited Lectures -- Temporal Process Logic -- An Unfolding Algorithm for Synchronous Products of Transition Systems -- Petri Nets, Configuration Structures and Higher Dimensional Automata -- Expressiveness and Distributed Implementation of Concurrent Calculi with Link Mobility -- Tutorials -- Techniques for Decidability and Undecidability of Bisimilarity -- Testing Concurrent Systems: A Formal Approach -- Accepted Papers -- Computing Minimum and Maximum Reachability Times in Probabilistic Systems -- Automating Modular Verification -- "Next" Heuristic for On-the-Fly Model Checking -- Model Checking of Message Sequence Charts -- Synthesis of Large Concurrent Programs via Pairwise Composition -- Approximative Symbolic Model Checking of Continuous-Time Markov Chains -- From Synchrony to Asynchrony -- Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic -- Weak and Strong Composition of High-Level Petri Nets -- Model Checking of Time Petri Nets Based on Partial Order Semantics -- Generic Process Algebras for Asynchronous Communication -- Timed Automata and the Theory of Real Numbers -- Metrics for Labeled Markov Systems -- The Expressive Power of Temporal Logic of Actions -- Object Types against Races -- Open Bisimulations on Chi Processes -- Rectangular Hybrid Games -- Localizability of Fairness Constraints and their Distributed Implementations -- Generating Type Systems for Process Graphs -- Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time -- Robust Satisfaction -- Statecharts via Process Algebra -- A Partial Order Event Model for Concurrent Objects -- Partial Order Reduction for Model Checking of Timed Automata -- On the Semantics of Place/Transition Nets -- Validating Firewalls in Mobile Ambients -- On Coherence Properties in Term Rewriting Models of Concurrency -- Synchronous Structures -- Weakest-Congruence Results for Livelock-Preserving Equivalences -- Proof-Checking Protocols Using Bisimulations -- Event Structures as Presheaves-Two Representation Theorems -- Subtyping and Locality in Distributed Higher Order Processes.
|
650 |
|
0 |
|a Applied mathematics.
|
650 |
|
0 |
|a Engineering mathematics.
|
650 |
|
0 |
|a Architecture, Computer.
|
650 |
|
0 |
|a Computer logic.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Programming languages (Electronic computers).
|
650 |
|
0 |
|a Computer programming.
|
650 |
1 |
4 |
|a Applications of Mathematics.
|0 http://scigraph.springernature.com/things/product-market-codes/M13003
|
650 |
2 |
4 |
|a Computer System Implementation.
|0 http://scigraph.springernature.com/things/product-market-codes/I13057
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|0 http://scigraph.springernature.com/things/product-market-codes/I1603X
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|0 http://scigraph.springernature.com/things/product-market-codes/I16013
|
650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|0 http://scigraph.springernature.com/things/product-market-codes/I14037
|
650 |
2 |
4 |
|a Programming Techniques.
|0 http://scigraph.springernature.com/things/product-market-codes/I14010
|
700 |
1 |
|
|a Baeten, Jos C.M.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Mauw, Sjouke.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662211533
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540664253
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 1664
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-48320-9
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|