Sciweavers

86 search results - page 13 / 18
» Classical BI: Its Semantics and Proof Theory
Sort
View
LICS
2008
IEEE
14 years 2 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski
DLS
2008
213views Languages» more  DLS 2008»
13 years 9 months ago
A parsing machine for PEGs
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
Sérgio Medeiros, Roberto Ierusalimschy
TAGT
1998
Springer
243views Graph Theory» more  TAGT 1998»
13 years 11 months ago
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
Hartmut Ehrig, Reiko Heckel, Mercè Llabr&ea...
DBPL
1993
Springer
89views Database» more  DBPL 1993»
13 years 11 months ago
Database Programming in Transaction Logic
This paper presents database applications of the recently proposed Transaction Logic—an extension of classical predicate logic that accounts in a clean and declarative fashion f...
Anthony J. Bonner, Michael Kifer, Mariano P. Conse...
BPM
2009
Springer
168views Business» more  BPM 2009»
14 years 2 months ago
Divide-and-Conquer Strategies for Process Mining
The goal of Process Mining is to extract process models from logs of a system. Among the possible models to represent a process, Petri nets is an ideal candidate due to its graphic...
Josep Carmona, Jordi Cortadella, Michael Kishinevs...