(Enter summary)
Abstract: Semantics) For a 2 A consider the functions
E
I
a : 2
L(I)
! 2
L(I)
with
E
I
a (L) = df
ae
L a if a 2 A I
L otherwise
Then the local abstract semantic functions for (q; a; q
0
) 2\Gamma! p with respect to I
are defined by [[(q; a; q
0
)]] = df E
I
a .
The following property of these local abstract semantic functions is important.
Lemma 3.15. (Additivity) The functions E
I
a are additive, i.e. for all fL k jk
0g ` 2
L(I)
we have
E
I
a (
[
fL k jk 0g) =
[
fE
I
a (L... (Update)
Context of citations to this paper: More
...two levels, except for those synchronizing subnet N with subnet 1, which span the entire MDD. The round robin mutex protocol model [17] also has N identical safe subnets placed in a circular fashion, which represent N processes, each mapped to one MDD level. Another...
...composed in parallel. This issue has been addressed by re ned compositional veri cation approaches [GS90, CK93, Yeh93, CK95, CK96, GSL96, KM97, Che98, Gia99] which allow to generate the Lts of each separate process by taking into account interface constraints (also known as...
Cited by: More
Computer-Aided Verification: How to Trust a Machine with Your Life - Pace (2003)
(Correct)
Assumption Generation for Software Component Verification - Giannakopoulou.. (2002)
(Correct)
Equivalence-Based Reductions and checking for preorders - Bustan (2002)
(Correct)
Similar documents (at the sentence level):
75.2%: Compositional Minimisation of Finite State Systems.. - Graf, Steffen.. (1996)
(Correct)
26.9%: Compositional Minimization of Finite State Systems.. - Graf, Steffen.. (1995)
(Correct)
9.3%: Compositional Minimization of Finite State Systems - Graf, Steffen (1991)
(Correct)
Active bibliography (related documents): More All
0.3: Program Verification Using Abstraction Compositionally - Graf, Loiseaux (1993)
(Correct)
0.3: Model Checking and Modular Verification - Grumberg, Long (1991)
(Correct)
0.3: Heterogeneous Analysis and Verification for Distributed.. - Steffen, Margaria, Claßen (1995)
(Correct)
Similar documents based on text: More All
0.1: Verification Experiments on the MASCARA Protocol - Jia, Graf (2001)
(Correct)
0.1: Property Preserving Abstractions for the Verification of.. - Loiseaux, Graf, al. (1995)
(Correct)
0.1: Construction of abstract state graphs with PVS - Graf, Saidi (1997)
(Correct)
Related documents from co-citation: More All
6: Compositional State Space Generation from Lotos Programs
- Krimm, Mounier - 1997
5: Branching Time and Abstraction in Bisimulation Semantics (context) - van Glabbeek, Weijland - 1989
5: Communicating Sequential Processes (context) - Hoare - 1985
BibTeX entry: (Update)
S. Graf, G. Luttgen, and B. Steffen. Compositional Minimisation of Finite State Systems using Interface Specifications. Formal Aspects of Computation, 3, 1996. appeared as Passauer Informatik Bericht MIP9505. http://citeseer.ist.psu.edu/graf96compositional.html More
@article{ graf96compositional,
author = "Susanne Graf and Bernhard Steffen and Gerald Luttgen",
title = "Compositional Minimisation of Finite State Systems Using Interface Specifications",
journal = "Formal Aspects of Computing",
volume = "8",
number = "5",
pages = "607-616",
year = "1996",
url = "citeseer.ist.psu.edu/graf96compositional.html" }
Citations (may not include all citations):
2732
Communicating Sequential Processes (context) - Hoare - 1985
1933
Communication and Concurrency (context) - Milner - 1989
1726
Graph-based algorithms for boolean function manipulation
- Bryant - 1986
1097
Automatic verification of finite state concurrent systems us.. (context) - Clarke, Emerson et al. - 1983
815
Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
484
A calculus for communicating systems (context) - Milner - 1980
232
The Concurrency Workbench: A semantics-based tool for the ve..
- Cleaveland, Parrow et al. - 1993
231
Model checking and abstraction
- Clarke, Grumberg et al. - 1992
156
A unified approach to global program optimization (context) - Kildall - 1973
132
Using partial orders for the efficient verification of deadl.. (context) - Godefroid, Wolper - 1991
121
Compositional model checking
- Clarke, Long et al. - 1989
116
A structural induction theorem for processes (context) - Kurshan, McMillan - 1989
116
Monotone data flow analysis frameworks (context) - Kam, Ullman - 1977
96
Property preserving abstractions for the verification of con..
- Loiseaux, Graf et al. - 1995
87
Verifying properties of large sets of processes with network.. (context) - Wolper, Lovinfosse - 1989
68
one for all: on model checking using representatives (context) - Peled - 1993
66
Compositionality through an operational semantics of context.. (context) - Larsen, Xinxin - 1990
66
Reasoning about networks with many identical finite state pr.. (context) - Browne, Clarke et al. - 1986
56
fly verification with stubborn sets (context) - Valmari - 1993
55
Minimal model generation (context) - Bouajjani, Fernandez et al. - 1990
47
Generation of reduced models for checking fragments of CTL (context) - Dams, Grumberg et al. - 1993
26
Compositional minimization of finite state systems using int..
- Graf, Steffen et al. - 1995
18
A constraint oriented proof methodology based on modal trans..
- Larsen, Steffen et al. - 1994
18
The modular framework of computer-aided verification (context) - Shurek, Grumberg - 1990
15
Testing-based abstractions for value passing systems
- Cleaveland, Riely - 1994
15
communication behaviours and automatic verification (context) - Stadler, Grumberg - 1989
13
A preorder for partial process specifications (context) - Cleaveland, Steffen - 1990
13
Heterogeneous analysis and verification for distributed syst..
- Steffen, Margaria et al. - 1996
12
MCTL - an extension of CTL for modular verification of concu.. (context) - Josko - 1987
12
Program verification using compositional abstraction (context) - Graf, Loiseaux - 1993
11
Projections of the reachability graph and environment models (context) - Krumm - 1989
9
A logic-based proof technique using partial specifications (context) - Cleaveland, Steffen - 1990
9
Ald'ebaran: Un Syst`eme de V'erification par R'eduction de P.. (context) - Fernandez - 1988
8
Compositional checking of validity on finite state processes (context) - Winskel - 1990
7
Compositional proofs by partial specification of processes (context) - Larsen, Thomsen - 1988
7
Some observations on redundancy in a context (context) - Vaandrager - 1990
6
In transition from global to modular temporal reasoning abou.. (context) - Pnueli - 1990
5
Finite model checking and beyond
- Steffen - 1994
4
Logic in Computer Science (context) - Walker - 1988
4
the analysis of concurrent systems (context) - Fernandez, Schwartz et al. - 1983
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.icase.edu/~luettgen/publications/publications.html): More
Statecharts via Process Algebra - Lüttgen, von der Beeck, Cleaveland (1999)
(Correct)
A Process Algebra with Distributed Priorities - Cleaveland, Lüttgen, Natarajan (1996)
(Correct)
A natural Extension of Chomsky's Hierarchy - Albayrak, Lüttgen
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC