|
СТ |
A Logical Viewpoint on Process-Algebraic Quotients |
1999 |
Kucera A., Esparza J. |
|
|
|
Lecture Notes in Computer Science |
12.11.1999 |
|
СТ |
A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets |
1992 |
Esparza J., Silva M. |
|
|
|
Theoretical Computer Science |
30.09.1992 |
|
СТ |
A solution to the covering problem for 1-bounded conflict-free Petri nets using Linear Programming |
1992 |
Esparza J. |
|
|
|
Information Processing Letters |
21.05.1992 |
|
СТ |
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis |
1999 |
Esparza J., Knoop J. |
|
|
|
Lecture Notes in Computer Science |
02.04.1999 |
|
СТ |
An Improvement of McMillan s Unfolding Algorithm |
1996 |
Esparza J., Romer S., Vogler W. |
|
|
|
Lecture Notes in Computer Science |
24.04.1996 |
|
СТ |
Checking System Properties via Integer Programming |
1996 |
Melzer S., Esparza J. |
|
|
|
Lecture Notes in Computer Science |
18.05.1996 |
|
СТ |
Complexity Results for 1-safe Nets |
1993 |
Cheng A., Esparza J., Palsberg J. |
|
|
|
Lecture Notes in Computer Science |
20.01.1994 |
|
СТ |
Constraint-Based Analysis of Broadcast Protocols |
1999 |
Delzanno G., Esparza J., Podelski A. |
|
|
|
Lecture Notes in Computer Science |
12.11.1999 |
|
СТ |
Decidability Issues for Petri Nets - a servey |
1994 |
Esparza J., Nielsen M. |
|
|
|
EATCS Bull. |
20.04.1994 |
|
СТ |
Decidability of Model Checking for Infinite-State Concurrent Systems |
1997 |
Esparza J. |
|
|
|
Acta Informatica |
06.03.1997 |
|
СТ |
Efficient Algorithms for Pre and Post on Interprocedural Parallel Flow Graphs |
2000 |
Esparza J., Podelski A. |
|
|
|
Papers Presented at the 27th ACM SIGPLAN-SIGACT Symp. on Pinciples of Programming Languages |
05.06.2000 |
|
СТ |
General Refinement and Recursion Operators for the Petri Box Calculus |
1993 |
Best E., Devillers R., Esparza J. |
|
|
|
Lecture Notes in Computer Science |
06.04.1993 |
|
СТ |
Grammars as Processes |
2002 |
Esparza J. |
|
|
|
Lecture Notes in Computer Science |
14.03.2002 |
|
СТ |
Implementing LTL Model Checking with Net Unfoldings |
2001 |
Esparza J., Heljanko K. |
|
|
|
Lecture Notes in Computer Science |
14.06.2001 |
|
СТ |
Model Cheking Using Net Unfoldings |
1993 |
Esparza J. |
|
|
|
Lecture Notes in Computer Science |
26.05.1993 |
|
СТ |
Model-Checking LTL with Regular Valuations for Pushdown Systems |
2001 |
Esparza J., Kucera A., Schwoon S. |
|
|
|
Lecture Notes in Computer Science |
04.11.2001 |
|
СТ |
On the Decidability of Model Checking for Several -calculi and Petri Nets |
1994 |
Esparza J. |
|
|
|
Lecture Notes in Computer Science |
30.04.1994 |
|
СТ |
On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes |
1995 |
Esparza J., Kiehn A. |
|
|
|
Lecture Notes in Computer Science |
27.07.1995 |
|
СТ |
Operational Semantics for the Petri Box Calculus |
1994 |
Koutny M., Esparza J., Best E. |
|
|
|
Lecture Notes in Computer Science |
26.08.1994 |
|
СТ |
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes |
1995 |
Esparza J. |
Lecture Notes in Computer Science |
|
|
Fundamentals of Computation Theory |
18.10.1995 |
|
СТ |
Separability in Conflict-Free Petri Nets |
2007 |
Best E., Esparza J., Wimmel H., Wolf K. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
29.04.2007 |
|
СТ |
Simple Representative Instantiations for Multicast Protocols |
2003 |
Esparza J., Maidl M. |
|
|
|
Lecture Notes in Computer Science |
17.04.2003 |
|
СТ |
Verification of Systems with an Infinite State Space |
2001 |
Esparza J. |
|
|
|
Lecture Notes in Computer Science |
04.11.2001 |
