Sciweavers

201 search results - page 8 / 41
» Petri nets with causal time for system verification
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, ...
ROOM
2000
13 years 9 months ago
Statecharts as Protocols for Objects
For the specification of object-oriented systems, usually several models representing different views are developed. The necessary integration of views is often delayed until impl...
Annette Laue, Matthias Liedtke, Daniel Moldt, Ivan...
JSW
2007
126views more  JSW 2007»
13 years 7 months ago
Supporting UML Sequence Diagrams with a Processor Net Approach
— UML sequence diagrams focus on the interaction between different classes. For distributed real time transaction processing it is possible to end up with complex sequence diagra...
Tony Spiteri Staines
EUROMICRO
2000
IEEE
14 years 3 days ago
Formal Coverification of Embedded Systems Using Model Checking
The complexity of embedded systems is increasing rapidly. In consequence, new verification techniques that overcome the limitations of traditional methods and are suitable for har...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
CONCUR
2000
Springer
14 years 22 hour ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny