#### Filter Results:

- Full text PDF available (87)

#### Publication Year

1995

2018

- This year (3)
- Last 5 years (29)
- Last 10 years (57)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Paolo Baldan, Clara Bertolissi, Horatiu Cirstea, Claude Kirchner
- Mathematical Structures in Computer Science
- 2005

Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules, acting as elaborated… (More)

- Paolo Baldan, Andrea Corradini, Barbara König
- CONCUR
- 2001

In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produces a finite… (More)

- Paolo Baldan, Barbara König, Bernhard König
- SAS
- 2003

A technique for approximating the behaviour of graph transformation systems (GTSs) by means of Petri net-like structures has been recently defined in the literature. In this paper we introduce a… (More)

- Paolo Baldan, Silvia Crafa
- CONCUR
- 2010

We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history-preserving… (More)

Compositional semantics for open Petri nets based on deterministic processes† PAOLO BALDAN‡, ANDREA CORRADINI§, HARTMUT EHRIG¶ and REIKO HECKEL‖ ‡Dipartimento di Informatica, Università Ca’ Foscari… (More)

- Paolo Baldan, Barbara König
- ICGT
- 2002

We propose a technique for the analysis of graph transformation systems based on the construction of finite structures approximating the behaviour of such systems with arbitrary accuracy. Following a… (More)

We extend our approach for verifying properties of graph transformation systems using suitable abstractions. In the original approach properties are specified as formulae of a propositional temporal… (More)

- Paolo Baldan, Andrea Corradini, Ugo Montanari
- Inf. Comput.
- 2001

We present an event structure semantics for contextual nets , an extension of P/T Petri nets where transitions can check for the presence of to kens without consuming them (read-only operations). A… (More)

- Paolo Baldan
- 2000

Graph grammars (or graph transformation systems), originally introduced as a generalization of string grammars, can be seen as a powerful formalism for the specification of concurrent and distributed… (More)

- Paolo Baldan, Andrea Corradini, Barbara König
- CONCUR
- 2004

We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the unfolding semantics… (More)