Cristian Vidrascu

According to our database, Cristian Vidrascu authored at least 9 papers between 2000 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2008

Coverability Problems for Jumping Petri Nets.

Cristian Vidrascu

Proceedings of the SYNASC 2008, 2008

2005

Modular Analysis of Concurrency in Jumping Petri Nets.

Cristian Vidrascu

Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005

2004

Modelling and Verification with Jumping Petri Nets.

Cristian Vidrascu

Sci. Ann. Cuza Univ., 2004

2003

Concurrency-Degrees for P/T - Nets.

Cristian Vidrascu, Toader Jucan

Sci. Ann. Cuza Univ., 2003

Modelling a Sender-Receiver System.

Cristian Vidrascu

Acta Cybern., 2003

2002

Concurrency-Degrees for Jumping Petri-Nets.

Cristian Vidrascu, Toader Jucan

Sci. Ann. Cuza Univ., 2002

2001

Some Applications of the Minimal Coverability.

Cristian Vidrascu

Sci. Ann. Cuza Univ., 2001

T-invariants for jumping Petri nets.

Cristian Vidrascu

Comput. Sci. J. Moldova, 2001

2000

On Coverability Structures for Jumping Petri Nets.

Cristian Vidrascu, Toader Jucan

Sci. Ann. Cuza Univ., 2000