Ferucio Laurentiu Tiplea

According to our database1, Ferucio Laurentiu Tiplea
  • authored at least 60 papers between 1991 and 2016.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
The Reversible Released Form of Petri Nets and Its Applications to Soundness of Workflow Nets.
IEEE Trans. Systems, Man, and Cybernetics: Systems, 2016

Distributive weighted threshold secret sharing schemes.
Inf. Sci., 2016

Boneh-Gentry-Hamburg's Identity-based Encryption Schemes Revisited.
IACR Cryptology ePrint Archive, 2016

Security of Identity-Based Encryption Schemes from Quadratic Residues.
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2016

2015
On the Complexity of Deciding Soundness of Acyclic Workflow Nets.
IEEE Trans. Systems, Man, and Cybernetics: Systems, 2015

New Results on Identity-based Encryption from Quadratic Residuosity.
IACR Cryptology ePrint Archive, 2015

On a Lightweight Authentication Protocol for RFID.
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2015

Key-Policy Attribute-Based Encryption for General Boolean Circuits from Secret Sharing and Multi-linear Maps.
Proceedings of the Cryptography and Information Security in the Balkans, 2015

2014
Resource Relocation in Workflow Nets With Time, Resource, and Task Priority Constraints.
IEEE Trans. Systems, Man, and Cybernetics: Systems, 2014

A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme.
Inf. Process. Lett., 2014

Key-policy Attribute-based Encryption for Boolean Circuits from Bilinear Maps.
IACR Cryptology ePrint Archive, 2014

On the Asymptotic Idealness of the Asmuth-Bloom Threshold Secret Sharing Scheme.
IACR Cryptology ePrint Archive, 2014

Efficient Key-policy Attribute-based Encryption for General Boolean Circuits from Multilinear Maps.
IACR Cryptology ePrint Archive, 2014

A Lightweight Authentication Protocol for RFID.
Proceedings of the Cryptography and Security Systems - Third International Conference, 2014

Key-Policy Attribute-Based Encryption for Boolean Circuits from Bilinear Maps.
Proceedings of the Cryptography and Information Security in the Balkans, 2014

2013
Priority Workflow Nets.
IEEE Trans. Systems, Man, and Cybernetics: Systems, 2013

Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes.
Inf. Sci., 2013

Reasoning about minimal anonymity in security protocols.
Future Generation Comp. Syst., 2013

2012
Decidability Results for Soundness Criteria of Resource-Constrained Workflow Nets.
IEEE Trans. Systems, Man, and Cybernetics, Part A, 2012

2011
Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable
CoRR, 2011

2010
Complexity of Anonymity for Security Protocols.
Proceedings of the Computer Security, 2010

2009
Soundness for S - and A -Timed Workflow Nets Is Undecidable.
IEEE Trans. Systems, Man, and Cybernetics, Part A, 2009

Classes of Szilard Languages in NC1.
Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009

An Automaton-based Formalism for Cooperative Augmented Reality Systems.
Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

2008
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete.
Journal of Computer Security, 2008

2007
Preface.
Electr. Notes Theor. Comput. Sci., 2007

2006
Petri net reactive modules.
Theor. Comput. Sci., 2006

Abstractions of data types.
Acta Inf., 2006

E-timed Workflow Nets.
Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), 2006

The Confluence Property for Petri Nets and its Applications.
Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), 2006

2005
Structural soundness of workflow nets is decidable.
Inf. Process. Lett., 2005

Decidability and Complexity Results for Security Protocols.
Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005

Instantiating Nets and Their Applications to Workflow Nets.
Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005

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

2002
On the Complexity of a Problem on Monadic String Rewriting Systems.
Journal of Automata, Languages and Combinatorics, 2002

SE-Systems, Timing Mechanisms, and Time-Varying Codes.
Int. J. Comput. Math., 2002

Characterization Results for Time-Varying Codes.
Fundam. Inform., 2002

The Home Marking Problem and Some Related Concepts.
Acta Cybern., 2002

A Simulation Preorder for Abstraction of Reactive Systems.
Proceedings of the Verification, 2002

The home marking problem and some related concepts.
Proceedings of the Prozessorientierte Methoden und Werkzeuge für die Entwicklung von Informationssystemen, 2002

2001
A note on synchronized extension systems.
Inf. Process. Lett., 2001

A Note on SE-Systems and Regular Canonical Systems.
Fundam. Inform., 2001

Synchronized extension systems.
Acta Inf., 2001

On the Complexity of a Problem on Monadic String Rewriting Systems.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

2000
A Note on Decidability of Reachability for Conditional Petri Nets.
Acta Cybern., 2000

1999
Petri Net Process Decomposition with Application to Validation.
Proceedings of the 6. Workshop Algorithmen und Werkzeuge für Petrinetze (AWPN'99), Frankfurt, Germany, October 11., 1999

1998
On Normalization of Petri Nets.
Sci. Ann. Cuza Univ., 1998

1997
Processes and Vectorial Characterizations of Parallel Communicating Grammar Systems.
Journal of Automata, Languages and Combinatorics, 1997

Hierarchies of Petri Net Languages and a Super-Normal Form.
Journal of Automata, Languages and Combinatorics, 1997

Jumping Petri Nets. Specific Properties.
Fundam. Inform., 1997

Pattern Ambiguities for Pure Context-Free Grammars.
Fundam. Inform., 1997

Jumping Petri Nets - Specific Properties.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996
On a Normal Form of Petri Nets.
Acta Cybern., 1996

1995
Hierarchies of Petri Net Languages and a Super-Normal Form.
Proceedings of the Developments in Language Theory II, 1995

(0, 1)-Total Pure Context-Free Grammars.
Proceedings of the Developments in Language Theory II, 1995

1994
Some Decision Problems for Parallel Communicating Grammar Systems.
Theor. Comput. Sci., 1994

1993
A Coverability Structure for Parallel Communicating Grammar Systems.
Elektronische Informationsverarbeitung und Kybernetik, 1993

Relation Based Controlled Petri Nets.
Sci. Ann. Cuza Univ., 1993

1992
Corrections to "Reversible and Strict Reversible P/T-Systems".
Sci. Ann. Cuza Univ., 1992

1991
Conditional Petri Net Languages.
Elektronische Informationsverarbeitung und Kybernetik, 1991


  Loading...