Suchergebnisse - Esparza, Javier 1964-

Automata theory: an algorithmic approach

von Esparza, Javier 1964-, Blondin, Michael 1968-

Online lesen (frei zugänglich)

Model checking LTL using constraint programming

von Esparza, Javier 1964-, Melzer, Stephan

Free choice Petri nets

von Desel, Jörg 1959-, Esparza, Javier 1964-

Reachability in reversible free-choice systems

von Desel, Jörg 1959-, Esparza, Javier 1964-

Reachibility in live and safe free-choice Petri nets is NP-complete

von Esparza, Javier 1964-

Checking system properties via integer programming

von Melzer, Stefan, Esparza, Javier 1964-

Automata theory: an algorithmic approach

von Esparza, Javier 1964-, Blondin, Michael 1968-

An improvement of McMillan's unfolding algorithm

von Esparza, Javier 1964-, Römer, Stefan, Vogler, Walter

Synthesis rules for petri nets and how they lead to new results

von Esparza, Javier 1964-

Operational semantics for the Petri Box Calculus

von Koutny, Maciej, Esparza, Javier 1964-, Best, Eike 1951-

Model checking using net unfoldings

von Esparza, Javier 1964-

Handles in Petri nets

von Esparza, Javier 1964-, Silva, Manuel

Reduction and synthesis of live and bounded free choice Petri nets

von Esparza, Javier 1964-

Model checking of persistent Petri nets

von Best, Eike 1951-, Esparza, Javier 1964-

The asynchronous committee meeting problem

von Esparza, Javier 1964-, Stengel, Bernhard von

General refinement and recursion for the box calculus

von Best, Eike 1951-, Devillers, Raymond, Esparza, Javier 1964-

Shortest paths in reachability graphs

von Desel, Jörg 1959-, Esparza, Javier 1964-

A polynomial time algorithm to solve the covering problem for 1-bounded conflict-free Petri nets

von Esparza, Javier 1964-

Free choice Petri nets

von Desel, Jörg 1959-, Esparza, Javier 1964-

An effective tableau system for the linear time mu calculus

von Bradfield, Julian 1964-, Esparza, Javier 1964-, Mader, Angelika