Sciweavers

37 search results - page 4 / 8
» Rewriting Logic as a Unifying Framework for Petri Nets
Sort
View
CADE
2004
Springer
14 years 7 months ago
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
José Meseguer, Grigore Rosu
CDC
2008
IEEE
119views Control Systems» more  CDC 2008»
13 years 9 months ago
Formal analysis of timed continuous Petri nets
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
Marius Kloetzer, Cristian Mahulea, Calin Belta, La...
PPDP
1999
Springer
13 years 11 months ago
A Calculus for Interaction Nets
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
Maribel Fernández, Ian Mackie
ENTCS
2006
146views more  ENTCS 2006»
13 years 7 months ago
Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
Iliano Cervesato, Andre Scedrov
SOFSEM
2010
Springer
13 years 5 months ago
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...
Parosh Aziz Abdulla