Sciweavers

941 search results - page 144 / 189
» Petri Nets Are Dioids
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
CONCUR
2004
Springer
15 years 3 months ago
Extended Process Rewrite Systems: Expressiveness and Reachability
Abstract. We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less exp...
Mojmír Kretínský, Vojtech Reh...
EMISA
2006
Springer
15 years 3 months ago
A Unified Formal Foundation for Service Oriented Architectures
: This paper summarizes how an algebra for mobile systems, the -calculus, can be applied as unified formal foundation to service oriented architectures (SOA). The concepts accounte...
Frank Puhlmann
APSEC
2000
IEEE
15 years 3 months ago
A GUI and testing tool for SOFL
SOFL is a formal language and method for system specification and design. As a language it is an integration of Petri nets, Data Flow Diagrams, and VDM-SL. As a method it is a com...
Shaoying Liu, Tetsuo Fukuzaki, Koji Miyamoto