You have Guest access.
Log In
Christel Baier and Holger Hermanns
Front matter
1-15
Modeling Timed Concurrent Systems
16-36
Some Remarks on Definability of Process Graphs
37-51
Sanity Checks in Formal Verification
52-63
Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
64-78
Probability and Nondeterminism in Operational Models of Concurrency
79-94
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
95-109
Proving Liveness by Backwards Reachability
110-125
Model Checking Quantified Computation Tree Logic
126-141
Liveness, Fairness and Impossible Futures
142-157
Checking a Mutex Algorithm in a Process Algebra with Fairness
158-172
A Complete Axiomatic Semantics for the CSP Stable-Failures Model
173-187
Transition Systems of Elementary Net Systems with Localities
188-202
Operational Determinism and Fast Algorithms
203-217
Minimization, Learning, and Conformance Testing of Boolean Programs
218-232
A Capability Calculus for Concurrency and Determinism
233-247
A New Type System for Deadlock-Free Processes
248-262
Sortings for Reactive Systems
263-278
Dynamic Access Control in a Concurrent Object Calculus
279-294
Concurrent Rewriting for Graphs with Equivalences
295-309
Event Structure Semantics for Nominal Calculi
310-326
Encoding ℂDuce in the ℂπ-Calculus
327-342
A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
343-357
Probabilistic I/O Automata: Theories of Two Equivalences
358-374
Reachability in Recursive Markov Decision Processes
375-389
Strategy Improvement for Stochastic Rabin and Streett Games
390-405
Weak Bisimulation Up to Elaboration
406-420
Generic Forward and Backward Simulations
421-434
On Finite Alphabets and Infinite Bases III: Simulation
435-449
Inference of Event-Recording Automata Using Timed Decision Trees (Extended Abstract)
450-464
Controller Synthesis for MTL Specifications
465-476
On Interleaving in Timed Automata
477-491
A Language for Task Orchestration and Its Semantic Properties
492-508
Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
509-523
Second-Order Simple Grammars
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info