|
-
O. Burkart
Queues as Processes
-
G. Ciobanu, M. Rotaru
A Faithful Graphical Representation of the pi-calculus: Faithful
pi-nets
-
R. De Nicola, A. Labella
The Morphisms and Bisimulations
-
S. Haar
Branching Processes of General S/T-Systems
-
D. Hirschkoff
Automatically Proving Up-to Bisimulation
-
V. Janousek, T. Vojnar
State Spaces of Object-Oriented Petri Nets
-
G. Juhas
The Essence of Petri Nets and Transition Systems through Abelian
Groups
-
O. Kushnarenko, S. Pinchinat
Intentional Approaches for Symbolic Methods
-
J. Lilius
Efficient State Space Search for Time Petri Nets
-
A. Maggiolo-Schettini, S. Tini
Projectable Semantics for Statecharts
-
R. Mayr
Strict Lower Bounds for Model Checking BPA
-
M. Muller-Olm
Derivation of Characteristic Formulae
-
U. Nitsche
Construction of an Abstract State-Space from a Partial-Order Representation
of the Concrete One
-
P. Paczkowski
Characterizing Bisimilarity of Value-passing Processes with Context-free
Control
-
J. Stribrna
Hardness Results for Weak Bisimilarity of Simple Process Algebra
-
I. V. Tarasyuk
Place Bisimulation Equivalences for Design of Concurrent Systems
-
I. Virbitskaite
On the Semantics of Concurrency and Nondeterminism: Bisimulations
and Temporal Logics
|