David de Frutos-Escrig

According to our database1, David de Frutos-Escrig
  • authored at least 81 papers between 1984 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Trace Simulation Semantics is not Finitely Based over BCCSP.
Acta Cybern., 2017

Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015).
Acta Inf., 2017

Evaluation of Temporal Datasets via Interval Temporal Logic Model Checking.
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

2016
Games for Bisimulations and Abstraction.
CoRR, 2016

Branching Bisimulation Games.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2016

2015
Proving Continuity of Coinductive Global Bisimulation Distances: A Never Ending Story.
Proceedings of the Proceedings XV Jornadas sobre Programación y Lenguajes, 2015

2014
Axiomatizing weak simulation semantics over BCCSP.
Theor. Comput. Sci., 2014

Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2014

2013
On the specification of modal systems: A comparison of three frameworks.
Sci. Comput. Program., 2013

Unifying the Linear Time-Branching Time Spectrum of Process Semantics
Logical Methods in Computer Science, 2013

2012
Distances between Processes: A Pure Algebraic Approach.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2012

The Equational Theory of Weak Complete Simulation Semantics over BCCSP.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Defining Distances for All Process Semantics.
Proceedings of the Formal Techniques for Distributed Systems, 2012

2011
Decidability and complexity of Petri nets with unordered data.
Theor. Comput. Sci., 2011

Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet.
Inf. Process. Lett., 2011

Accelerations for the Coverability Set of Petri Nets with Names.
Fundam. Inform., 2011

Graphical representation of covariant-contravariant modal formulae
Proceedings of the Proceedings 18th International Workshop on Expressiveness in Concurrency, 2011

On the Unification of Process Semantics: Logical Semantics
Proceedings of the Proceedings Eight Workshop on Structural Operational Semantics 2011, 2011

Axiomatizing Weak Ready Simulation Semantics over BCCSP.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations.
Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

2010
Decidability Problems in Petri Nets with Names and Replication.
Fundam. Inform., 2010

Decision Problems for Petri Nets with Names
CoRR, 2010

Equational Characterization of Covariant-Contravariant Simulation and Conformance Simulation Semantics
Proceedings of the Proceedings Seventh Workshop on Structural Operational Semantics, 2010

Logics for Contravariant Simulations.
Proceedings of the Formal Techniques for Distributed Systems, 2010

Forward Analysis for Petri Nets with Name Creation.
Proceedings of the Applications and Theory of Petri Nets, 2010

2009
Ready to preorder: an algebraic and general proof.
J. Log. Algebr. Program., 2009

(Bi)simulations up-to characterise process semantics.
Inf. Comput., 2009

On the Unification of Process Semantics: Equational Semantics.
Electr. Notes Theor. Comput. Sci., 2009

On the Unification of Process Semantics: Observational Semantics.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

On the Expressiveness of Refinement Settings.
Proceedings of the Fundamentals of Software Engineering, 2009

Non-strongly Stable Orders Also Define Interesting Simulation Relations.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication.
Proceedings of the Applications and Theory of Petri Nets, 2009

2008
Name Creation vs. Replication in Petri Net Systems.
Fundam. Inform., 2008

A congruence relation for sPBC.
Formal Methods in System Design, 2008

Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences.
Electr. Notes Theor. Comput. Sci., 2008

Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations.
Electr. Notes Theor. Comput. Sci., 2008

Universal Coinductive Characterisations of Process Semantics.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2008

2007
On the Expressiveness of Mobile Synchronizing Petri Nets.
Electr. Notes Theor. Comput. Sci., 2007

Simulations Up-to and Canonical Preorders: (Extended Abstract).
Electr. Notes Theor. Comput. Sci., 2007

Reflection and Preservation of Properties in Coalgebraic (bi)Simulations.
Proceedings of the Theoretical Aspects of Computing, 2007

New Bisimulation Semantics for Distributed Systems.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2007

Name Creation vs. Replication in Petri Net Systems.
Proceedings of the Petri Nets and Other Models of Concurrency, 2007

2006
Process Equivalences as Global Bisimulations.
J. UCS, 2006

Mobile Synchronizing Petri Nets: A Choreographic Approach for Coordination in Ubiquitous Systems.
Electr. Notes Theor. Comput. Sci., 2006

Replicated Ubiquitous Nets.
Proceedings of the Computational Science and Its Applications, 2006

Symbolic Semantics for the Verification of Security Properties of Mobile Petri Nets.
Proceedings of the Automated Technology for Verification and Analysis, 2006

2005
Tagged Systems: A Framework for the Specification of History-dependent Properties.
Electr. Notes Theor. Comput. Sci., 2005

Ubiquitous Systems and Petri Nets.
Proceedings of the Computational Science and Its Applications, 2005

Bisimulations Up-to for the Linear Time Branching Time Spectrum.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Preserving Contexts for Soft Conformance Relation.
Proceedings of the Formal Approaches to Software Testing, 4th International Workshop, 2004

2003
Ambient Petri nets.
Electr. Notes Theor. Comput. Sci., 2003

Replicated Ambient Petri Nets.
Proceedings of the Computational Science - ICCS 2003, 2003

2001
sPBC: A Markovian Extension of Finite Petri box calculus.
Proceedings of the 9th International Workshop on Petri Nets and Performance Models, 2001

Extending the Petri Box Calculus with Time.
Proceedings of the Application and Theory of Petri Nets 2001, 2001

2000
Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic.
Proceedings of the CONCUR 2000, 2000

Decidability of Properties of Timed-Arc Petri Nets.
ICATPN, 2000

1999
On non-decidability of reachability for timed-arc Petri nets.
Proceedings of the 8th International Workshop on Petri Nets and Performance Models, 1999

Global Timed Bisimulation: An Introduction.
Proceedings of the Formal Methods for Protocol Engineering and Distributed Systems, 1999

Relating May and Must Testing Semantics for Discrete Timed Process Algebras.
Proceedings of the Advances in Computing Science, 1999

1998
An invitation to friendly testing.
J. Comput. Sci. Technol., 1998

1997
Friendly Testing as a Conformance Relation.
Proceedings of the Formal Description Techniques and Protocol Specification, 1997

Denotational Semantics for Timed Testing.
Proceedings of the Transformation-Based Reactive Systems Development, 1997

A Sound and Complete Proof System for Probabilistic Processes.
Proceedings of the Transformation-Based Reactive Systems Development, 1997

1995
Characterizing termination in LOTOS via testing.
Proceedings of the Protocol Specification, 1995

Testing Semantics for Probabilistic LOTOS.
Proceedings of the Formal Description Techniques VIII, 1995

Acceptance Trees for Probabilistic Processes.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

Timed Processes of Timed Petri Nets.
Proceedings of the Application and Theory of Petri Nets 1995, 1995

1993
TIC: A TImed Calculus.
Formal Asp. Comput., 1993

Decidability of the strict reachability problem for TPN's with rational and real durations.
Proceedings of the 5th International Workshop on Petri Nets and Performance Models, 1993

A Characterization of LOTOS Representable Networks of Parallel Processes.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1991
A Complete Proof System for Timed Observations.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

On Narrowing Strategies for Partial Non-Strict Functions.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

Simulation of Timed Petri Nets by Ordinary Petri Nets and Applications to Decidability of the Timed Reachability Problem and other Related Problems.
Proceedings of the Fourth International Workshop on Petri Nets and Performance Models, 1991

Inverse Expansion.
Proceedings of the Formal Description Techniques, 1991

1990
Graphical Composition Theorems for Parallel and Hiding Operators.
Proceedings of the Formal Description Techniques, 1990

1989
TIC: A Timed Calculus for LOTOS.
Proceedings of the Formal Description Techniques, 1989

1987
Probabilistic Ianov's Schemes.
Theor. Comput. Sci., 1987

1986
Some Probabilistic Powerdomains in the Category SFP.
Proceedings of the STACS 86, 1986

Probabilistic Ianov's Schemes.
Proceedings of the CAAP '86, 1986

1984
A Characterization of Plotkin's Order in Powerdomains, and Some of its Properties.
Theor. Comput. Sci., 1984


  Loading...