Weak bisimulation and model checking for Basic Parallel Processes (English)
National licence
- New search for: Mayr, Richard
- New search for: Mayr, Richard
In:
Foundations of Software Technology and Theoretical Computer Science
;
88-99
;
1996
- Article/Chapter (Book) / Electronic Resource
-
Title:Weak bisimulation and model checking for Basic Parallel Processes
-
Contributors:Mayr, Richard ( author )
-
Published in:Lecture Notes in Computer Science ; 1180 ; 88-99
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:1996-01-01
-
Size:12 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Circuit complexity before the dawn of the new millenniumAllender, Eric et al. | 1996
- 19
-
A lambda calculus with letrecs and barriersArvind / Maessen, Jan-Willem / Nikhil, Rishiyur S. / Stoy, Joseph et al. | 1996
- 37
-
TablesMunro, J. Ian et al. | 1996
- 43
-
Mechanized formal methods: Progress and prospectsRushby, John et al. | 1996
- 52
-
The parameter space of the d-step conjectureLagarias, J. C. / Prabhu, N. / Reeds, J. A. et al. | 1996
- 64
-
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning treesDas, Gautam / Kapoor, Sanjiv / Smid, Michiel et al. | 1996
- 76
-
Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstaclesMitra, Pinaki / Nandy, Subhas C. et al. | 1996
- 88
-
Weak bisimulation and model checking for Basic Parallel ProcessesMayr, Richard et al. | 1996
- 100
-
Testing processes for efficiencyJain, Kamal / Arun-Kumar, S. et al. | 1996
- 111
-
Regularity is decidable for normed PA processes in polynomial timeKučera, Antonín et al. | 1996
- 123
-
Dynamic maintenance of shortest path trees in simple polygonsKapoor, Sanjiv / Singh, Tripurari et al. | 1996
- 135
-
Close approximations of minimum rectangular coveringsLevcopoulos, Christos / Gudmundsson, Joachim et al. | 1996
- 147
-
A new competitive algorithm for agent searching in unknown streetsDasgupta, Pallab / Chakrabarti, P. P. / DeSarkar, S. C. et al. | 1996
- 156
-
On the design of hybrid control systems using automata modelsHung, Dang / Ji, Wang et al. | 1996
- 168
-
Constraint retraction in FDCodognet, Philippe / Diaz, Daniel / Rossi, Francesca et al. | 1996
- 180
-
Winskel is (almost) rightNipkow, Tobias et al. | 1996
- 193
-
An optimal deterministic algorithm for online b-matchingKalyanasundaram, Bala / Pruhs, Kirk et al. | 1996
- 200
-
Tight bounds for prefetching and buffer management algorithms for parallel I/O systemsVarman, Peter J. / Verma, Rakesh M. et al. | 1996
- 212
-
Complexity of the gravitational method for linear programmingMorin, T. L. / Prabhu, N. / Zhang, Z. et al. | 1996
- 224
-
Optimal and information theoretic syntactic Pattern Recognition involving traditional and transposition errorsOommen, B. J. / Loke, R. K. S. et al. | 1996
- 238
-
Minimal relative normalization in orthogonal expression reduction systemsGlauert, John / Khasidashvili, Zurab et al. | 1996
- 250
-
Trace consistency and inevitabilityRamanujam, R. et al. | 1996
- 262
-
Finite state implementations of knowledge-based programsMeyden, Ron et al. | 1996
- 274
-
Higher-order proof by consistencyLinnestad, Henrik / Prehofer, Christian / Lysne, Olav et al. | 1996
- 286
-
Advocating ownershipFernau, Henning / Lange, Klaus-Jörn / Reinhardt, Klaus et al. | 1996
- 298
-
Non-cancellative Boolean circuits: A generalization of monotone Boolean circuitsSengupta, Rimli / Venkateswaran, H. et al. | 1996
- 310
-
Limitations of the QRQW and EREW PRAM modelsKutyłowski, Mirosław / LoryŚ, Krzysztof et al. | 1996
- 322
-
Pinpointing computation with modular queries in the Boolean hierarchyAgrawal, Manindra / Beigel, Richard / Thierauf, Thomas et al. | 1996
- 335
-
Characterization of the principal type of normal forms in an intersection type systemSayag, Emilie / Mauny, Michel et al. | 1996
- 347
-
Correcting type errors in the Curry SystemGandhe, Milind / Venkatesh, G. / Sanyal, Amitabha et al. | 1996
- 359
-
Immediate fixpoints and their use in groundness analysisSØndergaard, Harald et al. | 1996
- 371
-
Graph types for monadic mobile processesYoshida, Nobuko et al. | 1996