Sciweavers

158 search results - page 24 / 32
» Loose Semantics of Petri Nets
Sort
View
GG
2010
Springer
13 years 8 months ago
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...
CONCUR
2007
Springer
14 years 1 months ago
Coalgebraic Models for Reactive Systems
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
Filippo Bonchi, Ugo Montanari
CONCUR
2004
Springer
14 years 1 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
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 ...
Paolo Baldan, Andrea Corradini, Barbara König
CSL
2007
Springer
13 years 11 months ago
Comparing the Expressive Power of Well-Structured Transition Systems
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...
IAJIT
2010
166views more  IAJIT 2010»
13 years 6 months ago
Specification and Prototyping of Reactive Distributed Systems with Algebraic Term Nets
: The specification of the dynamic behaviour of reactive distributed systems must exhibit the structures of control and has to imply explicitly the relevant aspects of the distribu...
Faiza Bouchoul, Mohamed Mostefai