Sciweavers

101 search results - page 14 / 21
» On Reachability in Autonomous Continuous Petri Net Systems
Sort
View
CSL
2007
Springer
15 years 3 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...
ACSD
2004
IEEE
86views Hardware» more  ACSD 2004»
15 years 3 months ago
Modular Analysis of Systems Composed of Semiautonomous Subsystems
This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factory automation systems. It presents new algorithms to harness this modular analys...
Charles Lakos, Laure Petrucci
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
14 years 9 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen
HYBRID
2003
Springer
15 years 4 months ago
Reachability Analysis of Nonlinear Systems Using Conservative Approximation
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
Eugene Asarin, Thao Dang, Antoine Girard
CONCUR
2004
Springer
15 years 4 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